Computing phrasal-signs in HPSG prior to parsing
Kentaro Torisawa, Jun’ichi Tsujii · 1996
This paper describes techniques to compile lexical entries in HPSG (Pollard and Sag, 1987; Pollard and Sag, 1993)-style grammar into a set of finite state automata. The states in automata are possible signs derived from lexical entries and contain information raised from the lexical entries. The automata are augmented with feature structures used by a partial unification routine and delayed/frozen definite clause programs.