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
Proceedings ArticleDOI
Low Saxon dialect distances at the orthographic and syntactic level
TL;DR: The authors compare five Low Saxon dialects from the 19th and 21st century from Germany and the Netherlands with each other as well as with modern Standard Dutch and Standard German and show that these two lead to different distances.
Proceedings ArticleDOI
Differentiable Parsing and Visual Grounding of Natural Language Instructions for Object Placement
TL;DR: Paragon as discussed by the authors uses a particle-based graph neural network to reason about object placements with uncertainty and integrates a parsing algorithm into a probabilistic, data-driven learning framework.
Proceedings Article
A Multi-word Expression Dataset for Swedish.
TL;DR: This work presents a new set of 96 Swedish multi-word expressions annotated with degree of (non-)compositionality, and uses the annotations to evaluate a system for automatic compositionality estimation based on distributional semantics.
Proceedings Article
DeQue: A Lexicon of Complex Prepositions and Conjunctions in French
TL;DR: DeQue is introduced, a lexicon covering French complex prepositions like a partir de (from) and complex conjunctions (CCONJ) like bien que (although) and the general characteristics of CPRE and CCONJ in French, with special focus on syntactic ambiguity.
Proceedings ArticleDOI
Composing Noun Phrase Vector Representations.
TL;DR: This work proposes two novel constraints for computing noun phrase vector representations, suggesting that the semantic and not the syntactic contribution of each component of a noun phrase should be considered, so that the resulting composed vectors express more of the phrase meaning.
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.