Authors
Stuart M Shieber, Gertjan van Noord, Robert C Moore, Fernando CN Pereira
Publication date
1989/6
Conference
27th Annual Meeting of the Association for Computational Linguistics
Pages
7-17
Description
We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to which it is applicable. In particular, unlike an Earley deduction generator (Shieber, 1988), it allows use of semantically nonmonotonic grammars, yet unlike topdown methods, it also permits left-recursion. The enabling design feature of the algorithm is its implicit traversal of the analysis tree for the string being generated in a semantic-head-driven fashion.
Total citations
1989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202321812791433332444411131312111111
Scholar articles
SM Shieber, G van Noord, RC Moore, FCN Pereira - 27th Annual Meeting of the Association for …, 1989
FCN Pereira, RC Moore, G van Noord, S Shieber - Proceedings of the 27th Annual Meeting of the …, 1989