Light

benfdking / textdistance Goto Github PK

View Code? Open in Web Editor NEW

3.0 3.0 0.0 44 KB

String comparison library written in Go

License: MIT License

Go 97.41% Makefile 2.59%

comparison distance go string textdistance

textdistance's Introduction

textdistance

textdistance is a string comparison library written in Go. Heavily inspired by the identically named Python library, it aims to provide a myriad of different algorithms.

Additionally, it aims to be:

safe for production use, preferring error where required over absolute raw performance
have consistent interfaces in order to test different implementations to enable easy dependency injection
within those constraints being as performant as possible: allowing assembly snippets but no C library links

Documentation

The full documentation with further examples is available at GoDoc.

Usage

Install

go get -u github.com/benfdking/textdistance

Example

package main 

import (
    "fmt"

    "github.com/benfdking/textdistance"
)

func main(){
	h := textdistance.NewHamming()
	distance, _ := h.Distance("drummer", "dresser")
	fmt.Println(distance)
}

textdistance's People

Contributors

Stargazers

Watchers

textdistance's Issues

Write better credits

Give better credit
And rationale behind design choices. Stable>Performance.

Implement All The Edit Based Algorithms

Hamming | Hamming | hamming
MLIPNS | Mlipns | mlipns
Levenshtein | Levenshtein | levenshtein
Damerau-Levenshtein | DamerauLevenshtein | damerau_levenshtein
Jaro-Winkler | JaroWinkler | jaro_winkler, jaro
Strcmp95 | StrCmp95 | strcmp95
Needleman-Wunsch | NeedlemanWunsch | needleman_wunsch
Gotoh | Gotoh | gotoh
Smith-Waterman | SmithWaterman | smith_waterman

Move interfaces to error

To ensure this is used for server, it would be better if it returned errors rather than paniced.

Implement versioning

Implement missing tests

Missing Tests/Benchmarks

MRA Similarity/Distance
Overlap Benchmark
Sorenson Dice Test and Benchmark
SymmetricalTversky Test/Benchmark

Implement Phoenetic algorithms

Making common use of New for each algorithm

Currently some algorithms use the type to initiate and some the New function. Make all use New.

Similarly make the tests new New

Implement compression algorithms

Implement Token algorithms

Better documentation

Examples for each
Explain configuration like word to set

Add linting

Slow Levenshtein Performance

Currently it uses recursive algorithm. This can be sped up.

Implement sequence algorithms

Recommend Projects

React

A declarative, efficient, and flexible JavaScript library for building user interfaces.
Vue.js

🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
Typescript

TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
TensorFlow

An Open Source Machine Learning Framework for Everyone
Django

The Web framework for perfectionists with deadlines.
Laravel

A PHP framework for web artisans
D3

Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

javascript

JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
web

Some thing interesting about web. New door for the world.
server

A server is a program made to process requests and deliver data to clients.
Machine learning

Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Visualization

Some thing interesting about visualization, use data art
Game

Some thing interesting about game, make everyone happy.

Recommend Org

Facebook

We are working to build community through open source technology. NB: members must have two-factor auth.
Microsoft

Open source projects and samples from Microsoft.
Google

Google ❤️ Open Source for everyone.
Alibaba

Alibaba Open Source for everyone
D3

Data-Driven Documents codes.
Tencent

China tencent open source team.