Carlos Gómez-Rodríguez
Biographic Data
| ID | 6537004 |
|---|---|
| NAME | Carlos Gómez-Rodríguez |
| GIVEN NAMES | Carlos |
| FAMILY NAME | Gómez-Rodríguez |
| SIGNATURE | GÓMEZ-RODRÍGUEZ C |
| AFFILIATIONS | Universidade da Coruña |
| VERIFIED | No |
| TOTAL WORKS | 5 |
| TOTAL CITATIONS | 4 |
| WORKS AS AUTHOR | 5 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2011 |
| LATEST PUBLICATION YEAR | 2026 |
| H-INDEX | 2 |
Sequence Labeling for Constituent Parsing
Various encodings have been proposed to cast constituent parsing in terms of a sequence labeling task. However, unlike in the case of dependency parsing, existing comparisons have not been entirely homogeneous and, to the best of our knowledge, there is no systematic evaluation of these encodings under uniform configurations. A homogeneous evaluation needs to account for various aspects that could influence results, either by controlling for thes…
The Impact of Edge Displacement Vaserstein Distance on UD Parsing Performance
We contribute to the discussion on parsing performance in NLP by introducing a measurement that evaluates the differences between the distributions of edge displacement (the directed distance of edges) seen in training and test data. We hypothesize that this measurement will be related to differences observed in parsing performance across treebanks. We motivate this by building upon previous work and then attempt to falsify this hypothesis by usi…
Restricted Non-Projectivity
In the last decade, various restricted classes of non-projective dependency trees have been proposed with the goal of achieving a good tradeoff between parsing efficiency and coverage of the syntactic structures found in natural languages. We perform an extensive study measuring the coverage of a wide range of such classes on corpora of 30 languages under two different syntactic annotation criteria. The results show that, among the currently know…
Divisible Transition Systems and Multiplanar Dependency Parsing
Transition-based parsing is a widely used approach for dependency parsing that combines high efficiency with expressive feature models. Many different transition systems have been proposed, often formalized in slightly different frameworks. In this article, we show that a large number of the known systems for projective dependency parsing can be viewed as variants of the same stack-based system with a small set of elementary transitions that can …
Dependency Parsing Schemata and Mildly Non-Projective Dependency Parsing
We introduce dependency parsing schemata, a formal framework based on Sikkel's parsing schemata for constituency parsers, which can be used to describe, analyze, and compare dependency parsing algorithms. We use this framework to describe several well-known projective and non-projective dependency parsers, build correctness proofs, and establish formal relationships between them. We then use the framework to define new polynomial-time parsing alg…
Divisible Transition Systems and Multiplanar Dependency Parsing
Transition-based parsing is a widely used approach for dependency parsing that combines high efficiency with expressive feature models. Many different transition systems have been proposed, often formalized in slightly different frameworks. In this article, we show that a large number of the known systems for projective dependency parsing can be viewed as variants of the same stack-based system with a small set of elementary transitions that can …
Dependency Parsing Schemata and Mildly Non-Projective Dependency Parsing
We introduce dependency parsing schemata, a formal framework based on Sikkel's parsing schemata for constituency parsers, which can be used to describe, analyze, and compare dependency parsing algorithms. We use this framework to describe several well-known projective and non-projective dependency parsers, build correctness proofs, and establish formal relationships between them. We then use the framework to define new polynomial-time parsing alg…
Dependency Parsing Schemata and Mildly Non-Projective Dependency Parsing
We introduce dependency parsing schemata, a formal framework based on Sikkel's parsing schemata for constituency parsers, which can be used to describe, analyze, and compare dependency parsing algorithms. We use this framework to describe several well-known projective and non-projective dependency parsers, build correctness proofs, and establish formal relationships between them. We then use the framework to define new polynomial-time parsing alg…
Divisible Transition Systems and Multiplanar Dependency Parsing
Transition-based parsing is a widely used approach for dependency parsing that combines high efficiency with expressive feature models. Many different transition systems have been proposed, often formalized in slightly different frameworks. In this article, we show that a large number of the known systems for projective dependency parsing can be viewed as variants of the same stack-based system with a small set of elementary transitions that can …
Restricted Non-Projectivity
In the last decade, various restricted classes of non-projective dependency trees have been proposed with the goal of achieving a good tradeoff between parsing efficiency and coverage of the syntactic structures found in natural languages. We perform an extensive study measuring the coverage of a wide range of such classes on corpora of 30 languages under two different syntactic annotation criteria. The results show that, among the currently know…
The Impact of Edge Displacement Vaserstein Distance on UD Parsing Performance
We contribute to the discussion on parsing performance in NLP by introducing a measurement that evaluates the differences between the distributions of edge displacement (the directed distance of edges) seen in training and test data. We hypothesize that this measurement will be related to differences observed in parsing performance across treebanks. We motivate this by building upon previous work and then attempt to falsify this hypothesis by usi…
Sequence Labeling for Constituent Parsing
Various encodings have been proposed to cast constituent parsing in terms of a sequence labeling task. However, unlike in the case of dependency parsing, existing comparisons have not been entirely homogeneous and, to the best of our knowledge, there is no systematic evaluation of these encodings under uniform configurations. A homogeneous evaluation needs to account for various aspects that could influence results, either by controlling for thes…
Natural Language Processing Techniques (5 works) · Parsing (5 works) · Artificial Intelligence (4 works) · Computer Science (4 works) · Dependency (UML (4 works) · Natural language processing (4 works) · Topic Modeling (4 works) · Dependency grammar (3 works) · Bottom-up parsing (2 works) · Programming language (2 works)