Advertisement

Learning DFA from Correction and Equivalence Queries

  • Leonor Becerra-Bonache
  • Adrian Horia Dediu
  • Cristina Tîrnăucă
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4201)

Abstract

In active learning, membership queries and equivalence que- ries have established themselves as the standard combination to be used. However, they are quite “unnatural” for real learning environments (membership queries are oversimplified and equivalence queries do not have a correspondence in a real life setting). Based on several linguistic arguments that support the presence of corrections in children’s language acquisition, we propose another kind of query called correction query. We provide an algorithm that learns DFA using correction and equivalence queries in polynomial time. Despite the fact that the worst case complexity of our algorithm is not better than Angluin’s algorithm, we show through a large number of experiments that the average number of queries is considerably reduced by using correction queries.

Keywords

Active learning learning DFA membership query equivalence query correction query 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Becerra-Bonache, L.: On the Learnability of Mildly Context-Sensitive Languages using Positive Data and Correction Queries. Doctoral thesis, Rovira i Virgili University (2006)Google Scholar
  3. 3.
    Becerra-Bonache, L., Yokomori, T.: Learning mild context-sensitiveness: Toward understanding children’s language learning. In: Paliouras, G., Sakakibara, Y. (eds.) ICGI 2004. LNCS (LNAI), vol. 3264, pp. 53–64. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (2001)zbMATHGoogle Scholar
  5. 5.
    Yu, S.: Finite automata. In: Martin-Vide, C., Mitrana, V., Paun, G. (eds.) Formal Languages and Applications. Studies in Fuzzyness and Soft Computing 148, pp. 55–85. Springer, Heidelberg (2004)Google Scholar
  6. 6.
    Angluin, D.: Queries and concept learning. Machine Learning 2(4), 319–342 (1988)Google Scholar
  7. 7.
    Mohri, M., Pereira, F.C.N., Riley, M.: A rational design for a weighted finite-state transducer library. In: Wood, D., Yu, S. (eds.) WIA 1997. LNCS, vol. 1436, pp. 144–158. Springer, Heidelberg (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Leonor Becerra-Bonache
    • 1
  • Adrian Horia Dediu
    • 1
    • 2
  • Cristina Tîrnăucă
    • 1
  1. 1.Research Group on Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain
  2. 2.Faculty of Engineering in Foreign LanguagesUniversity “Politehnica” of BucharestBucharestRomania

Personalised recommendations