Article
Identifiability in the Limit of Context-Free Generalized Quantifiers
Journal of Language and Computation
(1999)
Abstract
We investigate the indentifiability in the limit of subclasses of generalized quantifiers definable in Presburger arithmetic.
Keywords
- Learnability,
- Generalized Quantifiers
Disciplines
Publication Date
1999
Citation Information
Hans Joerg Tiede. "Identifiability in the Limit of Context-Free Generalized Quantifiers" Journal of Language and Computation Vol. 1 Iss. 1 (1999) Available at: http://works.bepress.com/htiede/2/