https://github.com/drdub/gal

Learn Finite State Automata that generalize over a set of training instances
https://github.com/drdub/gal

Last synced: about 1 month ago
JSON representation

Learn Finite State Automata that generalize over a set of training instances

• Host: GitHub
• URL: https://github.com/drdub/gal
• Owner: DrDub
• License: gpl-2.0
• Created: 2010-11-13T11:53:55.000Z (about 14 years ago)
• Default Branch: master
• Last Pushed: 2010-11-13T12:16:45.000Z (about 14 years ago)
• Last Synced: 2023-03-11T04:12:47.914Z (almost 2 years ago)
• Language: Java
• Homepage:
• Size: 164 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README
  • License: COPYING

Awesome Lists containing this project

README

        
README

======

This is an (incomplete) implementation of GAL, the Genetic Automaton Learner as 

defined in Chapter 5 of Belz (2000).

The point of this code is to learn a FSA that *generalizes* from a set of positive

examples. (If you just want to cover exactly the input, you can use any existing

package for doing FSA minimization.)

The input file is in text format, one sequence per line, the alphabet will be induced

by tokens separated by white-spaces.

This project currently builds under Eclipse, feel free to contribute an ant script.

To run an example, use the LearnFSA run configuration in run_config/

To create a graph from the output, install the package graphviz and use

  dot -Tpng best-instance.dot > best-instance.png

  

Take a look at the PNG in the repository for an example of the learned automata.

Edit the default.properties to get better goodness of fit. Read chapter 5 of Belz (2000)

for more details and for further ideas about how to improve it. Patches are welcomed.

Pablo Duboue, November 2010

References

Belz, Anja (2000) "Computational Learning of Finite-State Models for 

Natural Language Processing", PhD Thesis, University of Sussex.