{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:19:54Z","timestamp":1740158394847,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,20]],"date-time":"2015-10-20T00:00:00Z","timestamp":1445299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft (DE)","doi-asserted-by":"publisher","award":["EXC 284"],"award-info":[{"award-number":["EXC 284"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft (DE)","doi-asserted-by":"publisher","award":["SFB 1102"],"award-info":[{"award-number":["SFB 1102"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme (BE)","doi-asserted-by":"publisher","award":["295261"],"award-info":[{"award-number":["295261"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["K\u00fcnstl Intell"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s13218-015-0409-5","type":"journal-article","created":{"date-parts":[[2015,10,20]],"date-time":"2015-10-20T14:19:02Z","timestamp":1445350742000},"page":"63-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Search Challenges in Natural Language Generation with Complex Optimization Objectives"],"prefix":"10.1007","volume":"30","author":[{"given":"Vera","family":"Demberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David M.","family":"Howcroft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dietrich","family":"Klakow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1lvaro","family":"Torralba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,20]]},"reference":[{"key":"409_CR1","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-540-89287-8_11","volume":"1","author":"B Bonet","year":"2008","unstructured":"Bonet B, Haslum P, Hickmott SL, Thi\u00e9baux S (2008) Directed unfolding of petri nets. Trans Petri Nets Mod Concurr 1:172\u2013198","journal-title":"Trans Petri Nets Mod Concurr"},{"key":"409_CR2","doi-asserted-by":"crossref","unstructured":"Cahill A, van Genabith J. Robust pcfg-based generation using automatically acquired LFG approximations. In: Calzolari et\u00a0al. [3]","DOI":"10.3115\/1220175.1220305"},{"key":"409_CR3","unstructured":"Calzolari N, Cardie C, Isabelle P (eds.) (2006) Proceedings of the 21st International Conference on Computational Linguistics (ACL\u201906). ACL"},{"key":"409_CR4","doi-asserted-by":"crossref","unstructured":"Carroll JA, Oepen S (2005) High efficiency realization for a wide-coverage unification grammar. In: Natural language processing\u2013IJCNLP, pp 165\u2013176","DOI":"10.1007\/11562214_15"},{"key":"409_CR5","doi-asserted-by":"crossref","unstructured":"Crocker MW, Demberg V, Teich E (2015) Information density and linguistic encoding (ideal). KI - K\u00fcnstliche intelligenz. doi: 10.1007\/s13218-015-0391-y","DOI":"10.1007\/s13218-015-0391-y"},{"issue":"3","key":"409_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.trf.2005.01.003","volume":"8","author":"D Crundall","year":"2005","unstructured":"Crundall D, Bains M, Chapman P, Underwood G (2005) Regulating conversation during driving: a problem for mobile telephones? Transp Res Part F Traffic Psychol Behav 8(3):197\u2013211","journal-title":"Transp Res Part F Traffic Psychol Behav"},{"issue":"2","key":"409_CR7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.cognition.2008.07.008","volume":"109","author":"V Demberg","year":"2008","unstructured":"Demberg V, Keller F (2008) Data from eye-tracking corpora as evidence for theories of syntactic processing complexity. Cognition 109(2):193\u2013210","journal-title":"Cognition"},{"issue":"4","key":"409_CR8","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1162\/COLI_a_00160","volume":"39","author":"V Demberg","year":"2013","unstructured":"Demberg V, Keller F, Koller A (2013) Incremental, predictive parsing with psycholinguistically motivated tree-adjoining grammar. Comput Linguist 39(4):1025\u20131066","journal-title":"Comput Linguist"},{"key":"409_CR9","unstructured":"Demberg V, Sayeed A (2011) Linguistic cognitive load: implications for automotive uis. In: Adjunct proceedings of the 3rd international conference on automotive user interfaces and interactive vehicular applications (AutomotiveUI 2011)"},{"key":"409_CR10","unstructured":"Dethlefs N, Hastie H, Rieser V, Lemon O (2012) Optimising incremental dialogue decisions using information density for interactive systems. In: EMNLP-CoNLL\u201912 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning. Association for Computational Linguistics, Stroudsburg, pp 82\u201393"},{"issue":"4","key":"409_CR11","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1037\/a0013119","volume":"14","author":"FA Drews","year":"2008","unstructured":"Drews FA, Pasupathi M, Strayer DL (2008) Passenger and cell phone conversations in simulated driving. J Exp Psychol Appl 14(4):392\u2013400","journal-title":"J Exp Psychol Appl"},{"key":"409_CR12","unstructured":"Edelkamp S (2001) Planning with pattern databases. In: Cesta A, Borrajo D (eds) Proceedings of the 6th European conference on planning (ECP\u201901), pp 13\u201324, Springer, Verlag"},{"key":"409_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.bandl.2014.10.006","volume":"140","author":"SL Frank","year":"2015","unstructured":"Frank SL, Otten LJ, Galli G, Vigliocco G (2015) The erp response to the amount of information conveyed by words in sentences. Brain Lang 140:1\u201311","journal-title":"Brain Lang"},{"issue":"1","key":"409_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0010-0277(98)00034-1","volume":"68","author":"E Gibson","year":"1998","unstructured":"Gibson E (1998) Linguistic complexity: locality of syntactic dependencies. Cognition 68(1):1\u201376","journal-title":"Cognition"},{"key":"409_CR15","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1111\/j.1551-6709.2009.01073.x","volume":"34","author":"D Gildea","year":"2010","unstructured":"Gildea D, Temperley D (2010) Do grammars minimize dependency length? Cognit Sci 34:286\u2013310","journal-title":"Cognit Sci"},{"key":"409_CR16","doi-asserted-by":"crossref","unstructured":"Hale J (2001) A probabilistic earley parser as a psycholinguistic model. In: Proceedings of NAACL. NAACL, Carnegie Mellon University, Pittsburgh, pp 159\u2013166","DOI":"10.3115\/1073336.1073357"},{"key":"409_CR17","unstructured":"Haslum P, Geffner H (2000) Admissible heuristics for optimal planning. In: Chien S, Kambhampati R, Knoblock C (eds)Proceedings of the 5th international conference on artificial intelligence planning systems (AIPS-00), AAAI Press, Menlo Park, Breckenridge CO, pp 140\u2013149"},{"issue":"3","key":"409_CR18","doi-asserted-by":"crossref","first-page":"16:1","DOI":"10.1145\/2559951","volume":"61","author":"M Helmert","year":"2014","unstructured":"Helmert M, Haslum P, Hoffmann J, Nissim R (2014) Merge and shrink abstraction: a method for generating lower bounds in factored state spaces. J Assoc Comput Mach 61(3):16:1\u201316:63. doi: 10.1145\/2559951","journal-title":"J Assoc Comput Mach"},{"key":"409_CR19","unstructured":"Hoffmann J, Kissmann P, Torralba \u00c1 (2014) \u201cDistance\u201d? Who cares? Tailoring merge-and-shrink heuristics to detect unsolvability. In: Schaub T (ed) Proceedings of the 21st European conference on artificial intelligence (ECAI\u201914). IOS Press, Prague, Czech Republic"},{"key":"409_CR20","unstructured":"Jaeger TF (2006) Redundancy and syntactic reduction in spontaneous speech. Unpublished dissertation, Stanford University"},{"issue":"1","key":"409_CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.cogpsych.2010.02.002","volume":"61","author":"TF Jaeger","year":"2010","unstructured":"Jaeger TF (2010) Redundancy and reduction: speakers manage syntactic information density. Cogn Psychol 61(1):23\u201362","journal-title":"Cogn Psychol"},{"key":"409_CR22","doi-asserted-by":"crossref","unstructured":"Kay M (1996) Chart generation. In: Joshi AK, Palmer M (eds.) Proceedings of the 34th annual meeting of the association for computational linguistics, pp 200\u2013204. Morgan Kaufmann\/ACL","DOI":"10.3115\/981863.981890"},{"key":"409_CR23","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0010-0285(73)90036-4","volume":"5","author":"J Keenan","year":"1973","unstructured":"Keenan J, Kintsch W (1973) Reading rate and of propositions retention as a function of the number in the base structure of sentences. Cogn Psychol 5:257\u2013274","journal-title":"Cogn Psychol"},{"key":"409_CR24","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1613\/jair.4277","volume":"50","author":"E Keyder","year":"2014","unstructured":"Keyder E, Hoffmann J, Haslum P (2014) Improving delete relaxation heuristics through explicitly represented conjunctions. J Artif Intell Res 50:487\u2013533","journal-title":"J Artif Intell Res"},{"key":"409_CR25","unstructured":"Kuhn L, Price B, de\u00a0Kleer J, Do M, Zhou R (2008) Heuristic search for target-value path problem. In: Proceedings of the 1st international symposium on search techniques in artificial intelligence and robotics"},{"issue":"3","key":"409_CR26","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1016\/j.cognition.2007.05.006","volume":"106","author":"R Levy","year":"2008","unstructured":"Levy R (2008) Expectation-based syntactic comprehension. Cognition 106(3):1126\u20131177","journal-title":"Cognition"},{"key":"409_CR27","doi-asserted-by":"crossref","unstructured":"Levy R, Jaeger TF (2007) Speakers optimize information density through syntactic reduction. In: Sch\u00f6lkopf B, Platt JC, Hoffman T (eds) Advances in neural information processing systems 19, Proceedings of the twentieth annual conference on neural information processing systems. MIT Press, Cambridge, pp 849\u2013856. http:\/\/papers.nips.cc\/paper\/3129-speakers-optimizeinformation-density-through-syntactic-reduction","DOI":"10.7551\/mitpress\/7503.003.0111"},{"key":"409_CR28","unstructured":"Linares LC, Stern R, Felner A (2014) Solving the target-value search problem. In: Edelkamp S, Bartak R (eds) Proceedings of the 7th annual symposium on combinatorial search (SOCS\u201914). AAAI Press"},{"key":"409_CR29","doi-asserted-by":"crossref","unstructured":"McMillan KL (1993) Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In: von Bochmann G, Probst DK (eds) Proceedings of the 4th international workshop on computer aided verification (CAV\u201993), Lecture Notes in Computer Science, pp 164\u2013177, Springer","DOI":"10.1007\/3-540-56496-9_14"},{"key":"409_CR30","doi-asserted-by":"crossref","unstructured":"Nakatsu C, White M Learning to say it well: reranking realizations by predicted synthesis quality. In: Calzolari et\u00a0al. [3]","DOI":"10.3115\/1220175.1220315"},{"key":"409_CR31","unstructured":"Rajkumar R, White M (2010) Designing agreement features for realization ranking. In: Proceedings of the 23rd international conference on computational linguistics: posters, pp 1032\u20131040"},{"key":"409_CR32","unstructured":"Rajkumar R, White M (2011) Linguistically motivated complementizer choice in surface realization. In: Proceedings of the UCNLG+Eval: language generation and evaluation workshop. Association for Computational Linguistics, Edinburgh, pp 39\u201344. http:\/\/www.aclweb.org\/anthology\/W11-2706"},{"issue":"10","key":"409_CR33","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1111\/lnc3.12090","volume":"8","author":"R Rajkumar","year":"2014","unstructured":"Rajkumar R, White M (2014) Better surface realization through psycholinguistics. Lang Linguist Compass 8(10):428\u2013448","journal-title":"Lang Linguist Compass"},{"issue":"3","key":"409_CR34","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27(3):379\u2013423","journal-title":"Bell Syst Tech J"},{"key":"409_CR35","unstructured":"Valmari A (1989) Stubborn sets for reduced state space generation. In: Proceedings of the 10th international conference on applications and theory of petri nets, pp 491\u2013515"},{"key":"409_CR36","doi-asserted-by":"crossref","unstructured":"Wehrle M, Helmert M (2014) Efficient stubborn sets: Generalized algorithms and selection strategies. In: Chien S, Do M, Fern A, Ruml W (eds) Proceedings of the 24th international conference on automated planning and scheduling (ICAPS\u201914). AAAI Press","DOI":"10.1609\/icaps.v24i1.13638"},{"key":"409_CR37","doi-asserted-by":"crossref","unstructured":"White M (2004) Reining in CCG chart realization. In: Belz A, Evans R, Piwek P (eds) Proceedings of the 3rd international conference atural language generation, lecture notes in computer science, vol 3123, pp 182\u2013191, Springer","DOI":"10.1007\/978-3-540-27823-8_19"},{"issue":"1","key":"409_CR38","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s11168-006-9010-2","volume":"4","author":"M White","year":"2006","unstructured":"White M (2006) Efficient realization of coordinate structures in combinatory categorial grammar. Res Lang Comput 4(1):39\u201375","journal-title":"Res Lang Comput"},{"key":"409_CR39","doi-asserted-by":"crossref","unstructured":"White M, Rajkumar R (2009) Perceptron reranking for CCG realization. In: Proceedings of the 2009 conference on empirical methods in natural language processing vol 1, pp 410\u2013419","DOI":"10.3115\/1699510.1699564"},{"key":"409_CR40","unstructured":"White M, Rajkumar R (2012) Minimal dependency length in realization ranking. In: Proceedings of the 2012 joint conference on empirical methods in natural language processing and computational natural language learning, pp 244\u2013255"}],"container-title":["KI - K\u00fcnstliche Intelligenz"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-015-0409-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13218-015-0409-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-015-0409-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T14:33:52Z","timestamp":1692110032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13218-015-0409-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,20]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["409"],"URL":"https:\/\/doi.org\/10.1007\/s13218-015-0409-5","relation":{},"ISSN":["0933-1875","1610-1987"],"issn-type":[{"type":"print","value":"0933-1875"},{"type":"electronic","value":"1610-1987"}],"subject":[],"published":{"date-parts":[[2015,10,20]]}}}