https://github.com/antalsz/text-set

Use a DAFSA (aka a DAWG) to implement a set of strings
https://github.com/antalsz/text-set

Last synced: about 1 month ago
JSON representation

Use a DAFSA (aka a DAWG) to implement a set of strings

• Host: GitHub
• URL: https://github.com/antalsz/text-set
• Owner: antalsz
• License: mit
• Created: 2019-07-16T02:12:45.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2019-07-16T03:04:08.000Z (over 5 years ago)
• Last Synced: 2024-10-25T07:35:10.258Z (3 months ago)
• Language: Haskell
• Size: 458 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGELOG.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# text-set

Use a [DAFSA](https://en.wikipedia.org/wiki/DAFSA) (directed acyclic finite

state automaton; aka a DAWG, a directed acyclic word graph) to implement a set of strings.

The algorithm for building the DAFSA is Algorithm 1 from the paper “Incremental

Construction of Minimal Acyclic Finite-State Automata”, by Jan Daciuk, Stoyan

Mihov, Bruce W. Watson, and Richard E. Watson.  Published in 2000 in

_Computational Linguistics_ 26(1), pp.3-16.  Available online at

.

The ENABLE wordlist, in `ENABLE-wordlist.txt`, was downloaded from [Peter

Norvig’s page about _Natural Language Corpus Data_](https://norvig.com/ngrams/).