Abstract
The formal language of acyclic recursion \({L^{\lambda}_{ar}}\) (FLAR) has a distinctive algorithmic expressiveness, which, in addition to computational fundamentals, provides representation of underspecified semantic information. Semantic ambiguities and underspecification of information expressed by human language are problematic for computational semantics, and for natural language processing in general. Pronominal and elliptical expressions in human languages are ubiquitous and major contributors to underspecification in language and other information processing. We demonstrate the capacity of the type theory of \({L^{\lambda}_{ar}}\) for computational semantic underspecification by representing interactions between reflexives, non-reflexive pronominals, and VP ellipses with type theoretic, recursion therms. We present a class of semantic underspecification that propagates and presents in question-answering interactions. The paper introduces a technique for incremental presentation of question-answer interaction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Carpenter, B.: Type-Logical Semantics. The MIT Press, Cambridge (1998)
Copestake, A., Flickinger, D., Pollard, C., Sag, I.: Minimal recursion semantics: an introduction. Research on Language and Computation 3, 281–332 (2005)
Gallin, D.: Intensional and Higher-Order Modal Logic. North-Holland (1975)
Geach, P.T.: Reference and Generality. Cornell University Press, Ithaca (1962)
Loukanova, R.: From Montague’s rules of quantification to minimal recursion semantics and the language of acyclic recursion. In: Bel-Enguix, G., Dahl, V., Jiménez-López, M.D. (eds.) Biology, Computation and Linguistics — New Interdisciplinary Paradigms, Frontiers in Artificial Intelligence and Applications, vol. 228, pp. 200–214. IOS Press, Amsterdam (2011)
Loukanova, R.: Minimal recursion semantics and the language of acyclic recursion. In: Bel-Enguix, G., Dahl, V., Puente, A.O.D.L. (eds.) AI Methods for Interdisciplinary Research in Language and Biology, pp. 88–97. SciTePress – Science and Technology Publications, Rome (2011)
Loukanova, R.: Reference, co-reference and antecedent-anaphora in the type theory of acyclic recursion. In: Bel-Enguix, G., Jiménez-López, M.D. (eds.) Bio-Inspired Models for Natural and Formal Languages, pp. 81–102. Cambridge Scholars Publishing (2011)
Loukanova, R.: Semantics with the language of acyclic recursion in constraint-based grammar. In: Bel-Enguix, G., Jiménez-López, M.D. (eds.) Bio-Inspired Models for Natural and Formal Languages, pp. 103–134. Cambridge Scholars Publishing (2011)
Loukanova, R.: Situated agents in linguistic contexts. In: Filipe, J., Fred, A. (eds.) Proceedings of the 5th International Conference on Agents and Artificial Intelligence, February 15-18, vol. 1, pp. 494–503. SciTePress – Science and Technology Publications, Barcelona (2013)
Moschovakis, Y.N.: Sense and denotation as algorithm and value. In: Oikkonen, J., Vaananen, J. (eds.) Lecture Notes in Logic, vol. (2), pp. 210–249. Springer (1994)
Moschovakis, Y.N.: A logical calculus of meaning and synonymy. Linguistics and Philosophy 29, 27–89 (2006)
Ranta, A.: Grammatical Framework: Programming with Multilingual Grammars. CSLI Publications, Stanford (2011)
Sag, I.A., Wasow, T., Bender, E.M.: Syntactic Theory: A Formal Introduction. CSLI Publications, Stanford (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loukanova, R. (2013). Algorithmic Semantics for Processing Pronominal Verbal Phrases. In: Larsen, H.L., Martin-Bautista, M.J., Vila, M.A., Andreasen, T., Christiansen, H. (eds) Flexible Query Answering Systems. FQAS 2013. Lecture Notes in Computer Science(), vol 8132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40769-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-40769-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40768-0
Online ISBN: 978-3-642-40769-7
eBook Packages: Computer ScienceComputer Science (R0)