1 / 21

Efficient Language Learning from Restricted Information

19 th of May 2006 DEA defence. Efficient Language Learning from Restricted Information. Cristina Bibire. Efficient Language Learning from Restricted Information. Goal: Incremental algorithm which is able to infer CFL (?) from: Text (positive examples)

yosef
Télécharger la présentation

Efficient Language Learning from Restricted Information

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 19th of May 2006 DEA defence Efficient Language Learning from Restricted Information Cristina Bibire

  2. Efficient Language Learning from Restricted Information • Goal: • Incremental algorithm which is able to infer CFL (?) from: • Text (positive examples) • Correction queries (generalize membership queries) Negative examples Equivalence queries

  3. Efficient Language Learning from Restricted Information • Characterization of State Merging Strategies • Submitted to URV Press, 9th of November 2005

  4. Characterization of State Merging Strategies • TB algorithm (Trakhtenbrot and Barzdin – 1973) • Gold’s algorithm (Gold – 1978) • RPNI algorithm (Oncina and Garcia – 1992) • Regular Positive and Negative Inference • Traxbar algorithm (Lang – 1992) 1997 – Abbadingo One Learning Competition • EDSM algorithm (Lang, Pearlmutter, Price) • Evidence-Driven State Merging • W-EDSM algorithm (Lang, Pearlmutter, Price) • Windowed EDSM • Blue-fringe algorithm (Lang, Pearlmutter, Price) • SAGE (Juillé – 1997) • Self-Adaptive Greedy Estimate

  5. Efficient Language Learning from Restricted Information • Characterization of State Merging Strategies • Submitted to URV Press, 9th of November 2005 • Learning DFA from Corrections • Co-authors: Leonor Becerra-Bonache, Adrian Horia Dediu • Presented at TAGI, 22nd of September 2005

  6. Learning DFA from Corrections

  7. Learning DFA from Corrections

  8. Efficient Language Learning from Restricted Information • Characterization of State Merging Strategies • Submitted to URV Press, 9th of November 2005 • Learning DFA from Corrections • Co-authors: Leonor Becerra-Bonache, Adrian Horia Dediu • Presented at TAGI, 22nd of September 2005 • Learning DFA from Correction and Equivalence queries • Co-authors: Leonor Becerra-Bonache, Adrian Horia Dediu • To be submitted to ALT 2006 – Barcelona, Deadline: 25th of May

  9. Learning DFA from Correction and Equivalence Queries

  10. Learning DFA from Correction and Equivalence Queries

  11. Learning DFA from Correction and Equivalence Queries

  12. Efficient Language Learning from Restricted Information • Characterization of State Merging Strategies • Submitted to URV Press, 9th of November 2005 • Learning DFA from Corrections • Co-authors: Leonor Becerra-Bonache, Adrian Horia Dediu • Presented at TAGI, 22nd of September 2005 • Learning DFA from Correction and Equivalence queries • Co-authors: Leonor Becerra-Bonache, Adrian Horia Dediu • To be submitted to ALT 2006 – Barcelona, Deadline: 25th of May • Learning 0-Reversible Languages from Correction Queries Only • Co-author: Colin de la Higuera • To be submitted to ICGI 2006 – Tokyo, Deadline: 27th of May

  13. Learning 0-Reversible Languages from Correction Queries Only

  14. Learning 0-Reversible Languages from Correction Queries Only

  15. Learning 0-Reversible Languages from Correction Queries Only

  16. Efficient Language Learning from Restricted Information • Characterization of State Merging Strategies • Submitted to URV Press, 9th of November 2005 • Learning DFA from Corrections • Co-authors: Leonor Becerra-Bonache, Adrian Horia Dediu • Presented at TAGI, 22nd of September 2005 • Learning DFA from Correction and Equivalence queries • Co-authors: Leonor Becerra-Bonache, Adrian Horia Dediu • To be submitted to ALT 2006 – Barcelona, Deadline: 25th of May • Learning 0-Reversible Languages from Correction Queries Only • Co-author: Colin de la Higuera • To be submitted to ICGI 2006 – Tokyo, Deadline: 27th of May • Correction Queries - A New Approach in Active Learning • Co-authors: Leonor Becerra-Bonache, Adrian Horia Dediu • To be submitted to TCS – 25th of June

  17. Efficient Language Learning from Restricted Information • Characterization of State Merging Strategies • Submitted to URV Press, 9th of November 2005 • Learning DFA from Corrections • Co-authors: Leonor Becerra-Bonache, Adrian Horia Dediu • Presented at TAGI, 22nd of September 2005 • Learning DFA from Correction and Equivalence queries • Co-authors: Leonor Becerra-Bonache, Adrian Horia Dediu • To be submitted to ALT 2006 – Barcelona, Deadline: 25th of May • Learning 0-Reversible Languages from Correction Queries Only • Co-author: Colin de la Higuera • To be submitted to ICGI 2006 – Tokyo, Deadline: 27th of May • Correction Queries - A New Approach in Active Learning • Co-authors: Leonor Becerra-Bonache, Adrian Horia Dediu • To be submitted to TCS – 25th of June • Learning RTL from Correction and Equivalence Queries • Co-author: Cătălin Ionuţ Tîrnăucă • To be submitted to WATA 2006, Deadline: 31st of May

  18. Learning RTL from Correction and Equivalence Queries

  19. Learning RTL from Correction and Equivalence Queries

  20. Learning RTL from Correction and Equivalence Queries

  21. Thank You!

More Related