A common computational treatment of lexical rules adopted , for example , in the ALE system ( Carpenter and Penn 1994 ) consists of computing the transitive closure of the base lexical entries under lexical rule application at compile-time .
ale—the attribute logic engine users guide version 201
Bob Carpenter Gerald Penn
A common computational treatment of lexical rules adopted , for example , in the ALE system ( Carpenter and Penn 1994 ) consists of computing the transitive closure of the base lexical entries under lexical rule application at compile-time . While this provides a front-end to include lexical rules in the grammars , it has the disadvantage that the generalizations captured by lexical rules are not used for computation .
A common computational treatment of lexical rules adopted , for example , in the ALE system ( @@CITATION ) consists of computing the transitive closure of the base lexical entries under lexical rule application at compile-time .