Contemplata, a Free Platform for Constituency Treebank Annotation
This paper describes Contemplata, an annotation platform that offers a generic solution for treebank building as well as treebank enrichment with relations between syntactic nodes. Contemplata is dedicated to the annotation of constituency trees. The framework includes support for syntactic parsers, which provide automatic annotations to be manually revised. The balanced strategy of annotation between automatic parsing and manual revision allows to reduce the annotator workload, which favours data reliability. The paper presents the software architecture of Contemplata, describes its practical use and eventually gives two examples of annotation projects that were conducted on the platform.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
ODIL\_Syntax: a Free Spontaneous Spoken French Treebank Annotated with Constituent Trees
This paper describes ODIL Syntax, a French treebank built on spontaneous speech transcripts. The syntactic structure of every speech turn is represented by constituent trees, through a procedure which combines an automat…
POSA Universal Dependencies Conversion Pipeline for a Penn-format Constituency Treebank
The topic of this paper is a rule-based pipeline for converting constituency treebanks based on the Penn Treebank format to Universal Dependencies (UD). We describe an Icelandic constituency treebank, its annotation sche…
Constituency Structure over Eojeol in Korean Treebanks
The design of Korean constituency treebanks raises a central representational question concerning the choice of terminal units. Although Korean words are morphologically complex, treating morphemes as constituency termin…
Constituency ParsingProjecting Multiword Expression Resources on a Polish Treebank
Multiword expressions (MWEs) are linguistic objects containing two or more words and showing idiosyncratic behavior at different levels. Treebanks with annotated MWEs enable studies of such properties, as well as trainin…
Training a Swedish Constituency Parser on Six Incompatible Treebanks
We investigate a transition-based parser that uses Eukalyptus, a function-tagged constituent treebank for Swedish which includes discontinuous constituents. In addition, we show that the accuracy of this parser can be im…