A semantic-head-driven generation algorithm for unification-based formalisms

DSpace/Manakin Repository

A semantic-head-driven generation algorithm for unification-based formalisms

Citable link to this page

 

 
Title: A semantic-head-driven generation algorithm for unification-based formalisms
Author: Pereira, Fernando C. N.; Moore, Robert C.; van Noord, Gertjan; Shieber, Stuart ORCID  0000-0002-7733-8195

Note: Order does not necessarily reflect citation order of authors.

Citation: Stuart M. Shieber, Gertjan van Noord, Robert Moore, and Fernando C. N. Pereira. A semantic-head-driven generation algorithm for unification-based formalisms. In Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics, pages 7-17, 1989.
Full Text & Related Files:
Abstract: 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.
Published Version: http://dx.doi.org/10.3115/981623.981625
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:2050572
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)

 
 

Search DASH


Advanced Search
 
 

Submitters