Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in levenshtein-distance

Haskell tail-recursion performance question for Levenshtein distances

How do you test if two hashes (passwords) are similar?

two whole texts similarity using levenshtein distance [closed]

Fuzzy string-matching that can "skip"? e.g. "i am (.*)." has 0 distance to "I am here."

Multiple sequence comparison of arbitrary string with oriented characters

What is the fastest levenshtein algorithm for high frequent use [duplicate]

Is it possible that the SequenceMatcher in Python's difflib could provide a more efficient way to calculate Levenshtein distance?

How is Levenshtein Distance calculated on Simplified Chinese characters?

levenshtein alternative

Make Levenstein's Distance algorithm fit my needs

Levenshtein search

Alternative to Levenshtein distance for prefixes / suffixes

Levenshtein Matrix using only a diagonal strip

OCR: weighted Levenshtein distance

How can I find the best fit subsequences of a large string?

Problem with adist function in text comparison

Speeding up levenshtein / similar_text in PHP

Is it possible to calucate the edit distance between a regexp and a string?

How to find string similar to 2 other strings (in terms of Levenshtein distance)?