| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alaft (0) - 2 freq aloft (1) - 3 freq 'alaft (1) - 1 freq laft (1) - 27 freq laff (2) - 7 freq aafe (2) - 1 freq await (2) - 7 freq aloat (2) - 8 freq plait (2) - 6 freq flaff (2) - 5 freq alain (2) - 8 freq aat (2) - 852 freq avast (2) - 3 freq plant (2) - 82 freq aaf (2) - 23 freq slapt (2) - 2 freq alamo (2) - 2 freq haft (2) - 2 freq blatt (2) - 2 freq aflawt (2) - 1 freq aafu (2) - 14 freq clatt (2) - 5 freq alert (2) - 17 freq alarmt (2) - 3 freq last (2) - 1875 freq |
alaft (0) - 2 freq laft (1) - 27 freq aloft (1) - 3 freq laift (2) - 1 freq loft (2) - 13 freq lift (2) - 496 freq lyft (2) - 2 freq left (2) - 1592 freq 'alaft (2) - 1 freq luft (2) - 2 freq lft (2) - 2 freq laf (3) - 1 freq aalt (3) - 2 freq cleft (3) - 5 freq alt (3) - 5 freq alset (3) - 1 freq waaft (3) - 1 freq leift (3) - 1 freq clift (3) - 3 freq oaft (3) - 6 freq waft (3) - 9 freq soaft (3) - 2 freq lart (3) - 1 freq ooaft (3) - 2 freq alunt (3) - 1 freq |
SoundEx code - A413 alaft - 2 freq alfdi - 1 freq alleviated - 1 freq 'alaft - 1 freq aloft - 3 freq albeit - 6 freq alleviatit - 1 freq albeid - 1 freq alfieheydrich - 1 freq alloftheabove - 1 freq alba-the - 1 freq |
MetaPhone code - ALFT alaft - 2 freq alfdi - 1 freq alight - 3 freq 'alaft - 1 freq aloft - 3 freq |
ALAFT |
| Time to execute Levenshtein function - 0.206098 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.438381 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.028371 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.039077 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.000941 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. |