Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yleflz (0) - 1 freq glegly (3) - 18 freq leal- (3) - 1 freq left' (3) - 2 freq yelly (3) - 12 freq yerl (3) - 1 freq ye'll (3) - 962 freq ye'l (3) - 21 freq yelp (3) - 20 freq yella (3) - 130 freq weefla (3) - 47 freq yiel (3) - 1 freq leaz (3) - 1 freq blekly (3) - 1 freq yellt (3) - 4 freq yeel (3) - 10 freq ylmz (3) - 1 freq 'leal (3) - 1 freq yield (3) - 16 freq yeil (3) - 1 freq ypgfl (3) - 1 freq plenly (3) - 1 freq yle (3) - 2 freq efl (3) - 2 freq left (3) - 1591 freq |
yleflz (0) - 1 freq lulz (4) - 1 freq vefz (5) - 1 freq yell (5) - 57 freq leal (5) - 43 freq lefty (5) - 2 freq efl (5) - 2 freq lenz (5) - 6 freq waelz (5) - 1 freq left (5) - 1591 freq leil (5) - 5 freq yllzp (5) - 1 freq leill (5) - 1 freq lgfz (5) - 1 freq lef (5) - 7 freq leaflet (5) - 11 freq lefe (5) - 1 freq lekly (5) - 2 freq yells (5) - 10 freq weefla (5) - 47 freq leaz (5) - 1 freq yella (5) - 130 freq yelly (5) - 12 freq leal- (5) - 1 freq yellt (5) - 4 freq |
SoundEx code - Y414 yellow-fleshed - 1 freq yella-bellied - 1 freq yella-flooer't - 1 freq yole-pulls - 1 freq yleflz - 1 freq |
MetaPhone code - LFLS leafless - 4 freq levels - 66 freq luveless - 1 freq loveless - 1 freq lifeless - 7 freq luvlies - 1 freq levels' - 1 freq lugholes - 1 freq leevils - 1 freq leevels - 1 freq levils - 1 freq yleflz - 1 freq levels - 1 freq loopholes - 1 freq |
YLEFLZ |
Time to execute Levenshtein function - 0.213638 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.358154 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.028462 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.040212 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.000957 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. |