Computing phrasal-signs in HPSG prior to parsing

DOI Open Access

Description

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.

Journal

Details 詳細情報について

Report a problem

Back to top