Is It That Difficult to Find a Good Preference Order for the Incremental Algorithm?
Version of Record online: 1 JUN 2012
Copyright © 2012 Cognitive Science Society, Inc.
Volume 36, Issue 5, pages 837–841, July 2012
How to Cite
Krahmer, E., Koolen, R. and Theune, M. (2012), Is It That Difficult to Find a Good Preference Order for the Incremental Algorithm?. Cognitive Science, 36: 837–841. doi: 10.1111/j.1551-6709.2012.01258.x
- Issue online: 3 JUL 2012
- Version of Record online: 1 JUN 2012
- Received 1 November 2011; received in revised form 13 February 2012; accepted 15 February 2012
- 1995). Computational interpretations of the Gricean maxims in the generation of referring expressions. Cognitive Science, 19, 233–263. , & (
- 2012). Generation of referring expressions: Assessing the incremental algorithm. Cognitive Science, doi: 10.1111/j.1551-6709.2011.01205.x , , , & (