Language learning from membership queries and characteristic examples
This paper introduces the notion of characteristic examples and shows that the notion contributes to language learning in polynomial time. A characteristic example of a language L is an element of L which includes, in a sense, sufficient information to represent L. Every context-free language can be divided into a finite number of languages each of which has a characteristic example and it is decidable whether or not a context-free language has a characteristic example. We present an algorithm that learns parenthesis languages using membership queries and characteristic examples. Our algorithm runs in time polynomial in the number of production rules of a minimal parenthesis grammar and in the length of the longest characteristic example.
KeywordsInternal Node Production Rule Target Language Derivation Tree Tree Automaton
Unable to display preview. Download preview PDF.
- [Ang88]Dana Angluin. Queries and concept learning. Machine Learning, 2:319–342, 1988.Google Scholar
- [Ang87a]Dana Angluin. Learning k-bounded context-free grammars. Technical Report YALEU/DCS/RR-557, Department of Computer Science, Yale University, 1987.Google Scholar
- [BR87]Piotr Berman and Pobert Roos. Learning one-counter languages in polynomial time. Proceedings of 28th IEEE Symposium on Foundations of Computer Science, pages 61–67. IEEE Computer Society Press, 1987.Google Scholar
- [Har78]Michael A. Harrison. Introduction to Formal Language Theory. Reading, MA:Addison-Wesley, 1978.Google Scholar
- [Ish90]Hiroki Ishizaka. Polynomial time learnability of simple deterministic languages. Machine Learning, 5:151–164, 1990.Google Scholar
- [McN67]Robert McNaughton. Parenthesis Grammars. Journal of the ACM, 14:490–500, 1967.Google Scholar
- [Sak90]Yasubumi Sakakibara. Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science, 76:223–242, 1990.Google Scholar
- [Sha83]Ehud Y. Shapiro. Algorithmic program debugging. Cambridge, MA: MIT Press, 1983.Google Scholar