Compiling HPSG type constraints into definite clause programs

Authors:
Thilo Götz;Walt Detmar Meurers
Affiliations:
Universität Tübingen, Tübingen, Germany;Universität Tübingen, Tübingen, Germany
Venue:
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Year:
1995

Citing 2
Cited 4

The logic of typed feature structures

The logic of typed feature structures
Typed unification grammars

COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3

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

Computational Linguistics
On building a more efficient grammar by exploiting types

Natural Language Engineering
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
IDL-expressions: a formalism for representing and parsing finite languages in natural language processing

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new approach to HPSG processing: compiling HPSG grammars expressed as type constraints into definite clause programs. This provides a clear and computationally useful correspondence between linguistic theories and their implementation. The compiler performs offline constraint inheritance and code optimization. As a result, we are able to efficiently process with HPSG grammars without having to hand-translate them into definite clause or phrase structure based systems.