Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.Sign up
GitHub is where the world builds software
Millions of developers and companies build, ship, and maintain their software on GitHub — the largest and most advanced development platform in the world.
# generalized-quantifiers Clojure implementation of Generalized Quantifiers for English as a simple demonstration of functions that construct functions. I did this as an exercise while learning Clojure. This is a compositional model theory semantics where the denotation of a quantifier is a function that maps the denotation of a noun to a function that maps the denotation of a verb phrase to a truth value. Object noun phrases are functions that map a transitive verb to a verb phrase. Adjectives are functions that map nouns to nouns. So far, this project does *not* provide a mapping from surface structure to logical form. It just assumes a logical form that is built up compositionally from a hierarchical parse structure. For example, an object noun phrase is interpreted as a function on its sister transitive verb. Interesting linguistic characteristics of generalized quantifiers were originally discussed in: Jon Barwise and Robin Cooper. 1981. Generalized quantifiers and natural language. Linguistics and Philosophy 4:159-219. For a brief overview of the mathematical and logical analysis that underlies my implementation for this project, see: Edward L. Keenan. 2006. "Quantifiers: Semantics". Encyclopedia of Language and Linguistics, vol. 10, pp. 302-308. http://www.linguistics.ucla.edu/people/keenan/papers/quantifiers%20semantics.pdf A discussion of the same theory with a Haskell implementation is available in chapter 7 of: Jan van Eijck and Christina Unger. 2010. Computational semantics with functional programming. Cambridge University Press. A long time ago, I did an implementation using Prolog demonstrating Boolean combinations of generalized quantifiers, higher-order quantifiers like reciprocals, and scope assignments as a practical demonstration of the theory presented in my dissertation: James J. Tyhurst. 1990. "Logical Forms for English Sentences". Ph.D. dissertation at the University of California, Los Angeles. Unfortunately, that source code is no longer available. ## Usage (use '[gq.core] :reload) (m logical-form) ;; applies the interpretation function m to derive the denotation of logical-form See test/gq/test/core.clj for the interpretation of some sample sentences and sentence fragments with respect to the model in model.clj. Phrase and sentence meanings are built up compositionally from lexical items. For example: ;; Ginger bit Alan. ((m "Ginger") ((m "Alan") (m "bite")))) ;; Some dog bit Alan. (((m "some") (m "dog")) ((m "Alan") (m "bite"))) ;; Ginger bit a male student. ((m "Ginger") (((m "a") ((m "male") (m "student"))) (m "bite"))) ;; No female dog bit any female students. (((m "no") ((m "female") (m "dog"))) (((m "any") ((m "female") (m "student"))) (m "bite"))) ;; At least 2 men kissed Veronica. ((((m "at least") (m 2)) (m "man")) ((m "Veronica") (m "kiss"))) ;; Who kissed Veronica? ((m "who") ((m "Veronica") (m "kiss"))) ;; Which man kissed Veronica? (((m "which") (m "man")) ((m "Veronica") (m "kiss"))) ## License Copyright (C) 2010 Jim Tyhurst Distributed under the Eclipse Public License, the same as Clojure.