goagrep

func Back ¶

func Back(table [][]int, str1, str2 string, i, j int) string

http://en.wikipedia.org/wiki/Longest_common_subsequence_problem

func GenerateDB ¶

func GenerateDB(stringListPath string, databasePath string, tupleLength int, verbosity bool)

GenerateDB generates the database with precomputed strings for later searching. It is required to you generate a database before you use the GetMatch() function.

stringListPath is the filename of the list of strings you want to use

databasePath is the filename of the database that is outputed

tupleLength is the length of the subsets you want to use

func GenerateDBInMemory ¶

func GenerateDBInMemory(stringListPath string, tupleLength int, verbosity bool) (words map[int]string, tuples map[string][]int)

func GetMatch ¶

func GetMatch(s string, path string) (string, int, error)

GetMatch searches in the specified goagrep database. It returns the closest matched string and the Levenshtein distance.

s is the string you want to search

path is the filename of the database generated with GenerateDB()

func GetMatches ¶

func GetMatches(s string, path string) ([]string, []int, error)

GetMatches searches in the specified goagrep database. Returns the a list of the at most 100 words and scores in order.

s is the string you want to search

path is the filename of the database generated with GenerateDB()

func GetMatchesInMemory ¶

func GetMatchesInMemory(s string, wordsLookup map[int]string, tuplesLookup map[string][]int, tupleLength int, findBestMatch bool) ([]string, []int, error)

func GetMatchesInMemoryInParallel ¶

func GetMatchesInMemoryInParallel(s string, wordsLookup map[int]string, tuplesLookup map[string][]int, tupleLength int, findBestMatch bool) ([]string, []int, error)

func LCS ¶

func LCS(str1, str2 string) int

func Max ¶

func Max(more ...int) int