Skip to main content
padlock icon - secure page this page is secure

On an open problem in classification of languages

Buy Article:

$61.00 + tax (Refund Policy)

Smith, Wichagen and Zeugmann (1997) showed an interesting connection between learning with bounded number of mind changes from informants and classification from informant. They showed that if an indexed family of languages L is learnable via informants, using at most m mind changes, then one can partition 2N, the class of all languages, into m + 2 subclasses L1,...,Lm+ 2 such that (1)∪i∈{1,2,...,m+1} L1 = L, and (2) (L1,...,Lm+2) can be classified from informants. However Smith et al. (1997) left open whether a similar result also holds for learning from texts. We show that such a result does not hold for texts.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: CLASSIFICATION; INDUCTIVE INFERENCE

Document Type: Research Article

Publication date: April 1, 2001

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more