| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aul-farrant (0) - 4 freq aal-farrant (1) - 3 freq oul-farrant (1) - 1 freq auld-farrant (1) - 37 freq ill-farrant (2) - 1 freq auld-farrand (2) - 2 freq aulfarrent (2) - 1 freq 'auldfarrant (2) - 1 freq auldfarran (2) - 1 freq auld-faurrant (2) - 3 freq new-farrant (3) - 4 freq ill-faurrant (3) - 2 freq ill-farrand (3) - 1 freq €™aal-farrant (3) - 1 freq fair-farrant (3) - 1 freq unfarrent (4) - 1 freq farrant (4) - 21 freq ill-faurt (5) - 1 freq farrent (5) - 1 freq faur-forrit (5) - 1 freq flagrant (5) - 1 freq carrant (5) - 2 freq unfragrant (5) - 1 freq aul-man (5) - 4 freq haun-barrae (5) - 1 freq |
aul-farrant (0) - 4 freq oul-farrant (1) - 1 freq aal-farrant (1) - 3 freq auld-farrant (2) - 37 freq aulfarrent (3) - 1 freq ill-farrant (3) - 1 freq auld-faurrant (3) - 3 freq ill-faurrant (4) - 2 freq auld-farrand (4) - 2 freq auldfarran (4) - 1 freq 'auldfarrant (4) - 1 freq fair-farrant (5) - 1 freq €™aal-farrant (5) - 1 freq new-farrant (5) - 4 freq ill-farrand (5) - 1 freq farrant (6) - 21 freq unfarrent (6) - 1 freq farrent (7) - 1 freq warrant (8) - 19 freq laarant (8) - 1 freq weel-forrit (8) - 6 freq earrant (8) - 1 freq life-rent (8) - 1 freq furrent (8) - 2 freq ferranti (8) - 2 freq |
SoundEx code - A416 aal-farrant - 3 freq 'albert - 1 freq aulfarrent - 1 freq alfresco - 3 freq albrecht - 1 freq aul-farrant - 4 freq alfred - 12 freq albert - 25 freq albert's - 2 freq allover - 3 freq alberto - 2 freq alberta - 1 freq €™aal-farrant - 1 freq alford - 4 freq albertz - 4 freq albertina - 1 freq alfordbrad - 32 freq allfreezehahahahahaha - 1 freq allforaurora - 2 freq alfrescodent - 1 freq albertkirkjr - 1 freq |
MetaPhone code - ALFRNT aal-farrant - 3 freq aulfarrent - 1 freq aul-farrant - 4 freq €™aal-farrant - 1 freq |
AUL-FARRANT |
| Time to execute Levenshtein function - 0.197464 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.383722 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.034276 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.045073 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.000963 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. |