A grammar formalism and parser for linearization-based HPSG

Authors:
Michael W. Daniels;W. Detmar Meurers
Affiliations:
The Ohio State University, Columbus, OH;The Ohio State University, Columbus, OH
Venue:
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Year:
2004

Citing 5
Cited 1

An efficient context-free parsing algorithm

Communications of the ACM
Parsing with discontinuous phrases

Natural Language Engineering
Parsing with discontinuous constituents

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Head corner parsing for discontinuous constituency

ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Extraposition via complex domain formation

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics

Parsing generalized ID/LP grammars

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linearization-based HPSG theories are widely used for analyzing languages with relatively free constituent order. This paper introduces the Generalized ID/LP (GIDLP) grammar format, which supports a direct encoding of such theories, and discusses key aspects of a parser that makes use of the dominance, precedence, and linearization domain information explicitly encoded in this grammar format. We show that GIDLP grammars avoid the explosion in the number of rules required under a traditional phrase structure analysis of free constituent order. As a result, GIDLP grammars support more modular and compact grammar encodings and require fewer edges in parsing.