| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ollie (0) - 7 freq collie (1) - 27 freq onlie (1) - 102 freq tollie (1) - 3 freq ellie (1) - 7 freq follie (1) - 8 freq dollie (1) - 1 freq allie (1) - 9 freq illie (1) - 2 freq oldie (1) - 2 freq mollie (1) - 16 freq rollie (1) - 3 freq lollies (2) - 2 freq coallie (2) - 4 freq collies (2) - 1 freq jellie (2) - 2 freq pilie (2) - 1 freq woolie (2) - 1 freq belie (2) - 2 freq colline (2) - 1 freq follae (2) - 172 freq allyie (2) - 1 freq folliet (2) - 7 freq hellie (2) - 1 freq oyle (2) - 3 freq |
ollie (0) - 7 freq illie (1) - 2 freq allie (1) - 9 freq ellie (1) - 7 freq aillie (2) - 1 freq uillie (2) - 1 freq allye (2) - 1 freq lle (2) - 1 freq allyie (2) - 1 freq oll (2) - 1 freq olly (2) - 6 freq rollie (2) - 3 freq follie (2) - 8 freq tollie (2) - 3 freq onlie (2) - 102 freq collie (2) - 27 freq dollie (2) - 1 freq oldie (2) - 2 freq mollie (2) - 16 freq hallie (3) - 1 freq lallie (3) - 1 freq onli (3) - 40 freq mlle (3) - 1 freq fulie (3) - 1 freq sulie (3) - 1 freq |
SoundEx code - O400 oil - 89 freq oo'll - 14 freq owl - 61 freq 'oo'll - 1 freq oily - 7 freq ol - 5 freq oul - 338 freq oyl - 2 freq ollie - 7 freq oil' - 1 freq oiyle - 1 freq oyle - 3 freq oul' - 8 freq 'ola' - 1 freq ola - 1 freq oil- - 1 freq ole - 2 freq oll - 1 freq oo-wheel - 1 freq oh-lay - 3 freq ool - 8 freq ol - 1 freq oo'l - 1 freq olly - 6 freq oaohl - 1 freq oulii - 1 freq |
MetaPhone code - OL oil - 89 freq oo'll - 14 freq owl - 61 freq 'oo'll - 1 freq oily - 7 freq ol - 5 freq oul - 338 freq oyl - 2 freq ollie - 7 freq oil' - 1 freq oiyle - 1 freq oyle - 3 freq oul' - 8 freq 'ola' - 1 freq ola - 1 freq oil- - 1 freq ole - 2 freq oll - 1 freq oh-lay - 3 freq ool - 8 freq ol - 1 freq oo'l - 1 freq olly - 6 freq oaohl - 1 freq oulii - 1 freq |
OLLIE |
| Time to execute Levenshtein function - 0.216175 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.352831 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.027288 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.036413 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.000796 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. |