Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ollie (0) - 7 freq mollie (1) - 16 freq tollie (1) - 3 freq illie (1) - 2 freq collie (1) - 27 freq onlie (1) - 102 freq oldie (1) - 2 freq follie (1) - 8 freq ellie (1) - 7 freq dollie (1) - 1 freq rollie (1) - 4 freq allie (1) - 9 freq lollin (2) - 2 freq sellie (2) - 2 freq callie (2) - 1 freq online (2) - 143 freq godlie (2) - 1 freq oyle (2) - 3 freq pilie (2) - 1 freq follies (2) - 8 freq allye (2) - 1 freq gullie (2) - 9 freq ellis (2) - 3 freq eelie (2) - 1 freq billie (2) - 33 freq |
ollie (0) - 7 freq ellie (1) - 7 freq illie (1) - 2 freq allie (1) - 9 freq lle (2) - 1 freq aillie (2) - 1 freq olly (2) - 6 freq allyie (2) - 1 freq allye (2) - 1 freq oll (2) - 1 freq collie (2) - 27 freq mollie (2) - 16 freq oldie (2) - 2 freq onlie (2) - 102 freq follie (2) - 8 freq tollie (2) - 3 freq uillie (2) - 1 freq rollie (2) - 4 freq dollie (2) - 1 freq kellie (3) - 1 freq willie (3) - 197 freq lonlie (3) - 1 freq nellie (3) - 42 freq oolies (3) - 1 freq flie (3) - 9 freq |
SoundEx code - O400 oil - 90 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 - 90 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.247926 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.393214 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.035663 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.038605 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.001162 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. |