| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oul-farrant (0) - 1 freq aul-farrant (1) - 4 freq auld-farrant (2) - 37 freq aal-farrant (2) - 3 freq ill-farrant (2) - 1 freq auld-faurrant (3) - 3 freq aulfarrent (3) - 1 freq auld-farrand (3) - 2 freq 'auldfarrant (3) - 1 freq ill-faurrant (3) - 2 freq new-farrant (3) - 4 freq auldfarran (3) - 1 freq ill-farrand (3) - 1 freq farrant (4) - 21 freq unfarrent (4) - 1 freq fair-farrant (4) - 1 freq €™aal-farrant (4) - 1 freq earrant (5) - 1 freq carrant (5) - 2 freq ull-fashent (5) - 1 freq laarant (5) - 1 freq unfragrant (5) - 1 freq bulgarian (5) - 1 freq durrant (5) - 2 freq ill-faurt (5) - 1 freq |
oul-farrant (0) - 1 freq aul-farrant (1) - 4 freq aal-farrant (2) - 3 freq ill-farrant (3) - 1 freq auld-farrant (3) - 37 freq ill-faurrant (4) - 2 freq aulfarrent (4) - 1 freq auld-faurrant (4) - 3 freq auldfarran (5) - 1 freq new-farrant (5) - 4 freq ill-farrand (5) - 1 freq 'auldfarrant (5) - 1 freq auld-farrand (5) - 2 freq €™aal-farrant (6) - 1 freq fair-farrant (6) - 1 freq unfarrent (6) - 1 freq farrant (6) - 21 freq farrent (7) - 1 freq courrant (8) - 1 freq warrant (8) - 19 freq currant (8) - 4 freq weel-forrit (8) - 6 freq ferranti (8) - 2 freq furrent (8) - 2 freq life-rent (8) - 1 freq |
SoundEx code - O416 oliver - 10 freq oul-farrant - 1 freq olivermundell - 2 freq olivierÂ’s - 1 freq olphrmze - 1 freq oliver's - 1 freq |
MetaPhone code - OLFRNT oul-farrant - 1 freq |
OUL-FARRANT |
| Time to execute Levenshtein function - 0.226481 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.452867 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.035723 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.043655 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.000997 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. |