W. Detmar Meurers and Guido Minnen
In: Computational Linguistics 23 (4), 1997, 543--568.
This paper proposes a new computational treatment of lexical rules as used in the HPSG framework. A compiler 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 as systematic covariation is encoded 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.
Electronically available file formats:
Note: The electronic versions of the publications linked on this page are the last versions I had the copyright for. Where a publisher copyedited and/or typeset the papers, the electronic copies linked here are NOT identical to the officially published version, which should be used for any quotes, references to page numbers, etc.
Bibtex entry:
@Article{Meurers:Minnen:97,
author = "W. Detmar Meurers and Guido Minnen",
title = "A Computational Treatment of Lexical Rules in HPSG
as Covariation in Lexical Entries",
journal = "Computational Linguistics",
year = "1997",
volume = "23",
number = "4",
pages = "543--568",
url = {http://purl.org/dm/papers/meurers-minnen-97.html}
}