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

Authors:
W. Detmar Meurers;Guido Minnen
Affiliations:
University of Tübingen;University of Tübingen
Venue:
Computational Linguistics
Year:
1997

Citing 18
Cited 5

Negation and control in Prolog

Negation and control in Prolog
Prolog and natural-language analysis

Prolog and natural-language analysis
Information-based syntax and semantics: Vol. 1: fundamentals

Information-based syntax and semantics: Vol. 1: fundamentals
Readings in nonmonotonic reasoning

Readings in nonmonotonic reasoning
Some philosophical problems from the standpoint of artificial intelligence

Readings in nonmonotonic reasoning
The craft of Prolog

The craft of Prolog
The generative power of categorial grammars and head-driven phrase structure grammars with lexical rules

Computational Linguistics
Off-line optimization for Earley-style HPSG processing

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Interleaving universal principles and relational constraints over typed feature logic

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Structure-sharing in lexical representation

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Compiling HPSG type constraints into definite clause programs

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Comparing two grammar-based generation algorithms: a case study

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Typed unification grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
HPSG lexicon without lexical rules

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
The correct and efficient implementation of appropriateness specifications for typed feature structures

COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Adjuncts and the processing of lexical rules

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

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Applying lexical rules under subsumption

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1

The Complexity of Modellability in Finite and ComputableSignatures of a Constraint Logic for Head-Driven PhraseStructure Grammar

Journal of Logic, Language and Information
Review of "Efficient processing with constraint-logic grammars using grammar compilation" by Guido Minnen, Stanford: CSLI Publications (Stanford monographs in linguistics), 2001

Computational Linguistics
Lexical rules in constraint-based grammars

Computational Linguistics
Selective magic HPSG parsing

EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Incremental identification of inflectional types

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new computational treatment of lexical rules as used in the HPSG framework. A complier is described which translates a set of lexical rules and their interaction into a definite clause encoding, which is called by the base lexical entries in the lexicon. This way, the disjunctive possibilities arising from lexical rule application are encoded as systematic covariation in the specification of lexical entries. The compiler ensures the automatic transfer of properties not changed by a lexical rule. Program transformation techniques are used to advance the encoding. The final output of the compiler constitutes an efficient computational counterpart of the linguistic generalizations captured by lexical rules and allows on-the-fly application of lexical rules.