Gertjan van Noord
Trans 10 Utrecht
It is assumed that bidirectional grammars written in some unification- or logic-based formalism define relations between strings and some representation, usually called logical form. The task for a generator is to generate for a given logical form the strings that are related to this logical form by the grammar.
In the paper it will be shown that the `early' approaches to this conceivement of the generation problem such as ,  and  are not entirely satisfactory for general purposes. Furthermore I will define a simple bottom-up generator, called BUG1 for reference, as prototypical for the head-driven bottom-up approach as defended by for example . I will argue that head-driven bottom-up generation is to be preferred because the order of processing is directed by the input logical form and the information available in lexical entries; moreover the algorithm puts fewer restrictions on grammars than some other generators.