| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owls (0) - 3 freq gowls (1) - 2 freq sowls (1) - 28 freq bowls (1) - 20 freq rowls (1) - 5 freq powls (1) - 2 freq oyls (1) - 1 freq owns (1) - 13 freq howls (1) - 15 freq owld (1) - 166 freq owes (1) - 4 freq oils (1) - 2 freq yowls (1) - 4 freq owl (1) - 61 freq towls (1) - 1 freq owlds (1) - 1 freq wls (1) - 1 freq fowls (1) - 1 freq owis (1) - 1 freq owild (2) - 3 freq cools (2) - 6 freq sals (2) - 1 freq iws (2) - 1 freq polls (2) - 20 freq bools (2) - 23 freq |
owls (0) - 3 freq wls (1) - 1 freq yowls (1) - 4 freq towls (2) - 1 freq owl (2) - 61 freq owlds (2) - 1 freq owis (2) - 1 freq wels (2) - 5 freq wals (2) - 1 freq oils (2) - 2 freq fowls (2) - 1 freq gowls (2) - 2 freq sowls (2) - 28 freq owes (2) - 4 freq bowls (2) - 20 freq powls (2) - 2 freq rowls (2) - 5 freq owld (2) - 166 freq owns (2) - 13 freq oyls (2) - 1 freq howls (2) - 15 freq eyls (3) - 3 freq eels (3) - 11 freq pools (3) - 19 freq wos (3) - 2 freq |
SoundEx code - O420 oiles - 1 freq oils - 2 freq ologie - 1 freq oolies - 1 freq oyls - 1 freq olways - 1 freq olso - 1 freq olga - 1 freq olick - 1 freq owls - 3 freq oholoos - 1 freq owls - 1 freq olscy - 1 freq owaalqoh - 1 freq |
MetaPhone code - OLS oiles - 1 freq oils - 2 freq oolies - 1 freq oyls - 1 freq olso - 1 freq owls - 3 freq owls - 1 freq olscy - 1 freq |
OWLS |
| Time to execute Levenshtein function - 0.509170 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.863012 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.033945 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.100515 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.000804 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. |