Abstract
We consider inductive language learning and machine discovery from examples with some errors. In the present paper, the error or incorrectness we consider is the one described uniformly in terms of a distance over strings. Firstly, we introduce a notion of a recursively generable distance over strings, and for a language L, we define a k-neighbor language L′ as a language obtained from L by (i) adding some strings not in L each of which is at most k distant from some string in L and by (ii) deleting some strings in L each of which is at most k distant from some string not in L. Then we define a k-neighbor system of a base language class as the collection of k-neighbor languages of languages in the class, and adopt it as a hypothesis space. We give formal definitions of k-neighbor (refutable) inferability, and discuss necessary and sufficient conditions on such kinds of inference.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Angluin: Finding patterns common to a set of strings, Journal of Computer and System Sciences 21 (1980) 46–62.
D. Angluin: Inductive inference of formal languages from positive data, Information and Control 45 (1980) 117–135.
S. Arikawa: Elementary formal systems and formal languages-simple formal systems, Memoirs of Faculty of Science, Kyushu University, Series A, Math. 24 (1970) 47–75.
S. Arikawa, T. Shinohara and A. Yamamoto: Elementary formal systems as a unifying framework for language learning, in Proceedings of the Second Annual ACM Workshop on Computational Learning Theory (1989) 312–327.
S. Arikawa, T. Shinohara and A. Yamamoto: Learning elementary formal systems, Theoretical Computer Science 95 (1992) 97–113.
M. Blum: A machine independent theory of the complexity of the recursive functions, Journal of the Association for Computing Machinery 14(2) (1967) 322–336.
J. Case and S. Jain: Synthesizing learners tolerant computable noisy data, in Proceedings of the Ninth International Conference on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 1501 (1998) 205–219.
E. M. Gold: Language identification in the limit, Information and Control 10 (1967) 447–474.
S. Jain: Program synthesis in the presence of infinite number of inaccuracies, Journal of Computer and System Sciences 53(3) (1996) 583–591.
S. Jain: Learning with refutation, Journal of Computer and System Sciences 57(3) (1998) 356–365.
S. Kobayashi and T. Yokomori: On approximately identifying concept classes in the limit, in Proceedings of the Sixth International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 997 (1995) 298–312.
S. Lange and T. Zeugmann: Types of monotonic language learning and their characterization, in Proceedings of the Fifth Annual ACMWorkshop on Computational Learning Theory (1992) 377–390.
S. Lange and P. Watson: Machine discovery in the presence of incomplete or ambiguous data, in Proceedings of the Fifth International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 872 (1994) 438–452.
Y. Mukouchi: Characterization of finite identification, in Proceedings of the Third International Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence 642 (1992) 260–267.
Y. Mukouchi and S. Arikawa: Inductive inference machines that can refute hypothesis spaces, in Proceedings of the Fourth International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 744 (1993) 123–136.
Y. Mukouchi: Inductive inference of an approximate concept from positive data, in Proceedings of the Fifth International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 872 (1994) 484–499.
Y. Mukouchi and S. Arikawa: Towards a mathematical theory of machine discovery from facts, Theoretical Computer Science 137 (1995) 53–84.
Y. Mukouchi: Refutable inference with a restricted target class, Mathematica Japonica 49(3) (1999) 363–372.
Y. Mukouchi and M. Sato: Language learning with a neighbor system, in Proceedings of the Third International Conference on Discovery Science, Lecture Notes in Artificial Intelligence 1967 (2000) 183–196.
H. Rogers Jr.: “Theory of recursive functions and effective computability,” McGraw-Hill, 1967.
M. Sato: Inductive inference of formal languages, Bulletin of Informatics and Cybernetics 27(1) (1995) 85–106.
T. Shinohara: Rich classes inferable from positive data: length-bounded elementary formal systems, Information and Computation 108 (1994) 175–186.
R. M. Smullyan: “Theory of formal systems,” Princeton University Press, 1961.
F. Stephan: Noisy inference and oracles, Theoretical Computer Science 185 (1997) 129–157.
A. Yamamoto: Procedural semantics and negative information of elementary formal system, Journal of Logic Programming 13(4) (1992) 89–98.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mukouchi, Y., Sato, M. (2001). Refutable Language Learning with a Neighbor System. In: Abe, N., Khardon, R., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 2001. Lecture Notes in Computer Science(), vol 2225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45583-3_21
Download citation
DOI: https://doi.org/10.1007/3-540-45583-3_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42875-6
Online ISBN: 978-3-540-45583-7
eBook Packages: Springer Book Archive