scispace - formally typeset
Open AccessProceedings Article

Universal Dependency Annotation for Multilingual Parsing

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. 1

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings Article

Joint learning of constituency and dependency grammars by decomposed cross-lingual induction

TL;DR: Compared with the structured projection that projects the complete structures, decomposed projection achieves better adaptation of non-isomorphism between languages and efficiently acquires the structured information across languages, thus leading to better performance.
Proceedings ArticleDOI

On the data requirements of probing

TL;DR: A novel method to estimate the required number of data samples in such experiments is presented and, across several case studies, it is verified that the estimations have sufficient statistical power.
Journal ArticleDOI

UDapter: Typology-based Language Adapters for Multilingual Dependency Parsing and Sequence Labeling

TL;DR: In-depth analyses show that adapter generation via typological features of languages is key to this success of the proposed adaptation approach, and combines typological feature prediction with parsing in a multi-task model that achieves very competitive parsing performance without the need for an external prediction system for missing features.
Dissertation

Transition-based combinatory categorial grammar parsing for English and Hindi

TL;DR: An incremental algorithm for parsing CCG for two diverse languages: English and Hindi and a cross-formalism experiment where it is shown that CCG supertags can improve widely used dependency parsers.
Posted Content

A Sub-Character Architecture for Korean Language Processing

TL;DR: The authors decomposes each character into a small set of primitive phonetic units called jamo letters from which character-and word-level representations are induced, revealing syntactic and semantic information that is difficult to access with conventional character-level units.
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

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

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.
Related Papers (5)