Next: References Up: BUG: A Directed Bottom Previous: Efficiency considerations

Summary

In this paper I have shown that existing algorithms to generate strings from a semantic formula in unification based formalisms do face some problems. I argued that better results are achieved by using BUG, a directed bottom-up algorithm, that proceeds from semantic head to semantic head. Grammars that obey the semantic head requirement <11> can be handled by BUG. I compared the algorithm with Shieber's Earley-based generation algorithm and concluded that BUG is both linguistically more expressive and computationally less expensive.

Gertjan van Noord
Fri Nov 25 13:48:52 MET 1994