Sciweavers

38 search results - page 1 / 8
» Learning Languages from Positive Data and a Finite Number of...
Sort
View
FSTTCS
2004
Springer
13 years 10 months ago
Learning Languages from Positive Data and a Finite Number of Queries
A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, ...
Sanjay Jain, Efim B. Kinber
ICGI
1998
Springer
13 years 9 months ago
Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data
Abstract. The present paper presents a new approach of how to convert Gold-style [4] learning in the limit into stochastically finite learning with high confidence. We illustrate t...
Peter Rossmanith, Thomas Zeugmann
ICGI
2010
Springer
13 years 5 months ago
Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
Ryo Yoshinaka
ICGI
2010
Springer
13 years 5 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik
ALT
2004
Springer
14 years 1 months ago
Learning Languages from Positive Data and Negative Counterexamples
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...
Sanjay Jain, Efim B. Kinber