A Tree Extension for CoNLL-RDF

2020-05-01 · LREC 2020 5 · Christian Chiarcos, Luis Glaser

The technological bridges between knowledge graphs and natural language processing are of utmost importance for the future development of language technology. CoNLL-RDF is a technology that provides such a bridge for popular one-word-per-line formats as widely used in NLP (e.g., the CoNLL Shared Tasks), annotation (Universal Dependencies, Unimorph), corpus linguistics (Corpus WorkBench, CWB) and digital lexicography (SketchEngine): Every empty-line separated table (usually a sentence) is parsed into an graph, can be freely manipulated and enriched using W3C-standardized RDF technology, and then be serialized back into in a TSV format, RDF or other formats. An important limitation is that CoNLL-RDF provides native support for word-level annotations only. This does include dependency syntax and semantic role annotations, but neither phrase structures nor text structure. We describe the extension of the CoNLL-RDF technology stack for two vocabulary extensions of CoNLL-TSV, the PTB bracket notation used in earlier CoNLL Shared Tasks and the extension with XML markup elements featured by CWB and SketchEngine. In order to represent the necessary extensions of the CoNLL vocabulary in an adequate fashion, we employ the POWLA vocabulary for representing and navigating in tree structures.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Knowledge GraphsSentence

Towards Better UD Parsing: Deep Contextualized Word Embeddings, Ensemble, and Treebank Concatenation

2018-07-09 · CONLL 2018 10 · Wanxiang Che, Yijia Liu, Yuxuan Wang, Bo Zheng 외

This paper describes our system (HIT-SCIR) submitted to the CoNLL 2018 shared task on Multilingual Parsing from Raw Text to Universal Dependencies. We base our submission on Stanford's winning system for the CoNLL 2017 s…

Dependency Parsing Word Embeddings

UDeasy: a Tool for Querying Treebanks in CoNLL-U Format

2022-06-01 · CMLC (LREC) 2022 6 · Luca Brigada Villa

Many tools are available to query a dependency treebank, but they require the users to know a query language. In this paper I present UDeasy, an application whose main goal is to allow the users to easily query and extra…

LIMSI@CoNLL'17: UD Shared Task

2017-08-01 · CONLL 2017 8 · Lauriane Aufrant, Guillaume Wisniewski, Fran{\c{c}}ois Yvon

This paper describes LIMSI{'}s submission to the CoNLL 2017 UD Shared Task, which is focused on small treebanks, and how to improve low-resourced parsing only by ad hoc combination of multiple views and resources. We pre…

Model Selection

SyntaxNet Models for the CoNLL 2017 Shared Task

2017-03-15 · Chris Alberti, Daniel Andor, Ivan Bogatyy, Michael Collins 외

We describe a baseline dependency parsing system for the CoNLL2017 Shared Task. This system, which we call "ParseySaurus," uses the DRAGNN framework [Kong et al, 2017] to combine transition-based recurrent parsing and ta…

Dependency Parsing

Adversarial Training for Cross-Domain Universal Dependency Parsing

2017-08-01 · CONLL 2017 8 · Motoki Sato, Hitoshi Manabe, Hiroshi Noji, Yuji Matsumoto

We describe our submission to the CoNLL 2017 shared task, which exploits the shared common knowledge of a language across different domains via a domain adaptation technique. Our approach is an extension to the recently …

Dependency Parsing Domain Adaptation