{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:05Z","timestamp":1740122465750,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T00:00:00Z","timestamp":1607990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T00:00:00Z","timestamp":1607990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"crossref","award":["2014-39"],"award-info":[{"award-number":["2014-39"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2021,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we propose a framework capable of dealing with anaphora and ellipsis which is both general and algorithmic. This generality is ensured by the compination of two general ideas. First, we use a dynamic semantics which reperent effects using a monad structure. Second we treat scopes flexibly, extending them as needed. We additionally implement this framework as an algorithm which translates abstract syntax to logical formulas. We argue that this framework can provide a unified account of a large number of anaphoric phenomena. Specifically, we show its effectiveness in dealing with pronominal and VP-anaphora, strict and lazy pronouns, lazy identity, bound variable anaphora, e-type pronouns, and cataphora. This means that in particular we can handle complex cases like Bach\u2013Peters sentences, which require an account dealing simultaneously with several phenomena. We use Haskell as a meta-language to present the theory, which also consitutes an implementation of all the phenomena discussed in the paper. To demonstrate coverage, we propose a test suite that can be used to evaluate computational approaches to anaphora.<\/jats:p>","DOI":"10.1007\/s10849-020-09322-7","type":"journal-article","created":{"date-parts":[[2020,12,15]],"date-time":"2020-12-15T12:04:20Z","timestamp":1608033860000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Computational Treatment of Anaphora and Its Algorithmic Implementation"],"prefix":"10.1007","volume":"30","author":[{"given":"Jean-Philippe","family":"Bernardy","sequence":"first","affiliation":[]},{"given":"Stergios","family":"Chatzikyriakidis","sequence":"additional","affiliation":[]},{"given":"Aleksandre","family":"Maskharashvili","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,15]]},"reference":[{"key":"9322_CR1","unstructured":"Barker, C., & Shan, C. (2004). Continuations in natural language. In: Proceedings of the fourth ACM SIGPLAN workshop on continuations, Hayo Thielecke (pp. 55\u201364)."},{"key":"9322_CR2","volume-title":"Category theory for computing science","author":"M Barr","year":"1999","unstructured":"Barr, M., & Wells, C. (1999). Category theory for computing science (3rd ed.). Upper Saddle River: Prentice Hall.","edition":"3"},{"key":"9322_CR3","unstructured":"Bernardy, J.-P., & Chatzikyriakidis, S. (2019). A wide-coverage symbolic natural language inference system. In: Proceedings of the 22nd nordic conference on computational linguistics. ACL."},{"key":"9322_CR4","unstructured":"Bernardy, J.-P., Chatzikyriakidis, S., & Maskharashvili, A. (2020). A computational treatment of anaphora and its algorithmic implementation: Extended version. Available on the author\u2019s homepage: https:\/\/jyp.github.io\/pdf\/phoroi.pdf."},{"key":"9322_CR5","doi-asserted-by":"crossref","unstructured":"Boldini, P. (2000). Formalizing contexts in intuitionistic type theory. In Fundamenta Informaticae 4(2).","DOI":"10.3233\/FI-2000-42201"},{"key":"9322_CR6","unstructured":"Charlow, S. (2015). Monadic dynamic semantics for anaphora. In: Ohio State dynamic semantics workshop."},{"key":"9322_CR7","unstructured":"Charlow, S. (2017). A modular theory of pronouns and binding. In Logic and engineering of natural language semantics (LENLS) (vol. 14). Springer."},{"key":"9322_CR8","unstructured":"Chatzikyriakidis, S. (2014). Adverbs in a modern type theory. In: N. Asher, & S. Soloviev (Eds.), Proceedings of LACL2014. LNCS 8535 (pp. 44\u201356)."},{"key":"9322_CR9","unstructured":"Chatzikyriakidis, S., & Luo, Z. (2013). Adjectives in a modern type-theoretical setting. In: Formal grammar (pp. 159\u2013174). Springer."},{"key":"9322_CR10","unstructured":"Chatzikyriakidis, S., & Luo, Z. (2017). On the interpretation of common nouns: Types versus predicates. In: Modern perspectives in type-theoretical semantics (pp. 43\u201370). Springer."},{"key":"9322_CR11","unstructured":"Cooper, R. (1979). The interpretation of pronouns. In: F. Heny & H. Schnelle (Eds.), Syntax and semantics (vol. 10, pp. 535\u2013561)."},{"key":"9322_CR12","unstructured":"Cooper, R. (2017). Adapting type theory with records for natural language semantics. In: S. Chatzikyriakidis, & Z. Luo (Eds.) Modern perspectives in type-theoretical semantics (pp. 71\u201394). Springer."},{"key":"9322_CR13","doi-asserted-by":"crossref","unstructured":"de Groote, P. (2006). Towards a Montagovian account of dynamics. In Semantics and linguistic theory (Vol. 16, pp. 1\u201316).","DOI":"10.3765\/salt.v16i0.2952"},{"key":"9322_CR14","doi-asserted-by":"crossref","unstructured":"Egli, U. (1979). The stoic concept of anaphora. In R. B\u00e4uerle, U. Egli, & A. von Stechow (Eds.), Semantics from different points of view (pp. 266\u2013283). Springer.","DOI":"10.1007\/978-3-642-67458-7_18"},{"key":"9322_CR15","doi-asserted-by":"crossref","unstructured":"Egli, U., Von Heusinger, K., et al. (1995). The epsilon operator and E-type pronouns. In Amsterdam studies in the theory and history of linguistic science series (vol 4).","DOI":"10.1075\/cilt.114.07egl"},{"issue":"2","key":"9322_CR16","first-page":"337","volume":"11","author":"G Evans","year":"1980","unstructured":"Evans, G. (1980). Pronouns. Linguistic Inquiry, 11(2), 337\u2013362.","journal-title":"Linguistic Inquiry"},{"key":"9322_CR17","volume-title":"Reference and generality","author":"Peter Thomas Geach","year":"1962","unstructured":"Geach, Peter Thomas. (1962). Reference and generality. New York: Cornell University Press."},{"key":"9322_CR18","unstructured":"Giorgolo, G., & Asudeh, A. (2012). Monads for conventional implicatures. In Proceedings of Sinn und Bedeutung 16. MIT-Working Papers in Linguistics."},{"key":"9322_CR19","doi-asserted-by":"crossref","unstructured":"Giorgolo, G., & Asudeh, A. (2014). Monads as a solution for generalized opacity. In EACL 2014 (p. 19).","DOI":"10.3115\/v1\/W14-1403"},{"issue":"1","key":"9322_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF00628304","volume":"14","author":"J Groenendijk","year":"1991","unstructured":"Groenendijk, J., & Stokhof, M. (1991). Dynamic predicate logic. Linguistics and Philosophy, 14(1), 39\u2013100.","journal-title":"Linguistics and Philosophy"},{"issue":"1","key":"9322_CR21","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2006.03.013","volume":"357","author":"M Hyland","year":"2006","unstructured":"Hyland, M., Plotkin, G., & Power, J. (2006). Combining effects: Sum and tensor. Theoretical Computer Science, 357(1), 70\u201399. https:\/\/doi.org\/10.1016\/j.tcs.2006.03.013.","journal-title":"Theoretical Computer Science"},{"key":"9322_CR22","unstructured":"Itegulov, D., Lebedeva, E., & Paleo, B. W. (2018). Sensala: A dynamic semantics system for natural language processing. In Proceedings of the 27th international conference on computational linguistics: System demonstrations (pp. 123\u2013127). Santa Fe, New Mexico: Association for Computational Linguistics. https:\/\/www.aclweb.org\/ anthology\/C18-2027."},{"key":"9322_CR23","doi-asserted-by":"publisher","unstructured":"Karttunen, L. (1969). Discourse referents. In Proceedings of the 1969 conference on computational linguistics (pp. 1\u201338). COLING\u201969. Stockholm: Association for Computational Linguistics. https:\/\/doi.org\/10.3115\/990403.990490.","DOI":"10.3115\/990403.990490"},{"issue":"2","key":"9322_CR24","first-page":"157","volume":"7","author":"L Karttunen","year":"1971","unstructured":"Karttunen, L. (1971). Definite descriptions with crossing coreference: A study of the Bach\u2013Peters paradox. Foundations of Language, 7(2), 157\u2013182.","journal-title":"Foundations of Language"},{"key":"9322_CR25","doi-asserted-by":"crossref","unstructured":"Luo, Z. (2012). Common nouns as types. In D. Bechet, & A. Dikovsky (Eds.), Logical aspects of computational linguistics (LACL\u20192012). LNCS 7351.","DOI":"10.1007\/978-3-642-31262-5_12"},{"key":"9322_CR26","unstructured":"Marlow, S. (2010). Haskell 2010 language report. http:\/\/haskell.org\/definition\/haskell2010.pdf."},{"key":"9322_CR27","unstructured":"Mar\u0161\u00edk, J., & Amblard, M. (2016). Introducing a calculus of effects and handlers for natural language semantics. In A. Foret et al. (Eds.), Formal grammar (pp. 257\u2013272). Berlin: Springer. ISBN: 978-3-662-53042-9."},{"issue":"1","key":"9322_CR28","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E. (1991). Notions of computation and monads. Information and Computation, 93(1), 55\u201392.","journal-title":"Information and Computation"},{"key":"9322_CR29","doi-asserted-by":"publisher","unstructured":"Plotkin, G., & Pretnar, M. (2009). Handlers of algebraic effects. In Proceedings of the 18th European symposium on programming languages and systems: held as part of the joint European conferences on theory and practice of software, ETAPS 2009. ESOP\u201909 (pp. 80\u201394). York: Springer. ISBN: 978-3-642-00589-3. https:\/\/doi.org\/10.1007\/978-3-642-00590-9_7.","DOI":"10.1007\/978-3-642-00590-9_7"},{"key":"9322_CR30","doi-asserted-by":"crossref","unstructured":"Poesio, M., & Zucchi, A. (1992). On telescoping. In C. Barker, & D. Dowty (Eds.) SALT II-proceedings from the conference on semantics and linguistic theory (Columbus, Ohio, May 1\u20133) (pp. 347\u2013366).","DOI":"10.3765\/salt.v2i0.3034"},{"key":"9322_CR31","doi-asserted-by":"crossref","unstructured":"Qian, S., de Groote, P., & Amblard, M. (2016). Modal subordination in type theoretic dynamic logic. In LiLT (Linguistic Issues in Language Technology) 14.","DOI":"10.33011\/lilt.v14i.1395"},{"key":"9322_CR32","volume-title":"Type-theoretical grammar","author":"A Ranta","year":"1994","unstructured":"Ranta, A. (1994). Type-theoretical grammar. Oxford: Oxford University Press."},{"key":"9322_CR33","unstructured":"Roberts, C. (1987). Modal subordination, anaphora, and distributivity. https:\/\/www.asc.ohio-state.edu\/roberts.21\/dissertation.pdf."},{"issue":"6","key":"9322_CR34","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/BF00632602","volume":"12","author":"C Roberts","year":"1989","unstructured":"Roberts, C. (1989). Modal subordination and pronominal anaphora in discourse. Linguistics and Philosophy, 12(6), 683\u2013721. https:\/\/doi.org\/10.1007\/BF00632602.","journal-title":"Linguistics and Philosophy"},{"key":"9322_CR35","volume-title":"Modal subordination, anaphora, and distributivity","author":"C Roberts","year":"1990","unstructured":"Roberts, C. (1990). Modal subordination, anaphora, and distributivity. New York: Garland Press."},{"key":"9322_CR36","unstructured":"Shan, C. (2002). Monads for natural language semantics. In CoRR cs.CL\/0205026. arXiv:CL\/0205026"},{"key":"9322_CR37","unstructured":"Shelley, L. K. (2011). Understanding dynamic discourse. Ph.D. Thesis. Rutgers, The State University of New Jersey."},{"key":"9322_CR38","doi-asserted-by":"crossref","unstructured":"Unger, C. (2011) Dynamic semantics as monadic computation. In JSAI International symposium on artificial intelligence (pp. 68\u201381). Springer.","DOI":"10.1007\/978-3-642-32090-3_7"}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-020-09322-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10849-020-09322-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-020-09322-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T02:10:04Z","timestamp":1670206204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10849-020-09322-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,15]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["9322"],"URL":"https:\/\/doi.org\/10.1007\/s10849-020-09322-7","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"type":"print","value":"0925-8531"},{"type":"electronic","value":"1572-9583"}],"subject":[],"published":{"date-parts":[[2020,12,15]]},"assertion":[{"value":"9 October 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}