Buscar
Mostrando ítems 21-30 de 40
Discontinuous grammar as a foreign language
(Elsevier, 2023-03)
[Abstract] In order to achieve deep natural language understanding, syntactic constituent parsing is a vital step, highly demanded by many artificial intelligence systems to process both text and speech. One of the most ...
Multitask Pointer Network for Multi-Representational Parsing
(Elsevier, 2022-01-25)
[Abstract] Dependency and constituent trees are widely used by many artificial intelligence applications for representing the syntactic structure of human languages. Typically, these structures are separately produced by ...
Dependency parsing with bottom-up Hierarchical Pointer Networks
(Elsevier, 2023-03)
[Abstract] Dependency parsing is a crucial step towards deep language understanding and, therefore, widely demanded by numerous Natural Language Processing applications. In particular, left-to-right and top-down transition-based ...
On the Challenges of Fully Incremental Neural Dependency Parsing
(Association for Computational Linguistics, 2023-11)
[Absctract]: Since the popularization of BiLSTMs and
Transformer-based bidirectional encoders,
state-of-the-art syntactic parsers have lacked
incrementality, requiring access to the whole
sentence and deviating from ...
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 ...
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 ...