All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Are formal restrictions on crossing dependencies epiphenominal?

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10427090" target="_blank" >RIV/00216208:11320/19:10427090 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.aclweb.org/anthology/W19-7802" target="_blank" >https://www.aclweb.org/anthology/W19-7802</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Are formal restrictions on crossing dependencies epiphenominal?

  • Original language description

    Characterizing the distribution of crossing dependencies in natural language dependency trees isa crucial task for building parsers and understanding the formal properties of human language. Anumber of formal restrictions on crossing dependencies have been proposed, including bounds ongap degree, edge degree, and end-point crossings. Here we ask whether the empirical distributionof crossing dependencies in dependency treebanks offers evidence for these formal restrictions astrue, independent constraints on dependency trees, or whether the distribution can be explainedusing other, more generic constraints affecting dependency trees. Specifically, we explore thenull hypothesis that crossing dependencies are formally unrestricted, but occur at a low rate.We implement the null hypothesis using random trees where crossing dependencies occur at thesame rate as in natural language trees, but without any formal restrictions. We find that thisbaseline generally does not reproduce the same distribution of gap degree, edge degree, endpoint-crossing, and heads’ depth difference as real trees, suggesting that these formal constraintsare a consequence of factors beyond the rate of crossing dependencies alone.

  • Czech name

  • Czech description

Classification

  • Type

    O - Miscellaneous

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

Others

  • Publication year

    2019

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů