Identifiability in the Limit of Context-Free Generalized Quantifiers

Research output: Journal ArticleArticlepeer-review

Abstract

We investigate the indentifiability in the limit of subclasses of generalized quantifiers definable in Presburger arithmetic.

Original languageAmerican English
JournalJournal of Language and Computation
Volume1
StatePublished - 1999

Keywords

  • Learnability
  • Generalized Quantifiers

Disciplines

  • Computer Sciences
  • Linguistics

Cite this