Applying lexical rules under subsumption

Authors:
Erhard W. Hinrichs;Tsuneko Nakazawa
Affiliations:
University of Tübingen, Tübingen, Germany;NTT Laboratories, Yokosuka, Japan
Venue:
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Year:
1996

Citing 7
Cited 1

Information-based syntax and semantics: Vol. 1: fundamentals

Information-based syntax and semantics: Vol. 1: fundamentals
The logic of typed feature structures

The logic of typed feature structures
The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules

Computational Linguistics
Object clitics and clitic climbing in Italian HPSG grammar

EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
A logical semantics for feature structures

ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Features and agreement

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Adjuncts and the processing of lexical rules

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1

A computational treatment of lexical rules in HPSG as covariation in lexical entries

Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lexical rules are used in constraint based grammar formalisms such as Head-Driven Phrase Structure Grammar (HPSG) (Pollard and Sag 1994) to express generalizations among lexical entries. This paper discusses a number of lexical rules from recent HPSG analyses of German (Hinrichs and Nakazawa 1994) and shows that the grammar in some cases vastly overgenerates and in other cases introduces massive spurious structural ambiguity, if lexical rules apply under unification. Such problems of overgeneration or spurious ambiguity do not arise, if a lexical rule applies to a given lexical entry iff the lexical entry is subsumed by the left-hand side of the lexical rule. Finally, the paper discusses computational consequences of applying lexical rules under subsumption.