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 gram-mar transforms, and is exact for leftqinear and right-linear CFGs, and for trees up to a user-specified depth of center-embedding.