| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kobweeyin (0) - 1 freq weeyin (3) - 22 freq obeyin (3) - 1 freq obleegin (3) - 2 freq kweelin (3) - 1 freq cowerin (4) - 5 freq breemin (4) - 1 freq oreegin (4) - 4 freq sweetin (4) - 3 freq lowderin (4) - 1 freq sweerin (4) - 12 freq conveyin (4) - 2 freq beelin (4) - 22 freq beeryin (4) - 1 freq beepin (4) - 3 freq soberin (4) - 2 freq objectin (4) - 1 freq inbreedin (4) - 1 freq kowkin (4) - 1 freq sweelin (4) - 13 freq obleegit (4) - 1 freq bleezin (4) - 77 freq bleedin (4) - 22 freq weedin (4) - 7 freq weetin (4) - 2 freq |
kobweeyin (0) - 1 freq obeyin (5) - 1 freq kweelin (5) - 1 freq weeyin (5) - 22 freq bevyin (6) - 1 freq beein (6) - 14 freq keekin (6) - 126 freq keenin (6) - 10 freq kneedin (6) - 1 freq weein (6) - 1 freq keelin (6) - 1 freq weyin (6) - 3 freq beween (6) - 1 freq lobbyin (6) - 2 freq howein (6) - 1 freq lowein (6) - 1 freq goween (6) - 1 freq knowin (6) - 46 freq bowin (6) - 8 freq knawin (6) - 3 freq sweein (6) - 4 freq keyin (6) - 1 freq beekin (6) - 10 freq sweyin (6) - 5 freq hoween (6) - 1 freq |
SoundEx code - K150 keepin - 213 freq keppin - 10 freq keipin - 2 freq keepin' - 8 freq keepen - 1 freq kevin - 45 freq kippin - 1 freq keepan - 12 freq kpn - 1 freq kevin' - 1 freq kobweeyin - 1 freq |
MetaPhone code - KBWYN kobweeyin - 1 freq |
KOBWEEYIN |
| Time to execute Levenshtein function - 0.330716 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.762378 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.073925 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.037253 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.000799 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. |