Open AccessProceedings Article
Universal Dependency Annotation for Multilingual Parsing
Ryan McDonald,Joakim Nivre,Yvonne Quirmbach-Brundage,Yoav Goldberg,Dipanjan Das,Kuzman Ganchev,Keith Hall,Slav Petrov,Hao Zhang,Oscar Täckström,Claudia Bedini,Núria Bertomeu Castelló,Jungmee Lee +12 more
- Vol. 2, pp 92-97
Reads0
Chats0
TLDR
A new collection of treebanks with homogeneous syntactic dependency annotation for six languages: German, English, Swedish, Spanish, French and Korean is presented, made freely available in order to facilitate research on multilingual dependency parsing.Abstract:
We present a new collection of treebanks with homogeneous syntactic dependency annotation for six languages: German, English, Swedish, Spanish, French and Korean. To show the usefulness of such a resource, we present a case study of crosslingual transfer parsing with more reliable evaluation than has been possible before. This ‘universal’ treebank is made freely available in order to facilitate research on multilingual dependency parsing. 1read more
Citations
More filters
Journal ArticleDOI
Constructing Code-mixed Universal Dependency Forest for Unbiased Cross-lingual Relation Extraction
TL;DR: In this article , a code-mixed universal dependency (UD) forest is constructed for cross-lingual relation extraction (XRE) by translating the sentence of the source language to the parallel target-side language, for both of which they parse the UD tree respectively.
Proceedings ArticleDOI
Adventures in Multilingual Parsing
TL;DR: Techniques for joint morphological and syntactic parsing that combines statistical dependency parsing and rule-based morphological analysis, specifically targeting the challenges posed by richly inflected languages are described.
Towards Cross-language Application of Dependency Grammar
Timo Järvinen,Elisabeth Bertol,Septina Dian Larasati,Monica-Mihaela Rizea,Maria Ruiz Santabalbina,Milan Souċek +5 more
TL;DR: This paper discusses the adaptation of the Stanford typed dependency model (de Marneffe and Manning 2008) to the requirements of typologically different languages from the viewpoint of practical parsing and argues for a framework of functional dependency grammar that is based on the idea of parallelism between syntax and semantics.
Proceedings Article
Multilingual discriminative lexicalized parsing
TL;DR: This work provides a generalization of discriminative lexicalized shift reduce parsing techniques for phrase structure grammar to a wide range of morphologically rich languages.
References
More filters
ReportDOI
Building a large annotated corpus of English: the penn treebank
TL;DR: As a result of this grant, the researchers have now published on CDROM a corpus of over 4 million words of running text annotated with part-of- speech (POS) tags, which includes a fully hand-parsed version of the classic Brown corpus.
Proceedings ArticleDOI
Accurate Unlexicalized Parsing
Dan Klein,Christopher D. Manning +1 more
TL;DR: It is demonstrated that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down false independence assumptions latent in a vanilla treebank grammar.
Proceedings Article
Generating Typed Dependency Parses from Phrase Structure Parses
TL;DR: A system for extracting typed dependency parses of English sentences from phrase structure parses that captures inherent relations occurring in corpus texts that can be critical in real-world applications is described.
Proceedings ArticleDOI
CoNLL-X Shared Task on Multilingual Dependency Parsing
Sabine Buchholz,Erwin Marsi +1 more
TL;DR: How treebanks for 13 languages were converted into the same dependency format and how parsing performance was measured is described and general conclusions about multi-lingual parsing are drawn.
Proceedings ArticleDOI
The Stanford Typed Dependencies Representation
TL;DR: This paper examines the Stanford typed dependencies representation, which was designed to provide a straightforward description of grammatical relations for any user who could benefit from automatic text understanding, and considers the underlying design principles of the Stanford scheme.