38 search results - page 2 / 8 » Learning Languages from Positive Data and a Finite Number of... |
ICGI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
MM
2005
ACM
13 years 10 months ago
2005
ACM
In this paper we unify two supposedly distinct tasks in multimedia retrieval. One task involves answering queries with a few examples. The other involves learning models for seman...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
IEICET
2008
13 years 5 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
FSMNLP
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. Active language learning is an interesting task for which theoretical results are known and several applications exist. In order to better understand what the better stra...