Awesome Open Source

Programming Languages

Search results for levenshtein distance longest common subsequence

levenshtein-distance x

longest-common-subsequence x

4 search results found

Stringdistance ⭐ 57

A fuzzy matching string distance library for Scala and Java that includes Levenshtein distance, Jaro distance, Jaro-Winkler distance, Dice coefficient, N-Gram similarity, Cosine similarity, Jaccard similarity, Longest common subsequence, Hamming distance, and more..

Stringoperations ⭐ 14

Implementation of some known string algorithmn and data structures like: Rope, Trie, Knuth Morris Pratt, Boyer Moore, Levenshtein

Stringcomparison ⭐ 9

String Comparision in C#.NET

Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.

Related Searches

Python Levenshtein Distance (90)

Javascript Levenshtein Distance (60)

Algorithms Levenshtein Distance (57)

Similarity Levenshtein Distance (44)

C Levenshtein Distance (27)

Java Levenshtein Distance (25)

C Sharp Levenshtein Distance (19)

Diff Levenshtein Distance (13)

Trie Levenshtein Distance (12)

Levenshtein Distance Jaro Winkler (12)

1-4 of 4 search results

Privacy | About | Terms | Follow Us On Twitter

Copyright 2018-2024 Awesome Open Source. All rights reserved.