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

Dynamic-oracle Transition-based Parsing with Calibrated Probabilistic Output

TL;DR: Evaluation of an Arc-Eager parser on 6 languages shows that the AdaGrad-RDA based training procedure results in models that provide the same high level of accuracy as the averagedperceptron trained models, while being sparser and providing well-calibrated probabilistic output.
Proceedings ArticleDOI

Efficient Inner-to-outer Greedy Algorithm for Higher-order Labeled Dependency Parsing

TL;DR: This paper proposes an efficient dependency parsing algorithm that is capable of capturing multiple edge-label features, while maintaining low computational complexity.
Proceedings Article

Latin Vallex. A Treebank-based Semantic Valency Lexicon for Latin

TL;DR: This paper presents Latin Vallex, a valency lexicon for Latin built in mutual connection with the semantic and pragmatic annotation of two Latin treebanks featuring texts of different eras.
Journal ArticleDOI

Cross-lingual transfer learning for relation extraction using Universal Dependencies

TL;DR: A novel transfer learning method is presented for cross-language relation extraction using the Universal Dependency (UD) parsing, which is a language-agnostic formalism for representation of syntactic structures, and two deep networks are proposed to use this representation.
Journal ArticleDOI

Detecting light verb constructions across languages

TL;DR: This paper focuses on the automatic detection of LVCs in raw text in four different languages, namely, English, German, Spanish, and Hungarian, and provides a standardized (i.e., language-independent) representation of LVDs that can be used in machine learning experiments.
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)