Parsing with Traces: An O(n^4) Algorithm and a Structural Representation
Abstract
General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible enough to cover almost all treebank structures, while still admitting efficient learning and inference. In particular, we consider directed, acyclic, one-endpoint-crossing graph structures, which cover most long-distance dislocation, shared argumentation, and similar tree-violating linguistic phenomena. We describe how to convert phrase structure parses, including traces, to our new representation in a reversible manner. Our dynamic program uniquely decomposes structures, is sound and complete, and covers 97.3% of the Penn English Treebank. We also implement a proof-of-concept parser that recovers a range of null elements and trace types.
Full Text:
PDF (presented at EMNLP 2017)Refbacks
- There are currently no refbacks.
Copyright (c) 2017 Association for Computational Linguistics

This work is licensed under a Creative Commons Attribution 4.0 International License.