Popularity
0.3
Stable
Activity
0.0
Declining
0
1
0

Description

An implementation of the Levenshtein distance for Golang

Programming language: Go
License: MIT License
Tags: Math     Algorithms     Sequences    

golang levenshtein alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view golang levenshtein alternatives based on common mentions on social networks and blogs.

Do you think we are missing an alternative of golang levenshtein or a related project?

Add another 'Data Structures' Package

README

levenshtein

An implementation of the Levenshtein distance for Golang

Sources

Levenshtein distance

Golang

Install

go get github.com/gitchander/levenshtein

Examples

package main

import (
    "fmt"

    lev "github.com/gitchander/levenshtein"
)

func main() {
    var (
        a = "exponential"
        b = "polynomial"
    )
    distance := lev.Strings(a, b)
    fmt.Printf("the levenshtein distance between %q and %q = %d\n", a, b, distance)
}

result:

the levenshtein distance between "exponential" and "polynomial" = 6

Example the distance by words:

package main

import (
    "fmt"
    "strings"

    lev "github.com/gitchander/levenshtein"
)

func main() {
    var (
        line1 = "one two three four"
        line2 = "one two three"
    )
    var (
        a = strings.Split(line1, " ")
        b = strings.Split(line2, " ")
    )
    distance := lev.Distance(lev.StringSlices{a, b})
    fmt.Printf("the levenshtein distance between %q and %q = %d\n", a, b, distance)
}

result:

the levenshtein distance between ["one" "two" "three" "four"] and ["one" "two" "three"] = 1

Example with print matrix:

package main

import (
    "fmt"

    lev "github.com/gitchander/levenshtein"
)

func main() {
    var (
        a = []rune("sitting")
        b = []rune("kitten")
    )
    costs := lev.DefaultCosts
    fmt.Print(lev.PrintableMatrix(costs, a, b, ""))
}

result:

. . k i t t e n 
. 0 1 2 3 4 5 6 
s 1 1 2 3 4 5 6 
i 2 2 1 2 3 4 5 
t 3 3 2 1 2 3 4 
t 4 4 3 2 1 2 3 
i 5 5 4 3 2 2 3 
n 6 6 5 4 3 3 2 
g 7 7 6 5 4 4 3 

Example the distance by interfaces:

package main

import (
    "fmt"

    lev "github.com/gitchander/levenshtein"
)

func main() {
    var (
        a = []Person{{"one", 1}, {"two", 2}, {"three", 3}, {"four", 4}}
        b = []Person{{"one", 1}, {"two", 2}, {"three", 3}}
    )
    distance := lev.Distance(PersonSlices{a, b})
    fmt.Printf("the levenshtein distance = %d\n", distance)
}

type Person struct {
    Name string
    Age  int
}

type PersonSlices [2][]Person

var _ lev.Interface = PersonSlices{}

func (p PersonSlices) Len(k int) int {
    return len(p[k])
}

func (p PersonSlices) Match(i, j int) bool {
    return p[0][i] == p[1][j]
}

result:

the levenshtein distance = 1