Парсеры зависимостей

We present an effective training al- gorithm for linearly-scored dependency parsers that implements online large- margin multi-class training (Crammer and Singer, 2003; Crammer et al., 2003) on top of efficient …...

Several recently reported techniques for the automatic acquisition of Information Extraction (IE) systems have used depen- dency trees as the basis of their extrac- tion pattern representation. These ap- proaches …...

We present a novel semi-supervised training algorithm for learning dependency parsers. By combining a supervised large margin loss with an unsupervised least squares loss, a dis- criminative, convex, semi-supervised learning …...

AbstractThis paper shows that a LAF/GrAF-based annotation schema can be used for the adequate representation of syntactic dependency structures possibly in many languages. We first argue that there are at …...

Sanskrit, the classical language of India, presents specific challenges for computational linguistics: exact phonetic transcription in writing that obscures word boundaries, rich morphology and an enormous corpus, among others. Recent …...

A serious bottleneck of comparative parser evaluation is the fact that different parsers subscribe to different formal frameworks and theoretical assumptions. Converting outputs from one framework to another is less …...

It has been established that incorporating word cluster features derived from large unlabeled corpora can significantly improve prediction of linguistic structure. While previous work has focused primarily on English, we …...

AbstractWe present a carefully designed dependency conversion of the German phrase-structure treebank TiGer that explicitly represents verb ellipses by introducing empty nodes into the tree. Although the conversion process uses …...

This paper describes the systems deployed by the ALPAGE team to participate to the SemEval-2014 Task on Broad-Coverage Semantic Dependency Parsing. We de- veloped two transition-based dependency parsers with extended …...

AbstractThe Norwegian Dependency Treebank is a new syntactic treebank for Norwegian Bokmäl and Nynorsk with manual syntactic and morphological annotation, developed at the National Library of Norway in collaboration with …...

For many NLP applications that require a parser, the sentences of interest may not be well-formed. If the parser can overlook prob- lems such as grammar mistakes and produce a …...

AbstractDifferent languages might have different word orders. In this paper, we investigate crosslingual transfer and posit that an orderagnostic model will perform better when transferring to distant foreign languages. To …...

AbstractI present ETHAN: Experimental Testing of Hybrid AI Node implemented entirely on free cloud computing infrastructure. The ultimate goal of this research is to create modular reusable hybrid neuro-symbolic architecture …...

AbstractSentence encoders map sentences to real valued vectors for use in downstream applications. To peek into these representations—e.g., to increase interpretability of their results—probing tasks have been designed which query …...

AbstractA wide variety of transition-based algorithms are currently used for dependency parsers. Empirical studies have shown that performance varies across different treebanks in such a way that one algorithm outperforms …...

Previous work on adversarial attacks on depen- dency parsers has mostly focused on attack methods, as opposed to the quality of adver- sarial examples, which in previous work has been …...

AbstractFor text-level discourse analysis there are various discourse schemes but relatively few labeleddata because discourse research is still immature and it is labor-intensive to annotate the innerlogic of a text. …...