IRCS Technical Reports Series
Date of this Version
This paper addresses the problem of how a learner would associate a denotation with a determiner on the basis of the pairing of a simple sentence with some perceptual input. Following work by van Benthem (1985), first order quantification is simulated with (a subclass of) finite state automata. Results from Angluin (1988) are used to demonstrate the learnability of this class.
Date Posted: 13 September 2006
University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-96-19.