| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aplift (0) - 1 freq uplift (1) - 5 freq apairt (2) - 197 freq clift (2) - 3 freq alaft (2) - 2 freq lift (2) - 490 freq aflist (2) - 1 freq split (2) - 74 freq alist (2) - 2 freq splint (2) - 1 freq uplifts (2) - 1 freq aloft (2) - 3 freq spliff (2) - 8 freq plist (2) - 1 freq airlift (2) - 1 freq adrift (2) - 9 freq aift (2) - 14 freq amplify (2) - 2 freq 'lift (2) - 2 freq lliot (3) - 1 freq liet (3) - 4 freq spoilt (3) - 15 freq aist (3) - 21 freq alloot (3) - 4 freq ploat (3) - 1 freq |
aplift (0) - 1 freq uplift (1) - 5 freq aloft (3) - 3 freq airlift (3) - 1 freq 'lift (3) - 2 freq uplifts (3) - 1 freq plist (3) - 1 freq alaft (3) - 2 freq clift (3) - 3 freq lift (3) - 490 freq polist (4) - 4 freq plant (4) - 82 freq plet (4) - 4 freq plunt (4) - 6 freq lifit (4) - 2 freq pleat (4) - 5 freq pliant (4) - 1 freq plinty (4) - 32 freq left (4) - 1563 freq pfft (4) - 3 freq plot (4) - 38 freq laft (4) - 26 freq aplate (4) - 1 freq pluff (4) - 4 freq pufft (4) - 3 freq |
SoundEx code - A141 aipple-boxes - 1 freq available - 126 freq availabil - 1 freq aplift - 1 freq able-bodied - 2 freq avaelable - 2 freq availability - 5 freq auobalba - 13 freq appleby - 2 freq appeleby - 1 freq abailable - 1 freq 'available - 1 freq |
MetaPhone code - APLFT aplift - 1 freq |
APLIFT |
| Time to execute Levenshtein function - 0.299325 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.403948 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.033237 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.045675 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.000834 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. |