A Systematic Comparison of Syntactic Representations of Dependency Parsing
By: Guillaume Wisniewski, Ophélie Lacroix
Potential Business Impact:
Makes computer language understanding better for some languages.
We compare the performance of a transition-based parser in regards to different annotation schemes. We pro-pose to convert some specific syntactic constructions observed in the universal dependency treebanks into a so-called more standard representation and to evaluate parsing performances over all the languages of the project. We show that the ``standard'' constructions do not lead systematically to better parsing performance and that the scores vary considerably according to the languages.
Similar Papers
Step-by-step Instructions and a Simple Tabular Output Format Improve the Dependency Parsing Accuracy of LLMs
Computation and Language
Helps computers understand sentences perfectly.
Construction Identification and Disambiguation Using BERT: A Case Study of NPN
Computation and Language
Computer understands tricky word patterns like "day to day."
Annotating and Inferring Compositional Structures in Numeral Systems Across Languages
Computation and Language
Helps computers understand number words in any language.