Treebanks

Tree-based approaches to alignment model translation as a sequence of probabilistic op- erations transforming the syntactic parse tree of a sentence in one language into that of the other. The …...

Each year the Conference on Com- putational Natural Language Learning (CoNLL)1 features a shared task, in which participants train and test their systems on exactly the same data sets, in …...

We investigate the problem of training probabilistic context-free grammars on the basis of a distribution defined over an infinite set of trees, by minimizing the cross-entropy. This problem can be …...

We describe some challenges of adaptation in the 2007 CoNLL Shared Task on Domain Adaptation. Our error analysis for this task suggests that a primary source of error is differences …...

The Conference on Computational Natural Language Learning features a shared task, in which participants train and test their learn- ing systems on the same data sets. In 2007, as in …...

Finding a class of structures that is rich enough for adequate linguistic represen- tation yet restricted enough for efficient computational processing is an important problem for dependency parsing. In this …...

A variety of query systems have been devel- oped for interrogating parsed corpora, or tree- banks. With the arrival of efficient, wide- coverage parsers, it is feasible to create very …...

AbstractMost of the reliable language resources are developed via human supervision. Developing supervised annotated data is hard and tedious, and it will be very time consuming when it is done …...

Paratactic syntactic structures are noto- riously difficult to represent in depen- dency formalisms. This has painful con- sequences such as high frequency of pars- ing errors related to coordination. In …...

We explore the extent to which high- resource manual annotations such as tree- banks are necessary for the task of se- mantic role labeling (SRL). We examine how performance changes …...

We introduce three techniques for improv- ing constituent parsing for morphologi- cally rich languages. We propose a novel approach to automatically find an optimal preterminal set by clustering morphologi- cal …...

Accurate dependency parsing requires large treebanks, which are only available for a few languages. We propose a method that takes advantage of shared structure across languages to build a mature …...

AbstractTo ensure portability of NLP systems across multiple domains, existing treebanks are often extended by adding trees from interesting domains that were not part of the initial annotation effort. In …...

AbstractThe question of how to compare languages and more generally the domain of linguistic typology, relies on the study of different linguistic properties or phenomena. Classically, such a comparison is …...

AbstractThis paper summarizes the preliminary results of an ongoing survey on multiword resources carried out within the IC1207 Cost Action PARSEME (PARSing and Multi-word Expressions). Despite the availability of language …...

AbstractWe investigate parsing replicability across 7 languages (and 8 treebanks), showing that choices concerning the use of grammatical functions in parsing or evaluation, the influence of the rare word threshold, …...

AbstractWe propose a practical scheme to train a single multilingual sequence labeling model that yields state of the art results and is small and fast enough to run on a …...

AbstractUniversal Dependencies is an open community effort to create cross-linguistically consistent treebank annotation for many languages within a dependency-based lexicalist framework. The annotation consists in a linguistically motivated word segmentation; …...