A `Natural Logic' inference system using the Lambek calculus

  • Authors:
  • Anna Zamansky;Nissim Francez;Yoad Winter

  • Affiliations:
  • School of Computer Science, Tel-Aviv University, Ramat-Aviv, Israel;Computer Science Faculty, Technion - IIT, Haifa, Israel;Computer Science Faculty, Technion - IIT, Haifa, Israel

  • Venue:
  • Journal of Logic, Language and Information
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper develops an inference system for natural language within the `Natural Logic' paradigm as advocated by van Benthem (1997), Sánchez (1991) and others. The system that we propose is based on the Lambek calculus and works directly on the Curry-Howard counterparts for syntactic representations of natural language, with no intermediate translation to logical formulae. The Lambek-based system we propose extends the system by Fyodorov et~al. (2003), which is based on the Ajdukiewicz/Bar-Hillel (AB) calculus Bar Hillel, (1964). This enables the system to deal with new kinds of inferences, involving relative clauses, non-constituent coordination, and meaning postulates that involve complex expressions. Basing the system on the Lambek calculus leads to problems with non-normalized proof terms, which are treated by using normalization axioms.