This paper presents a minimal enumerative approach to the problem of compiling typed unification grammars into CFG language models, a prototype implementation and results of experiments in which it was used to compile some non-trivial unification grammars. We argue that enumerative methods are considerably more useful than has been previously believed. Also, the simplicity of enumerative methods makes them a natural baseline against which to compare alternative approaches.
Cite as: Rayner, M., Dowding, J., Hockey, B.A. (2001) A baseline method for compiling typed unification grammars into context free language models. Proc. 7th European Conference on Speech Communication and Technology (Eurospeech 2001), 729-732, doi: 10.21437/Eurospeech.2001-219
@inproceedings{rayner01_eurospeech,
author={Manny Rayner and John Dowding and Beth Ann Hockey},
title={{A baseline method for compiling typed unification grammars into context free language models}},
year=2001,
booktitle={Proc. 7th European Conference on Speech Communication and Technology (Eurospeech 2001)},
pages={729--732},
doi={10.21437/Eurospeech.2001-219}
}