Abstract
We give a detailed account of an algorithm for efficient tactical generation from underspecified logical-form semantics, using a wide-coverage grammar and a corpus of real-world target utterances. Some earlier claims about chart realization are critically reviewed and corrected in the light of a series of practical experiments. As well as a set of algorithmic refinements, we present two novel techniques: the integration of subsumption-based local ambiguity factoring, and a procedure to selectively unpack the generation forest according to a probability distribution given by a conditional, discriminative model.
Dan Flickinger and Ann Copestake contributed a lot to the work described in this paper. We also thank Berthold Crysmann, Jan Tore Lønning and Bob Moore for useful discussions. Funding is from the projects COGENT (UK EPSRC) and LOGON (Norwegian Research Council).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Flickinger, D.: On building a more efficient grammar by exploiting types. Natural Language Engineering 6(1), 15–28 (2000)
Butt, M., Dyvik, H., King, T.H., Masuichi, H., Rohrer, C.: The Parallel Grammar project. In: Proceedings of the COLING Workshop on Grammar Engineering and Evaluation, Taipei, Taiwan, pp. 1–7 (2002)
White, M.: Reining in CCG chart realization. In: Proceedings of the 3rd International Conference on Natural Language Generation, Hampshire, UK (2004)
Moore, J., Foster, M.E., Lemon, O., White, M.: Generating tailored, comparative descriptions in spoken dialogue. In: Proceedings of the 17th International FLAIRS Conference, Miami Beach, FL (2004)
Oepen, S., Dyvik, H., Lønning, J.T., Velldal, E., Beermann, D., Carroll, J., Flickinger, D., Hellan, L., Johannessen, J.B., Meurer, P., Nordgård, T., Rosén, V.: Som å kapp-ete med trollet? Towards MRS-based Norwegian – English Machine Translation. In: Proceedings of the 10th International Conference on Theoretical and Methodological Issues in Machine Translation, Baltimore, MD (2004)
Whitelock, P.: Shake-and-bake translation. In: Proceedings of the 14th International Conference on Computational Linguistics, Nantes, France, pp. 610–616 (1992)
Phillips, J.: Generation of text from logical formulae. Machine Translation 8, 209–235 (1993)
Kay, M.: Chart generation. In: Proceedings of the 34th Meeting of the Association for Computational Linguistics, Santa Cruz, CA, pp. 200–204 (1996)
Gardent, C., Thater, S.: Generating with a grammar based on tree descriptions. A constraint-based approach. In: Proceedings of the 39th Meeting of the Association for Computational Linguistics, Toulouse, France (2001)
Shieber, S., van Noord, G., Pereira, F., Moore, R.: Semantic head-driven generation. Computational Linguistics 16, 30–43 (1990)
Moore, R.: A complete, efficient sentence-realization algorithm for unification grammar. In: Proceedings of the 2nd International Natural Language Generation Conference, Harriman, NY, pp. 41–48 (2002)
Carroll, J., Copestake, A., Flickinger, D., Poznanski, V.: An efficient chart generator for (semi-)lexicalist grammars. In: Proceedings of the 7th European Workshop on Natural Language Generation, Toulouse, France, pp. 86–95 (1999)
Copestake, A., Flickinger, D., Sag, I., Pollard, C.: Minimal Recursion Semantics. An introduction (1999)
Kiefer, B., Krieger, H.U., Carroll, J., Malouf, R.: A bag of useful techniques for efficient and robust parsing. In: Proceedings of the 37th Meeting of the Association for Computational Linguistics, College Park, MD, pp. 473–480 (1999)
Billot, S., Lang, B.: The structure of shared forests in ambiguous parsing. In: Proceedings of the 27th Meeting of the Association for Computational Linguistics, Vancouver, BC, pp. 143–151 (1989)
Oepen, S., Carroll, J.: Ambiguity packing in constraint-based parsing. Practical results. In: Proceedings of the 1st Conference of the North American Chapter of the ACL, Seattle, WA, pp. 162–169 (2000)
Shieber, S.: Using restriction to extend parsing algorithms for complex feature-based formalisms. In: Proceedings of the 23rd Meeting of the Association for Computational Linguistics, Chicago, IL, pp. 145–152 (1985)
Oepen, S., Carroll, J.: Performance profiling for parser engineering. Natural Language Engineering 6(1), 81–97 (2000)
Velldall, E., Oepen, S., Flickinger, D.: Paraphrasing treebanks for stochastic realization ranking. In: Proceedings of the 3rd Workshop on Treebanks and Linguistic Theories, Tübingen, Germany (2004)
Toutanova, K., Manning, C.: Feature selection for a rich HPSG grammar using decision trees. In: Proceedings of the 6th Conference on Natural Language Learning, Taipei, Taiwan (2002)
Malouf, R., van Noord, G.: Wide coverage parsing with stochastic attribute value grammars. In: Proceedings of the IJCNLP workshop Beyond Shallow Analysis, Hainan, China (2004)
Geman, S., Johnson, M.: Dynamic programming for parsing and estimation of stochastic unification-based grammars. In: Proceedings of the 40th Meeting of the Association for Computational Linguistics, Philadelphia, PA (2002)
Miyao, Y., Tsujii, J.: Maximum entropy estimation for feature forests. In: Proceedings of the Human Language Technology Conference, San Diego, CA (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carroll, J., Oepen, S. (2005). High Efficiency Realization for a Wide-Coverage Unification Grammar. In: Dale, R., Wong, KF., Su, J., Kwong, O.Y. (eds) Natural Language Processing – IJCNLP 2005. IJCNLP 2005. Lecture Notes in Computer Science(), vol 3651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562214_15
Download citation
DOI: https://doi.org/10.1007/11562214_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29172-5
Online ISBN: 978-3-540-31724-1
eBook Packages: Computer ScienceComputer Science (R0)