The computational treatment of lexical rules proposed can be seen as an extension to the principled method discussed by Gotz and Meurers ( 1995 , 1996 , 1997b ) for encoding the main building block of HPSG grammars -- the implicative constraints -- as a logic program .
towards a semantics for lexical rules as used in hpsg
Detmar Meurers
The resulting encoding allows the execution of lexical rules on-the-fly , i.e. , coroutined with other constraints at some time after lexical lookup . The computational treatment of lexical rules proposed can be seen as an extension to the principled method discussed by Gotz and Meurers ( 1995 , 1996 , 1997b ) for encoding the main building block of HPSG grammars -- the implicative constraints -- as a logic program . The structure of the paper is as follows : We start with a brief introduction of the formal background on which our approach is based in Section 2 .
The computational treatment of lexical rules proposed can be seen as an extension to the principled method discussed by Gotz and @@CITATION , 1996 , 1997b ) for encoding the main building block of HPSG grammars -- the implicative constraints -- as a logic program .