University of Sussex
Browse

File(s) not publicly available

Parsing mildly non-projective dependency structures

presentation
posted on 2023-06-07, 21:46 authored by Carlos Gómez-Rodríguez, David WeirDavid Weir, John Carroll
We present parsing algorithms for various mildly non-projective dependency formalisms. In particular, algorithms are presented for: all well-nested structures of gap degree at most 1, with the same complexity as the best existing parsers for constituency formalisms of equivalent generative power; all well-nested structures with gap degree bounded by any constant k; and a new class of structures with gap degree up to k that includes some ill-nested structures. The third case includes all the gap degree k structures in a number of dependency treebanks.

History

Publication status

  • Published

Page range

291-299

Pages

9.0

Presentation Type

  • paper

Event name

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics

Event location

Athens, Greece

Event type

conference

ISBN

9783642155727

Department affiliated with

  • Informatics Publications

Full text available

  • No

Peer reviewed?

  • Yes

Legacy Posted Date

2012-02-06

Usage metrics

    University of Sussex (Publications)

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC