A Systematic Comparison of Syntactic Representations of Dependency Parsing
Wisniewski, Guillaume, Lacroix, Ophélie
–arXiv.org Artificial Intelligence
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.
arXiv.org Artificial Intelligence
Mar-10-2025
- Country:
- Asia > India
- Maharashtra > Mumbai (0.04)
- Europe
- Bulgaria > Sofia City Province
- Sofia (0.04)
- Czechia > Prague (0.05)
- Denmark > Capital Region
- Copenhagen (0.05)
- France > Grand Est
- Meurthe-et-Moselle > Nancy (0.04)
- Spain > Valencian Community
- Valencia Province > Valencia (0.04)
- Sweden > Uppsala County
- Uppsala (0.05)
- United Kingdom > England
- Cambridgeshire > Cambridge (0.04)
- Bulgaria > Sofia City Province
- North America > United States
- California > San Diego County
- San Diego (0.04)
- New York (0.04)
- Oregon > Multnomah County
- Portland (0.04)
- California > San Diego County
- Oceania > Australia
- New South Wales > Sydney (0.04)
- Asia > India
- Genre:
- Research Report (0.40)
- Technology: