Skip to content

MathieuTurcotte/go-trie

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 

Repository files navigation

About

This library implements tries, also known as prefix trees, using minimal acyclic finite-state automata for the Go programming language (http://golang.org/).

The implementation is based on Jan Daciuk, Stoyan Mihov, Bruce W. Watson, Richard E. Watson (2000). "Incremental Construction of Minimal Acyclic Finite-State Automata". Computational Linguistics: March 2000, Vol. 26, No. 1, Pages 3-16.

The javascript equivalent of this library can be found at MathieuTurcotte/node-trie.

Installing

$ go get github.com/MathieuTurcotte/go-trie/gtrie

Documentation

Read it online or run

$ go doc github.com/MathieuTurcotte/go-trie/gtrie

License

This code is free to use under the terms of the MIT license.

About

Trie implementation based on a minimal automaton for Go

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages