An Efficient Algorithm for Surface Generation
Abstract
A method is given that "inverts" a logic grammar and displays it from the point of view of the logical form, rather than from that of the word string LR-compiling techniques are used to allow a recursive-descent generation algorithm to perform "functor merging" much in the same way as an LR parser performs prefix merging. This is an improvement on the semantic-head-driven generator that results in a much smaller search space. The amount of semantic lookahead can be varied, and appropriate tradeoff points between table size and resulting nondeterminism can be found automatically.
Cite
Text
Samuelsson. "An Efficient Algorithm for Surface Generation." International Joint Conference on Artificial Intelligence, 1995.Markdown
[Samuelsson. "An Efficient Algorithm for Surface Generation." International Joint Conference on Artificial Intelligence, 1995.](https://mlanthology.org/ijcai/1995/samuelsson1995ijcai-efficient/)BibTeX
@inproceedings{samuelsson1995ijcai-efficient,
title = {{An Efficient Algorithm for Surface Generation}},
author = {Samuelsson, Christer},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1995},
pages = {1414-1419},
url = {https://mlanthology.org/ijcai/1995/samuelsson1995ijcai-efficient/}
}