| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ill-faurrant (0) - 2 freq ill-farrant (1) - 1 freq ill-farrand (2) - 1 freq ill-faurt (3) - 1 freq auld-faurrant (3) - 3 freq oul-farrant (3) - 1 freq aal-farrant (3) - 3 freq aul-farrant (3) - 4 freq new-farrant (4) - 4 freq auld-farrant (4) - 37 freq ill-faured (4) - 9 freq ill-burnan (4) - 1 freq ill-fun (5) - 1 freq auldfarran (5) - 1 freq ill-waured (5) - 1 freq fair-farrant (5) - 1 freq blackcurrant (5) - 5 freq auld-farrand (5) - 2 freq ill-pairtit (5) - 2 freq €™aal-farrant (5) - 1 freq ill-naturet (5) - 5 freq ill-turn (5) - 1 freq ull-fashent (5) - 1 freq aulfarrent (5) - 1 freq ill-thraan (5) - 1 freq |
ill-faurrant (0) - 2 freq ill-farrant (1) - 1 freq ill-farrand (3) - 1 freq aul-farrant (4) - 4 freq oul-farrant (4) - 1 freq aal-farrant (4) - 3 freq auld-faurrant (4) - 3 freq ill-faurt (5) - 1 freq auld-farrant (5) - 37 freq new-farrant (6) - 4 freq auld-farrand (7) - 2 freq €™aal-farrant (7) - 1 freq aulfarrent (7) - 1 freq fair-farrant (7) - 1 freq ill-faured (7) - 9 freq 'auldfarrant (7) - 1 freq ull-fashent (7) - 1 freq ill-burnan (7) - 1 freq ill-naturit (8) - 1 freq farrant (8) - 21 freq ill-thraan (8) - 1 freq ill-pairtit (8) - 2 freq ill-turn (8) - 1 freq auldfarran (8) - 1 freq ill-fun (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 - ILFRNT ill-faurrant - 2 freq ill-farrand - 1 freq ill-farrant - 1 freq |
ILL-FAURRANT |
| Time to execute Levenshtein function - 0.216937 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.383066 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.028154 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.046042 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.000995 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. |