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

Multi-source Cross-lingual Delexicalized Parser Transfer: Prague or Stanford?

TL;DR: It is found that best results can be obtained by parsing the target sentences with parsers trained on treebanks using both of the adposition annotation styles in parallel, and combining all the resulting parse trees together after having converted them to the Stanford adposition style.
Proceedings ArticleDOI

Baseline Models for Pronoun Prediction and Pronoun-Aware Translation

TL;DR: B baseline models for the cross-lingual pronoun prediction task and the pronoun-focused translation task at DiscoMT 2015 are presented and the impact of various contextual features on the prediction performance is discussed.
Proceedings ArticleDOI

Automatic Selection of Context Configurations for Improved Class-Specific Word Representations

TL;DR: The authors proposed a simple yet effective framework for an automatic selection of class-specific context configurations, based on universal dependency relations between words, and efficiently search this space with an adapted beam search algorithm.
Proceedings ArticleDOI

Estimating the influence of auxiliary tasks for multi-task learning of sequence tagging tasks

TL;DR: New methods to automatically assess the similarity of sequence tagging datasets to identify beneficial auxiliary data for MTL or TL setups are proposed and empirically show that their similarity measures correlate with the change in test score of neural networks that use the auxiliary dataset for M TL to increase the main task performance.
Proceedings ArticleDOI

Automatic Proposition Extraction from Dependency Trees: Helping Early Prediction of Alzheimer's Disease from Narratives

TL;DR: This work proposes a novel approach to obtaining the ID automatically from a text using an automation of Chand et al.'s ID manual, and consists of a rule-based system acting upon dependency trees.
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)