| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ill-afford (0) - 1 freq ill-aff (3) - 6 freq ill-informed (4) - 1 freq ill-faurt (4) - 1 freq 'afford (4) - 1 freq ill-fed (4) - 1 freq clifford (4) - 1 freq wallayford (4) - 1 freq trafford (4) - 1 freq afford (4) - 85 freq ill-aboot (4) - 1 freq ill-faured (4) - 9 freq ill-fated (4) - 1 freq crawford (5) - 5 freq ill-wulled (5) - 1 freq ill-naiter (5) - 1 freq alford (5) - 4 freq ill-humour (5) - 1 freq blaffert (5) - 1 freq wallyford (5) - 12 freq ill-natur (5) - 1 freq ill-staured (5) - 1 freq ill-turn (5) - 1 freq ill-mainered (5) - 2 freq tullyford (5) - 1 freq |
ill-afford (0) - 1 freq ill-faured (5) - 9 freq ill-aff (5) - 6 freq clifford (6) - 1 freq ill-fated (6) - 1 freq ill-fed (6) - 1 freq ill-favoured (6) - 2 freq ill-informed (6) - 1 freq ill-faurt (6) - 1 freq ill-fitted (7) - 1 freq ill-waured (7) - 1 freq ill-staured (7) - 1 freq ill-naitured (7) - 1 freq ill-bred (7) - 2 freq ill-naitered (7) - 1 freq ill-farrand (7) - 1 freq ill-mainered (7) - 2 freq weill-faurd (7) - 1 freq wallayford (7) - 1 freq 'afford (7) - 1 freq trafford (7) - 1 freq afford (7) - 85 freq ill-doers (8) - 1 freq linford (8) - 1 freq letford (8) - 1 freq |
SoundEx code - I416 ill-faured - 9 freq ill-faurt - 1 freq ill-prepared - 1 freq ill-faurrant - 2 freq ill-bredness - 1 freq ill-bred - 2 freq ill-burnan - 1 freq ill-afford - 1 freq ill-pairtit - 2 freq ill-farrand - 1 freq ill-farrant - 1 freq illiberal - 1 freq |
MetaPhone code - ILFRT ill-faured - 9 freq ill-faurt - 1 freq ill-afford - 1 freq |
ILL-AFFORD |
| Time to execute Levenshtein function - 0.230316 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.394286 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.027809 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.040492 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.000847 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. |