| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quick-lachin (0) - 1 freq lauch-lauchin (5) - 1 freq squallachin (5) - 2 freq quicksaun (5) - 2 freq quicklie (5) - 2 freq buik-lairnin (5) - 1 freq quick-like (5) - 2 freq quickenin (5) - 1 freq thick-lasht (5) - 1 freq hauf-lachin (5) - 1 freq stick-thin (5) - 1 freq buik-lair (5) - 1 freq quicksan (5) - 1 freq bricklayin (5) - 1 freq quicken (6) - 4 freq quait-lippin (6) - 1 freq hucklin (6) - 2 freq mollachin (6) - 1 freq time-machine (6) - 1 freq queer-luikin (6) - 1 freq backpackin (6) - 1 freq duck-face (6) - 1 freq quick-smert (6) - 2 freq sick-making (6) - 1 freq bracklach's (6) - 1 freq |
quick-lachin (0) - 1 freq lauch-lauchin (7) - 1 freq hauf-lachin (8) - 1 freq quick-like (8) - 2 freq back-lyin (9) - 1 freq stick-thin (9) - 1 freq claichin (9) - 1 freq clachan (9) - 101 freq hauf-lauchin (9) - 1 freq quicksan (9) - 1 freq thick-lasht (9) - 1 freq quicksaun (9) - 2 freq squallachin (9) - 2 freq buik-lairnin (9) - 1 freq quicklie (9) - 2 freq quickenin (9) - 1 freq pick-black (10) - 1 freq bucklin (10) - 7 freq clathin (10) - 1 freq clackin (10) - 15 freq ticklin (10) - 6 freq €œlachin (10) - 1 freq quickly (10) - 191 freq clatchin (10) - 1 freq back-comin (10) - 1 freq |
SoundEx code - Q242 quick-lachin - 1 freq quick-like - 2 freq |
MetaPhone code - KKLXN quick-lachin - 1 freq |
QUICK-LACHIN |
| Time to execute Levenshtein function - 0.233087 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.482900 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.027960 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.074983 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.000942 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. |