| Challenge: | In the 2017 CoNLL Shared Task on Universal Dependency Parsing, 25 languages have more than one treebank . many teams did not take advantage of the multiple treebanks, however, and trained one model per treebank instead of one model for each language. |
| Approach: | They propose a method to make the most of heterogeneous treebanks when training a monolingual parser. |
| Outcome: | The proposed method improves on training with multiple treebanks for a single language. |
Similar Papers
Treebank Embedding Vectors for Out-of-Domain Dependency Parsing (2020.acl-main)
Copied to clipboard
| Challenge: | a recent advance in monolingual dependency parsing is the idea of a treebank embedding vector . this allows the model to prefer training data from one treebank over another at test time . |
| Approach: | They propose a method to predict a treebank vector for sentences that do not come from a particular treebank . they also explore what happens when they move away from predefined treebank embedding vectors . |
| Outcome: | The proposed method can predict treebank vectors for sentences that do not come from a treebank used in training with sufficient accuracy for nine out of ten languages. |
Cheating a Parser to Death: Data-driven Cross-Treebank Annotation Transfer (L18-1)
Copied to clipboard
| Challenge: | Using annotated corpus for linguistic purposes is no longer justified . hand-crafted syntactic resources such as grammars and lexicons can be used as sources of features to guide data driven systems. |
| Approach: | They propose an efficient method for transferring annotations between two different treebanks of the same language. |
| Outcome: | The proposed method is based on the Universal Dependency annotation scheme and was evaluated on the gold standard (94.75% of LAS, 99.40% UAS on the test set). |
Supervised Treebank Conversion: Data and Approaches (P18-1)
Copied to clipboard
| Challenge: | Existing work on treebank conversion focuses on unsupervised treebanks . lack of manually labeled data means that sentences have two syntactic trees at the same time. |
| Approach: | They propose supervised treebank conversion using bi-tree aligned sentences . they propose two conversion approaches based on state-of-the-art deep biaffine parser . |
| Outcome: | The proposed method outperforms the state-of-the-art deep biaffine parser on the English WSJ dataset by 0.97 (93.76% -92.79%) |
Cross-lingual Parsing with Polyglot Training and Multi-treebank Learning: A Faroese Case Study (D19-61)
Copied to clipboard
| Challenge: | Cross-lingual dependency parsing involves transferring syntactic knowledge from one language to another. |
| Approach: | They compare two approaches to cross-lingual dependency parsing using monolingual source models and a polyglot model which is trained on the combination of all source languages. |
| Outcome: | The proposed methods improve low-resource dependency parsers by transferring syntactic knowledge from one language to another. |
Scalable Cross-lingual Treebank Synthesis for Improved Production Dependency Parsers (2020.coling-industry)
Copied to clipboard
| Challenge: | scalable Universal Dependency (UD) treebank synthesis techniques are used to improve production-grade parsers. |
| Approach: | They propose a data augmentation technique that uses synthetic treebanks to improve production-grade parsers. |
| Outcome: | The proposed technique improves LAS performance on seven languages by up to two points on production models trained on original UD treebanks. |
Some Languages Seem Easier to Parse Because Their Treebanks Leak (2020.emnlp-main)
Copied to clipboard
| Challenge: | Cross-language differences in (universal) dependency parsing performance are mostly attributed to treebank size, average sentence length, average dependency length, morphological complexity, and domain differences. |
| Approach: | They compute graph isomorphisms and find that treebank size is a factor that influences parsing performance. |
| Outcome: | The results show that the overlap between training and test graphs explain more of the observed variation than standard explanations such as the above. |
Development of a Multilingual CCG Treebank via Universal Dependencies Conversion (2022.lrec-1)
Copied to clipboard
| Challenge: | Combinatory Categorial Grammar (CCG) is a lexicalized grammar formalism that can capture both syntactic and semantic information. |
| Approach: | They propose an algorithm to convert UD treebanks to CCG treebank and propose future extensions. |
| Outcome: | The proposed algorithm performs lexical, sentential, and syntactic rule coverage analysis, as well as CCG parsing experiments. |
Cross-Lingual Dependency Parsing Using Code-Mixed TreeBank (D19-1)
Copied to clipboard
| Challenge: | Treebank translation is a promising method for cross-lingual transfer of syntactic dependency knowledge. |
| Approach: | They propose to map dependency arcs from source treebank to target translation according to word alignments. |
| Outcome: | Experiments on university dependency treebanks show that translated treebank translations are more effective than translated treebans. |
Climbing the Tower of Treebanks: Improving Low-Resource Dependency Parsing via Hierarchical Source Selection (2021.findings-acl)
Copied to clipboard
| Challenge: | Recent work on multilingual dependency parsing focused on developing highly multilingual parsers . a recent major paradigm shift in NLP towards largescale pretrained language models has reduced the downstream relevance of supervised syntactic parse. |
| Approach: | They propose a heuristic approach to multilingual dependency parsing that heurs out the "one model to rule them all" approach by hierarchically clustering all Universal Dependencies languages based on their syntactic similarity . |
| Outcome: | The proposed approach outperforms a "one model to rule them all" approach with a heuristic selection of languages and treebanks for a target language. |
Quantifying training challenges of dependency parsers (C18-1)
Copied to clipboard
| Challenge: | a new metric is introduced to evaluate the difficulty to learn a given class of dependencies . a series of systematic computations using that metric have revealed interesting properties of the 3 considered parsing algorithms . |
| Approach: | They introduce a new metric to evaluate the difficulty to learn a given class of dependencies . they use it to characterize the information conveyed by cross-lingual parsers . |
| Outcome: | The proposed metric reveals the kind of dependencies that require high effort during training . it also shows that cross-lingual parsers can provide better quality information . |