UDeasy: a Tool for Querying Treebanks in CoNLL-U Format
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 extract patterns from a dependency treebank in CoNLL-U format.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
UDPipe: Trainable Pipeline for Processing CoNLL-U Files Performing Tokenization, Morphological Analysis, POS Tagging and Parsing
Automatic natural language processing of large texts often presents recurring challenges in multiple languages: even for most advanced tasks, the texts are first processed by basic processing steps {--} from tokenization…
Dependency ParsingLemmatizationMorphological AnalysisPart-Of-Speech Tagging+2LIMSI@CoNLL'17: UD Shared Task
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 SelectionUDon2: a library for manipulating Universal Dependencies trees
UDon2 is an open-source library for manipulating dependency trees represented in the CoNLL-U format. The library is compatible with the Universal Dependencies. UDon2 is aimed at developers of downstream Natural Language …
SentenceSyntaxNet Models for the CoNLL 2017 Shared Task
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 ParsingUParse: the Edinburgh system for the CoNLL 2017 UD shared task
This paper presents our submissions for the CoNLL 2017 UD Shared Task. Our parser, called UParse, is based on a neural network graph-based dependency parser. The parser uses features from a bidirectional LSTM to to produ…
Dependency ParsingMachine TranslationQuestion AnsweringSentence+1