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
Objectifying Women? A Syntactic Bias in French and English Corpora.
Yanis da Cunha,Anne Abeillé +1 more
TL;DR: This paper found that masculine pronouns are more often subjects than feminine pronouns, in both English and French, and that this syntactic function bias is not reducible to a bias in semantic role assignment since it is also found with nonagentive subjects.
Journal ArticleDOI
Inductive general grammar
TL;DR: The only useful generalizations about language are inductive generalizations, so that when adequate data about many languages is gathered, the problem of general grammar will be returned to.
Proceedings ArticleDOI
Masked Part-Of-Speech Model: Does Modeling Long Context Help Unsupervised POS-tagging?
TL;DR: A Masked Part-of-Speech Model (MPoSM) is proposed, inspired by the recent success of Masked Language Models (MLM), that can model arbitrary tag dependency and perform POS induction through the objective of masked POS reconstruction and achieves overall better performance.
A Study on Dialogue Agent Adapting to Various Situations
TL;DR: In order to increase the abstraction level, the system also uses metamodel which represents a set of word such as all the nouns or all the words which can be used to answer to a wh-question.
Matrix and Double-Array Representations for Efficient Finite State Tokenization
TL;DR: An algorithm and implementation for efficient tokenization of space-delimited languages based on a deterministic finite state automaton that is faster than other tools while maintaining comparable quality is presented.
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.