{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:38:53Z","timestamp":1743035933452,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662538258"},{"type":"electronic","value":"9783662538265"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,11,10]],"date-time":"2016-11-10T00:00:00Z","timestamp":1478736000000},"content-version":"vor","delay-in-days":314,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03bb<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-DRT is a typed theory combining simply typed <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03bb<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-calculus with discourse representation theory, used for modelling the semantics of natural language. With the aim of type-checking natural language texts in the same vein as is familiar from type-checking programs, we propose <jats:italic>untyped<\/jats:italic><jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03bb<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-DRT with automatic type reconstruction. We show a principal types theorem for <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03bb<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-DRT and how type reconstruction can be used to make pronoun resolution type-correct, i.e. the inferred types of a pronoun occurrence and its antecedent noun phrase have to be compatible, thereby reducing the number of possible antecedents.<\/jats:p>","DOI":"10.1007\/978-3-662-53826-5_10","type":"book-chapter","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T11:59:48Z","timestamp":1478692788000},"page":"149-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Type Reconstruction for $$\\lambda $$-DRT Applied to Pronoun Resolution"],"prefix":"10.1007","author":[{"given":"Hans","family":"Lei\u00df","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuqian","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-662-43742-1_2","volume-title":"Logical Aspects of Computational Linguistics","author":"D Bekki","year":"2014","unstructured":"Bekki, D.: Representing anaphora with dependent types. In: Asher, N., Soloviev, S. (eds.) LACL 2014. LNCS, vol. 8535, pp. 14\u201329. Springer, Heidelberg (2014)"},{"key":"10_CR2","unstructured":"Bos, J., Mastenbroek, E., McGlashan, S., Millies, S., Pinkal, M.: A compositional DRS-based formalism for NLP-applications. In: Proceedings of International Workshop on Computational Semantics, Tilburg, pp. 21\u201331 (1994)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bos, J., Basile, V., Evang, K., Venhuizen, N., Bjerva, J.: The Groningen Meaning Bank. In: Ide, N., Pustejovsky, J. (eds.) Handbook of Linguistic Annotation. Springer, Berlin (2017, to appear). http:\/\/gmb.let.rug.nl","DOI":"10.1007\/978-94-024-0881-2_18"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-14418-9_11","volume-title":"Controlled Natural Language","author":"M Cramer","year":"2010","unstructured":"Cramer, M., Fisseni, B., Koepke, P., K\u00fchlwein, D., Schr\u00f6der, B., Veldman, J.: The Naproche project controlled natural language proof checking of mathematical texts. In: Fuchs, N.E. (ed.) CNL 2009. LNCS (LNAI), vol. 5972, pp. 170\u2013186. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-14418-9_11"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Curran, J.R., Clark, S., Bos, J.: Linguistically motivated large-scale NLP with C&C and boxer. In: Proceedings of ACL, Prague, June 2007, pp. 33\u201336. Association for Computational Linguistics (2007)","DOI":"10.3115\/1557769.1557781"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Damas, L., Milner, R.: Principal type-schemes for functional programs. In: Proceedings of 9th ACM Symposium on Principles of Programming Languages, pp. 207\u2013212 (1982)","DOI":"10.1145\/582153.582176"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"de\u00a0Groote, P.: Towards a Montagovian account of dynamics. In: Gibson, M., Howell, J. (eds.) Proceedings of SALT XVI, vol. 16 (2006)","DOI":"10.3765\/salt.v16i0.2952"},{"key":"10_CR8","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-37012-0","volume-title":"The Language of Mathematics","author":"M Ganesalingam","year":"2013","unstructured":"Ganesalingam, M.: The Language of Mathematics. LNCS, vol. 7805. Springer, Heidelberg (2013)"},{"key":"10_CR9","first-page":"29","volume":"146","author":"R Hindley","year":"1969","unstructured":"Hindley, R.: The principal type-scheme of an object in combinatory logic. Trans. Am. Math. Soc. 146, 29\u201360 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"10_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1616-1","volume-title":"From Discourse to Logic","author":"H Kamp","year":"1993","unstructured":"Kamp, H., Reyle, U.: From Discourse to Logic. Kluwer, Dordrecht (1993)"},{"key":"10_CR11","unstructured":"Kohlhase, M., Kuschert, S.: Towards a dynamic type theory. Technical report, Universit\u00e4t des Saarlands (1996)"},{"key":"10_CR12","unstructured":"Kohlhase, M., Kuschert, S.: Dynamic lambda calculus. In: Proceedings of 5th Conference on the Mathematics of Language, Schlo\u00df Dagstuhl (1997)"},{"key":"10_CR13","unstructured":"Kohlhase, M., Kuschert, S., Pinkal, M.: A type-theoretic semantics for $$\\lambda $$-DRT. In: Dekker, P., Strokhof, M. (eds.) Proceedings of 10th Amsterdam Colloquium, pp. 479\u2013498 (1996)"},{"key":"10_CR14","volume-title":"Computing Meanings: Current Issues in Computational Semantics","author":"E Krahmer","year":"1999","unstructured":"Krahmer, E., Piwek, P.: Presupposition projection as proof construction. In: Bunt, H., Muskens, R. (eds.) Computing Meanings: Current Issues in Computational Semantics. Kluwer, Dordrecht (1999)"},{"key":"10_CR15","unstructured":"Kuschert, S.: Eine Erweiterung des $$\\lambda $$-Kalk\u00fcls um Diskursrepr\u00e4sentationsstrukturen. Master\u2019s thesis, Universit\u00e4t Saarbr\u00fccken (1995)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-32024-8_18","volume-title":"Formal Grammar","author":"H Lei\u00df","year":"2012","unstructured":"Lei\u00df, H.: Resolving plural ambiguities by type reconstruction. In: Groote, P., Nederhof, M.-J. (eds.) FG 2010-2011. LNCS, vol. 7395, pp. 267\u2013286. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-32024-8_18"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-78197-4_20","volume-title":"New Frontiers in Artificial Intelligence","author":"K Mineshima","year":"2008","unstructured":"Mineshima, K.: A presuppositional analysis of definite descriptions in proof theory. In: Satoh, K., Inokuchi, A., Nagao, K., Kawamura, T. (eds.) JSAI 2007. LNCS (LNAI), vol. 4914, pp. 214\u2013227. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-78197-4_20"},{"key":"10_CR18","first-page":"247","volume-title":"Formal Philosophy","author":"R Montague","year":"1974","unstructured":"Montague, R.: The proper treatment of quantification in ordinary English (chapter 8). In: Thomason, R. (ed.) Formal Philosophy, pp. 247\u2013270. Yale University Press, New Haven (1974)"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF00635836","volume":"19","author":"R Muskens","year":"1996","unstructured":"Muskens, R.: Combining montague semantics and discourse representation. Linguist. Philos. 19, 143\u2013186 (1996)","journal-title":"Linguist. Philos."},{"key":"10_CR20","volume-title":"Type-Theoretical Grammar","author":"A Ranta","year":"1994","unstructured":"Ranta, A.: Type-Theoretical Grammar. Clarendon Press, Oxford (1994)"},{"key":"10_CR21","unstructured":"Ruhrberg, P.: Simultaneous abstraction and semantic theories. Ph.D. thesis, University of Edinburgh (1996)"},{"key":"10_CR22","unstructured":"Wu, S.: Getypte Lambda-Diskursrepr\u00e4sentationsstrukturen - Typrekonstruktion f\u00fcr die $$\\lambda $$-Diskursrepr\u00e4sentationstheorie. Master\u2019s thesis, Centrum f\u00fcr Informations- und Sprachverarbeitung, Universit\u00e4t M\u00fcnchen (2012)"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996\u20132016)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53826-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:22:25Z","timestamp":1709821345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-53826-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662538258","9783662538265"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53826-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"10 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LACL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logical Aspects of Computational Linguistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lacl2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lacl.gforge.inria.fr\/lacl-2016\/index-presentation.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}