A Computational Treatment of HPSG Lexical Rules as Covariation in Lexical Entries

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We describe a compiler which translates a set of HPSG lexical rules and their interaction into definite relations used to constrain lexical entries. The compiler ensures automatic transfer of properties unchanged by a lexical rule. Thus an operational semantics for the full lexical rule mechanism as used in HPSG linguistics is provided. Program transformation techniques are used to advance the resulting encoding. The final output constitutes a computational counterpart of the linguistic generalizations captured by lexical rules and allows ``on the fly'' application.
15 pages, uuencoded and compressed postscript to appear in Proceedings of the 5th Int. Workshop on Natural Language Understanding and Logic Programming. Lisbon, Portugal. 1995

Keywords

Computation and Language

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/151142

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cmp-lg/9504004
 http://arxiv.org/abs/cmp-lg/9504004

Collections

arXiv