| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| leftley (0) - 3 freq lesley (2) - 18 freq lefty (2) - 2 freq leetle (2) - 2 freq leftie (2) - 1 freq tetley (2) - 1 freq bentley (2) - 4 freq deftly (2) - 1 freq lefe (3) - 1 freq gentler (3) - 4 freq rettled (3) - 1 freq teetle (3) - 10 freq reflex (3) - 2 freq pettled (3) - 1 freq nestle (3) - 2 freq leaflet (3) - 11 freq gentles (3) - 1 freq settler (3) - 1 freq loftier (3) - 2 freq lufted (3) - 5 freq beetles (3) - 2 freq leither (3) - 5 freq saftly (3) - 64 freq lafter (3) - 1 freq loftily (3) - 4 freq |
leftley (0) - 3 freq deftly (3) - 1 freq leftie (3) - 1 freq loftily (3) - 4 freq leetle (3) - 2 freq lefty (3) - 2 freq lyttle (4) - 2 freq leafully (4) - 1 freq lofty (4) - 4 freq saftly (4) - 64 freq lafter (4) - 1 freq lestlie (4) - 3 freq lastly (4) - 5 freq lfted (4) - 1 freq left' (4) - 2 freq left (4) - 1591 freq laetly (4) - 2 freq softly (4) - 12 freq laytly (4) - 1 freq aaftly (4) - 1 freq lifted (4) - 99 freq liftet (4) - 17 freq little (4) - 421 freq lyftet (4) - 2 freq listly (4) - 1 freq |
SoundEx code - L134 loftily - 4 freq leftley - 3 freq lapdul - 1 freq lifetilt - 1 freq |
MetaPhone code - LFTL loftily - 4 freq lightly - 7 freq leftley - 3 freq |
LEFTLEY |
| Time to execute Levenshtein function - 0.202386 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.445071 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027832 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.041897 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000900 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |