On learning regular expressions and patterns via membership and correction queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5278 LNAI, Issue , 2008, Pages 125-138

  Kinber, Efim ^a  

^a SACRED HEART UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; EDUCATION; INFERENCE ENGINES; QUERY LANGUAGES;

EDIT DISTANCES; LEARNING PATTERNS; LEARNING PROCESSES; MEMBERSHIP QUERIES; POSITIVE DATUMS; REGULAR EXPRESSIONS; TIME ALGORITHMS;

LEARNING ALGORITHMS;

EID: 56649102060     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88009-7_10     Document Type: Conference Paper

References (19)

1. Angluin, D.: Finding Patterns Common to a Set of Strings (extended abstract). In: 11th Annual ACM Symposium on Theory of Computing, pp. 130-141. ACM Press, New York (1979)
2. Angluin, D.: Inference of Reversible Languages. Journal of the ACM 29(3), 741-765 (1982)
3. Angluin, D.: Learning Regular Sets from Queries and Counterexamples. Information and Computation 75(2), 87-106 (1987)
4. Angluin, D.: Queries and Concept Learning. Machine Learning 2, 319-342 (1988)
5. Becerra-Bonache, L., Dediu, A.H., Tîrnǎucǎ, C.: Learning DFA from Correction and Equivalence Queries. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 281-292. Springer, Heidelberg (2006)
6. Becerra-Bonache, L., de la Higuera, C., Janodet, J.C., Tantini, F.: Learning Balls of Strings with Correction Queries. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) ECML 2007. LNCS (LNAI), vol. 4701, pp. 18-29. Springer, Heidelberg (2007)
7. Bex, G.J., Neven, F., Schwentick, T., Tuyls, K.: Inference of Concise DTDs from XML Data. In: 32nd International Conference on Very Large Data Bases VLDB (2006)
8. Bex, G.J., Gelade, W., Neven, F., Vansummeren, S.: Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. In: WWW Conference 2008, Beijing, China, pp. 825-836 (2008)
9. Gold, E.M.: Language Identification in the Limit. Information and Control 10, 447-474 (1967)
10. Fernau, H.: Algorithms for Learning Regular Expressions. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNA1), vol. 3734, pp. 297-311. Springer, Heidelberg (2005)
11. Kinber, E.: Learning a Class of Regular Expressions via Restricted Subset Queries. In: Jantke, K.R (ed.) All 1992. LNCS, vol. 642, pp. 232-243. Springer, Heidelberg (1992)
12. Lange, S., Wiehagen, R.: Polynomial-time Inference ol Arbitrary Pattern Languages. New Generation Computing 8(4), 361-370 (1991)
13. Rohde, D.L.T., Plaut, D.C.: Language Acquisition in the Absence ol Explicit Negative Evidence: How Important Is Starting Small? Cognition 72, 67-109 (1999)
14. Sakakibara, Y.: Learning Context-free Grammars from Structural Data in Polynomial Time. Theoretical Computer Science 76, 223-242 (1990)
15. Shinohara, T., Arikawa, S.: Pattern Inference. In: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS, vol. 961, pp. 259-291. Springer, Heidelberg (1995)
16. Tîrnǎucǎ, C., Knuutila, T.: Polynomial Time Algorithms for Learning k-reversible Languages and Pattern Languages with Correction Queries. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 264-276. Springer, Heidelberg (2007)
17. Tîrnǎucǎ, C.I., Tîrnǎucǎ, C.: Learning Regular Tree Languages from Correction and Equivalence Queries. Journal of Automata, Languages and Combinatorics 12 (2007)
18. Valiant, L.G.: A Theory of the Learnable. Communications of the ACM 27(11), 1134-1142 (1984)
19. Yokomori, T.: Learning Non-deterministic Finite Automata from Queries and Counterexamples. Machine Intelligence 13, 169-189 (1994)