https://github.com/rhcarvalho/dawgo

DAWGo is the home for a particular implementation of a Directed Acyclic Word Graph in Go.
https://github.com/rhcarvalho/dawgo

algorithm data-structure directed-graph go golang graph natural-language-processing trie

Last synced: 3 days ago
JSON representation

DAWGo is the home for a particular implementation of a Directed Acyclic Word Graph in Go.

• Host: GitHub
• URL: https://github.com/rhcarvalho/dawgo
• Owner: rhcarvalho
• Created: 2013-01-30T21:24:40.000Z (almost 12 years ago)
• Default Branch: master
• Last Pushed: 2019-07-22T17:07:43.000Z (over 5 years ago)
• Last Synced: 2024-06-11T18:41:08.321Z (5 months ago)
• Topics: algorithm, data-structure, directed-graph, go, golang, graph, natural-language-processing, trie
• Language: Go
• Size: 7.81 KB
• Stars: 3
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
DAWGo

=====

DAWGo is the home for a particular implementation of a [Directed Acyclic Word

Graph][dawg] in [Go][go]. In fact, the current implementation is closer to a

[Trie][trie] data structure, because common suffixes are shared.

This repository / library was created to support [Shenmeci][shenmeci] in 2013,

and in July 2019 it has been merged into the main project.

No new development is expected to happen here.

[go]: https://golang.org/

[shenmeci]: https://github.com/rhcarvalho/shenmeci

[dawg]: https://en.wikipedia.org/wiki/Deterministic_acyclic_finite_state_automaton

[trie]: https://en.wikipedia.org/wiki/Trie