Share and Export
Share and Export
Lang, Kevin J., Pearlmutter, Barak A. and Price, Rodney (1998) Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: ICGI 1998: Grammatical Inference. Lecture Notes in Computer Science book series (LNCS) (1433). Springer, pp. 1-12. ISBN 9783540687078
Preview
BP-Results-1998.pdf
Download (687kB) | Preview
Abstract
This paper first describes the structure and results of the Abbadingo One DFA Learning Competition. The competition was designed to encourage work on algorithms that scale well—both to larger DFAs and to sparser training data. We then describe and discuss the winning algorithm of Rodney Price, which orders state merges according to the amount of evidence in their favor. A second winning algorithm, of Hugues Juillé, will be described in a separate paper.
| Item Type: | Book Section |
|---|---|
| Additional Information: | Cite as: Lang K.J., Pearlmutter B.A., Price R.A. (1998) Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar V., Slutzki G. (eds) Grammatical Inference. ICGI 1998. Lecture Notes in Computer Science, vol 1433. Springer, Berlin, Heidelberg |
| Keywords: | Finite Automaton; Target Concept; Candidate Node; Blue Node; Reference Algorithm; |
| Academic Unit: | Faculty of Science and Engineering > Computer Science |
| Item ID: | 10250 |
| Identification Number: | 10.1007/BFb0054059 |
| Depositing User: | Barak Pearlmutter |
| Date Deposited: | 28 Nov 2018 14:55 |
| Publisher: | Springer |
| Refereed: | Yes |
| Related URLs: | |
| URI: | https://mural.maynoothuniversity.ie/id/eprint/10250 |
| Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only (login required)
- Item control page
Downloads
Downloads per month over past year
