Topological parsing

Authors:
Gerald Penn;Mohammad Haji-Abdolhosseini
Affiliations:
University of Toronto;University of Toronto
Venue:
EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Year:
2003

Citing 5
Cited 2

Head-driven statistical models for natural language parsing

Head-driven statistical models for natural language parsing
Deterministic consistency checking of LP constraints

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Parsing with discontinuous constituents

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Synchronous tree-adjoining grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
The proper treatment of word order in HPSG

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1

Control strategies for parsing with freer word-order languages

CSLP '06 Proceedings of the Third Workshop on Constraints and Language Processing
The other syntax: approaching natural language semantics through logical form composition

CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these grammars contain two primitive notions of constituency that are used to preserve the semantic or interpretational aspects of phrase structure, while at the same time providing a more efficient backbone for parsing based on word-order and contiguity constraints. A simple parsing algorithm is presented, and compilation of grammars into Constraint Handling Rules is also discussed.