Parallel parsing for unification grammars
Andrew R. Haas · International Joint Conference on Artificial Intelligence · 1987
The parsing problem for arbitrary unification grammars is unsolvable We present a class of unification grammars for whcih the parsing problem is solvable and a parallel parsing algorithm for this class of grammars.