An Efficient Algorithm for Surface Generation
<|reference_start|>An Efficient Algorithm for Surface Generation: 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.<|reference_end|>
@article{samuelsson1995an,
    title={An Efficient Algorithm for Surface Generation},
    author={Christer Samuelsson (University of the Saarland)},
    journal={IJCAI 95},
    year={1995},
    number={CLAUS 44 Technical Report},
    archivePrefix={arXiv},
    eprint={cmp-lg/9507007},
    primaryClass={cmp-lg cs.CL}
}