Stochastic realisation ranking for a free word order language

22Citations
Citations of this article
77Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a log-linear model that is used for ranking the string realisations produced for given corpus f-structures by a reversible broadcoverage LFG for German and compare its results with the ones achieved by the application of a language model (LM). Like other authors that have developed log-linear models for realisation ranking, we use a hybrid model that uses linguistically motivated learning features and a LM (whose score is simply integrated into the log-linear model as an additional feature) for the task of realisation ranking. We carry out a large evaluation of the model, training on over 8,600 structures and testing on 323. We observe that the contribution that the structural features make to the quality of the output is slightly greater in the case of a free word order language like German than it is in the case of English. The exact match metric improves from 27% to 37% when going from the LM-based realisation ranking to the hybrid model, BLEU score improves from 0.7306 to 0.7939.

Cite

CITATION STYLE

APA

Cahill, A., Forst, M., & Rohrer, C. (2007). Stochastic realisation ranking for a free word order language. In Proceedings of the 11th European Workshop on Natural Language Generation, ENLG 07 (pp. 17–24). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1610163.1610168

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free