Online Tool

Levenshtein Distance Algorithm

Submit two text strings to see how they match with the Levenschtein distance algorithm. No registration. No logging.


What Is The 

Levenshtein Distance Algorithm?

The Levenshtein distance algorithm is a way to measure the difference between two strings of text. It is also known as the edit distance, because it calculates the minimum number of operations needed to transform one string into the other. This can be useful in a variety of applications, such as spelling correction and natural language processing.

At Tilores we use the Levenshtein distance algorithm as one of the potential data record matching algorithms for entity resolution. These can be combined with other matching algorithms to allow fine-tuned data matching and deduplication. 

More reading about Levenshtein Distance algorithm (Wikipedia)


Fuzzy Matching Algorithm Tools

Unlock the value trapped in your messy, inconsistent and duplicate-riddled data. Let Tilores be your data "source of truth". 

Compare all

Compare Fuzzy Matching Algorithms

Other Fuzzy Matching Algorithm Tools

Are we missing a fuzzy matching algorithm you would like to test?



When you need to do fuzzy matching on high-volume data in real-time, you need a built-for-purpose technology: enter Tilores.

Consistently fast search response times

Built for unlimited serverless scaling

Real-time data ingestion and simultaneous search.

Configure matching rules easily in the UI

Data privacy compliant by design

Identity resolution for fraud prevention, KYC and marketing.

Get the latest updates

©2023 Tilores, All right reserved.