Search Results for author:
Found 12 papers, 6 papers with code
Applying Occam’s Razor to Transformer-Based Dependency Parsing: What Works, What Doesn’t, and What is Really Necessary
We find that the choice of pre-trained embeddings has by far the greatest impact on parser performance and identify XLM-R as a robust choice across the languages in our study.
Unifying the Treatment of Preposition-Determiner Contractions in German Universal Dependencies Treebanks
HDT-UD, the largest German UD treebank by a large margin, as well as the German-LIT treebank, currently do not analyze preposition-determiner contractions such as zum (= zu dem, “to the”) as multi-word tokens, which is inconsistent both with UD guidelines as well as other German UD corpora (GSD and PUD).
RobertNLP at the IWPT 2021 Shared Task: Simple Enhanced UD Parsing for 17 Languages
This paper presents our multilingual dependency parsing system as used in the IWPT 2021 Shared Task on Parsing into Enhanced Universal Dependencies.
A Corpus Study of Creating Rule-Based Enhanced Universal Dependencies for German
In this paper, we present a first attempt at enriching German Universal Dependencies (UD) treebanks with enhanced dependencies.
MuLMS: A Multi-Layer Annotated Text Corpus for Information Extraction in the Materials Science Domain
Keeping track of all relevant recent publications and experimental results for a research area is a challenging task.
MuLMS-AZ: An Argumentative Zoning Dataset for the Materials Science Domain
We present and release a new dataset of 50 manually annotated research articles.
MIST: a Large-Scale Annotated Resource and Neural Models for Functions of Modal Verbs in English Scientific Text
Modal verbs (e. g., "can", "should", or "must") occur highly frequently in scientific articles.
Negation-Instance Based Evaluation of End-to-End Negation Resolution
In this paper, we revisit the task of negation resolution, which includes the subtasks of cue detection (e. g. "not", "never") and scope resolution.
Maximum Spanning Trees Are Invariant to Temperature Scaling in Graph-based Dependency Parsing
Modern graph-based syntactic dependency parsers operate by predicting, for each token within a sentence, a probability distribution over its possible syntactic heads (i. e., all other tokens) and then extracting a maximum spanning tree from the resulting log-probabilities.
Coordinate Constructions in English Enhanced Universal Dependencies: Analysis and Computational Modeling
In this paper, we address the representation of coordinate constructions in Enhanced Universal Dependencies (UD), where relevant dependency links are propagated from conjunction heads to other conjuncts.
Applying Occam's Razor to Transformer-Based Dependency Parsing: What Works, What Doesn't, and What is Really Necessary
We find that the choice of pre-trained embeddings has by far the greatest impact on parser performance and identify XLM-R as a robust choice across the languages in our study.
Generalized chart constraints for efficient PCFG and TAG parsing
Chart constraints, which specify at which string positions a constituent may begin or end, have been shown to speed up chart parsers for PCFGs.
