Buscar
Mostrando ítems 3321-3330 de 6299
A Unifying Theory of Transition-based and Sequence Labeling Parsing
(International Committee on Computational Linguistics, 2020-12)
[Absctract]: We define a mapping from transition-based parsing algorithms that read sentences from left to right to sequence labeling encodings of syntactic trees. This not only establishes a theoretical relation between ...
Better, Faster, Stronger Sequence Tagging Constituent Parsers
(Association for Computational Linguistics, 2019-06)
[Absctract]: Sequence tagging models for constituent parsing are faster, but less accurate than other types of parsers. In this work, we address the following weaknesses of such constituent parsers: (a) high error rates ...
Sequence Labeling Parsing by Learning across Representations
(Association for Computational Linguistics, 2019-07)
[Absctract]: We use parsing as sequence labeling as a common framework to learn across constituency and dependency syntactic abstractions. To do so, we cast the problem as multitask learning (MTL). First, we show that ...
Harry Potter and the Action Prediction Challenge from Natural Language
(Association for Computational Linguistics, 2019-06)
[Absctract]: We explore the challenge of action prediction from textual descriptions of scenes, a testbed to approximate whether text inference can be used to predict upcoming actions. As a case of study, we consider the ...
HEAD-QA: A Healthcare Dataset for Complex Reasoning
(Association for Computational Linguistics, 2019-07)
[Absctract]: We present HEAD-QA, a multi-choice question answering testbed to encourage research on complex reasoning. The questions come from exams to access a specialized position in the Spanish healthcare system, and ...
A Transition-Based Algorithm for Unrestricted AMR Parsing
(Association for Computational Linguistics, 2018-06)
[Absctract]: Non-projective parsing can be useful to handle cycles and reentrancy in AMR graphs. We explore this idea and introduce a greedy left-to-right non-projective transition-based parser. At each parsing configuration, ...
Towards Making a Dependency Parser See
(Association for Computational Linguistics, 2019-11)
[Absctract]: We explore whether it is possible to leverage eye-tracking data in an RNN dependency parser (for English) when such information is only available during training - i.e. no aggregated or token-level gaze features ...
Artificially Evolved Chunks for Morphosyntactic Analysis
(Association for Computational Linguistics, 2019-08)
[Absctract]: We introduce a language-agnostic evolutionary technique for automatically extracting chunks
from dependency treebanks. We evaluate these chunks on a number of morphosyntactic tasks,
namely POS tagging, ...
Grounding the Semantics of Part-of-Day Nouns Worldwide using Twitter
(Association for Computational Linguistics, 2018-06)
[Absctract]: The usage of part-of-day nouns, such as ‘night’, and their time-specific greetings (‘good night’), varies across languages and cultures. We show the possibilities that Twitter offers for studying the semantics ...
Discontinuous Constituent Parsing as Sequence Labeling
(Association for Computational Linguistics, 2020-11)
[Absctract]: This paper reduces discontinuous parsing to sequence labeling. It first shows that existing reductions for constituent parsing as labeling do not support discontinuities. Second, it fills this gap and proposes ...