27 Briscoe and Copestake ( 1996 ) argue that semi-productivity of lexical rules , which can be understood as a generalization of exceptions to lexical rules , can be integrated with our approach by assigning probabilities to the automaton associated with a particular lexical entry .
controlling the application of lexical rules
Ted Briscoe Ann Copestake
The way these predicates interconnect is represented in Figure 19 . 27 Briscoe and Copestake ( 1996 ) argue that semi-productivity of lexical rules , which can be understood as a generalization of exceptions to lexical rules , can be integrated with our approach by assigning probabilities to the automaton associated with a particular lexical entry . 28 In order to distinguish the different interaction predicates for the different classes of lexical entries , the compiler indexes the names of the interaction predicates .
27 @@CITATION argue that semi-productivity of lexical rules , which can be understood as a generalization of exceptions to lexical rules , can be integrated with our approach by assigning probabilities to the automaton associated with a particular lexical entry .