Awesome

dawg

Directed Acyclic Word Graph implementation in Go, with fuzzy search of words in the graph.

Usage

Import the library:

import "github.com/ftbe/dawg"

Use it:

    graph, err := dawg.CreateDAWGFromFile(os.Args[1])
    if err != nil {
        // Do something
        return
    }
    words, err := graph.Search("aging", 2, 50, true, true)
    if err != nil {
        // Do something
        return
    }
    for _, word := range words {
        fmt.Println(word)
    }

Documentation

API documentation is available on godoc.