An Efficient Algorithm for Surface Generation
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Natural Language. Pages 1414-1418.
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-headdriven 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.
@inproceedings{ijcai1995p182,
title = {An Efficient Algorithm for Surface Generation},
author = {Samuelsson, Christer},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {1414--1418},
year = {1995},
note = {Natural Language},
url = {https://ijcai.org/proceedings/1995/182},
}
TY - CPAPER TI - An Efficient Algorithm for Surface Generation AU - Samuelsson, Christer T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1414 EP - 1418 UR - https://ijcai.org/proceedings/1995/182 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
