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
Posted Content
Parsing Universal Dependencies without training
TL;DR: UDP is presented, the first training-free parser for Universal Dependencies (UD), based on PageRank and a small set of specific dependency head rules, which offers a linguistically sound unsupervised alternative to cross-lingual parsing for UD.
Book
A Criterial Approach to the Cartography of V2
TL;DR: The V2 “constraint” shall be observed as a sum of micro-V2s, in which the inflected head creates Spec-Head configurations with the activated criterial positions in the relevant context.
Non-constituent coordination and other coordinative constructions as Dependency Graphs
Kim Gerdes,Sylvain Kahane +1 more
TL;DR: A new dependency-based analysis of coordination is proposed that generalizes over existing analyses by combining symmetrical and asymmetrical analyses of coordination into a DAG structure that is theoretically grounded in the notion of connections between words.
Proceedings ArticleDOI
Conversion from Paninian Karakas to Universal Dependencies for Hindi Dependency Treebank
TL;DR: This paper extends UD to Indian languages through conversion of Pānịnian Dependencies to UD for the Hindi Dependency Treebank, producing an automatically converted Hindi Treebank conforming to the international standard UD scheme.
Posted Content
Cross-lingual Semantic Role Labeling with Model Transfer
TL;DR: This article proposes an end-to-end SRL model that incorporates a variety of universal features and transfer methods, and finds that gold syntax features are much more crucial for cross-lingual SRL, compared with the automatically-generated ones.
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.