| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| auld-farrant (0) - 37 freq auld-farrand (1) - 2 freq auld-faurrant (1) - 3 freq aul-farrant (1) - 4 freq oul-farrant (2) - 1 freq 'auldfarrant (2) - 1 freq aal-farrant (2) - 3 freq auldfarran (2) - 1 freq aulfarrent (3) - 1 freq ill-farrant (3) - 1 freq new-farrant (4) - 4 freq €™aal-farrant (4) - 1 freq fair-farrant (4) - 1 freq ill-farrand (4) - 1 freq ill-faurrant (4) - 2 freq auldearn (5) - 1 freq auld-warldy (5) - 1 freq ull-fashent (5) - 1 freq unfarrent (5) - 1 freq auld-warld (5) - 2 freq farrant (5) - 21 freq faur-forrit (6) - 1 freq cauld-fit (6) - 1 freq bulgarian (6) - 1 freq flagrant (6) - 1 freq |
auld-farrant (0) - 37 freq auld-faurrant (1) - 3 freq auld-farrand (2) - 2 freq aul-farrant (2) - 4 freq aal-farrant (3) - 3 freq oul-farrant (3) - 1 freq ill-farrant (4) - 1 freq auldfarran (4) - 1 freq 'auldfarrant (4) - 1 freq ill-faurrant (5) - 2 freq aulfarrent (5) - 1 freq new-farrant (6) - 4 freq ill-farrand (6) - 1 freq fair-farrant (6) - 1 freq €™aal-farrant (7) - 1 freq farrant (8) - 21 freq unfarrent (8) - 1 freq ull-fashent (8) - 1 freq redcurrant (9) - 1 freq wud-feart (9) - 1 freq auldearn (9) - 1 freq auld-fashioned (9) - 1 freq durrant (9) - 2 freq farrent (9) - 1 freq ill-faurt (9) - 1 freq |
SoundEx code - A431 auld-farrand - 2 freq auld-farrant - 37 freq 'auldfarrant - 1 freq auld-faurrant - 3 freq aldeberan - 1 freq auldwife - 1 freq auldfaither - 1 freq auldfarran - 1 freq aldivalloch - 5 freq allthebest - 1 freq alidupont - 1 freq auld-fashioned - 1 freq |
MetaPhone code - ALTFRNT auld-farrand - 2 freq auld-farrant - 37 freq 'auldfarrant - 1 freq auld-faurrant - 3 freq |
AULD-FARRANT |
| Time to execute Levenshtein function - 0.574716 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 - 1.107771 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.088596 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.099096 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.001033 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. |