For example , the interaction of lexical rules is explored at run-time , even though the possible interaction can be determined at compile-time given the information available in the lexical rules and the base lexical entries .2 Based on the research results reported in Meurers and Minnen ( 1995 , 1996 ) , we propose a new computational treatment of lexical rules that overcomes these shortcomings and results in a more efficient processing of lexical rules as used in HPSG .
a computational treatment of hpsg lexical rules as covariation in lexical entries
Detmar Meurers Guido Minnen
In addition , computationally treating lexical rules on a par with phrase structure rules fails to take computational advantage of their specific properties . For example , the interaction of lexical rules is explored at run-time , even though the possible interaction can be determined at compile-time given the information available in the lexical rules and the base lexical entries .2 Based on the research results reported in Meurers and Minnen ( 1995 , 1996 ) , we propose a new computational treatment of lexical rules that overcomes these shortcomings and results in a more efficient processing of lexical rules as used in HPSG . We developed a compiler that takes as its input a set of lexical rules , deduces the necessary transfer of properties not changed by the individual lexical rules , and encodes the set of lexical rules and their interaction into definite relations constraining lexical entries .
For example , the interaction of lexical rules is explored at run-time , even though the possible interaction can be determined at compile-time given the information available in the lexical rules and the base lexical entries .2 Based on the research results reported in @@CITATION , 1996 ) , we propose a new computational treatment of lexical rules that overcomes these shortcomings and results in a more efficient processing of lexical rules as used in HPSG .