Finite-state Approximation of Constraint-based Grammars using Left-corner Grammar Transforms

This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left-corner grammar transform. The approximation is presented as a series of grammar transforms, and is exact for left-linear and rightlinear CFGs, and for trees up to a user-specified depth of center-embedding.

• Type: Conference
• Year: 1998
• Where: ACL
• Authors: Mark Johnson
• Keywords: ACL 1998, ACL 2007, Finite-state Machine, Grammar Transforms, Left-corner Grammar Transform