Identifiability in the Limit of Context-Free Generalized Quantifiers

Research output: Journal Article › Article › peer-review

Abstract

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

Original language	American English
Journal	Journal of Language and Computation
Volume	1
State	Published - 1999

@article{c7b1b8eea547426caf82df6a37b5b9b9,

title = "Identifiability in the Limit of Context-Free Generalized Quantifiers",

abstract = " We investigate the indentifiability in the limit of subclasses of generalized quantifiers definable in Presburger arithmetic.",

keywords = "Generalized Quantifiers, Learnability",

author = "Tiede, \{Hans Joerg\}",

year = "1999",

language = "American English",

volume = "1",

journal = "Journal of Language and Computation",

}

TY - JOUR

T1 - Identifiability in the Limit of Context-Free Generalized Quantifiers

AU - Tiede, Hans Joerg

PY - 1999

Y1 - 1999

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

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

KW - Generalized Quantifiers

KW - Learnability

M3 - Article

VL - 1

JO - Journal of Language and Computation

JF - Journal of Language and Computation

ER -