Algorithmic Semantics for Processing Pronominal Verbal Phrases

  • Roussanka Loukanova
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8132)


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.


Semantic Information Machine Translation Semantic Representation Human Language Binding Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Carpenter, B.: Type-Logical Semantics. The MIT Press, Cambridge (1998)zbMATHGoogle Scholar
  2. 2.
    Copestake, A., Flickinger, D., Pollard, C., Sag, I.: Minimal recursion semantics: an introduction. Research on Language and Computation 3, 281–332 (2005)CrossRefGoogle Scholar
  3. 3.
    Gallin, D.: Intensional and Higher-Order Modal Logic. North-Holland (1975)Google Scholar
  4. 4.
    Geach, P.T.: Reference and Generality. Cornell University Press, Ithaca (1962)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Moschovakis, Y.N.: A logical calculus of meaning and synonymy. Linguistics and Philosophy 29, 27–89 (2006)CrossRefGoogle Scholar
  12. 12.
    Ranta, A.: Grammatical Framework: Programming with Multilingual Grammars. CSLI Publications, Stanford (2011)Google Scholar
  13. 13.
    Sag, I.A., Wasow, T., Bender, E.M.: Syntactic Theory: A Formal Introduction. CSLI Publications, Stanford (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Roussanka Loukanova
    • 1
  1. 1.Independent ResearchUppsalaSweden

Personalised recommendations