| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owers (0) - 2 freq mowers (1) - 1 freq towers (1) - 19 freq owners (1) - 19 freq owes (1) - 4 freq rowers (1) - 3 freq lowers (1) - 7 freq ower- (1) - 1 freq ower's (1) - 2 freq dowers (1) - 1 freq ower' (1) - 1 freq overs (1) - 2 freq ower (1) - 6285 freq fowers (1) - 7 freq bowers (1) - 1 freq owens (1) - 3 freq ooers (1) - 11 freq powers (1) - 16 freq wears (2) - 55 freq twerp (2) - 1 freq towert (2) - 1 freq fiers (2) - 6 freq flowers (2) - 15 freq power's (2) - 1 freq wern (2) - 1 freq |
owers (0) - 2 freq wears (2) - 55 freq weers (2) - 16 freq powers (2) - 16 freq ooers (2) - 11 freq bowers (2) - 1 freq wurs (2) - 3 freq fowers (2) - 7 freq owersee (2) - 2 freq aweers (2) - 1 freq wars (2) - 61 freq wirs (2) - 4 freq weirs (2) - 25 freq owens (2) - 3 freq ower (2) - 6285 freq towers (2) - 19 freq ower- (2) - 1 freq lowers (2) - 7 freq rowers (2) - 3 freq owners (2) - 19 freq ower's (2) - 2 freq mowers (2) - 1 freq overs (2) - 2 freq ower' (2) - 1 freq dowers (2) - 1 freq |
SoundEx code - O620 oors - 357 freq or's - 1 freq oars - 25 freq owerreach - 1 freq owersee - 2 freq ours - 16 freq oors' - 2 freq ooers - 11 freq oor's - 6 freq orras - 1 freq 'oors - 18 freq orra's - 1 freq orr's - 4 freq ower-uiss - 2 freq orgy - 1 freq ower's - 2 freq ¬‚ooers - 1 freq oweruiss - 1 freq 'ork' - 1 freq owresee - 2 freq ower-rax - 1 freq origo - 1 freq ower-uise - 1 freq org - 26 freq owers - 2 freq orig - 1 freq €˜oors - 9 freq ooirs - 2 freq owersaw - 1 freq oorichie - 1 freq oreos - 1 freq orca - 7 freq ooihrox - 3 freq ork - 2 freq |
MetaPhone code - OWRS owersee - 2 freq ower-uiss - 2 freq ower's - 2 freq oweruiss - 1 freq ower-uise - 1 freq owers - 2 freq owersaw - 1 freq |
OWERS |
| Time to execute Levenshtein function - 0.235710 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.389092 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.028304 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.039459 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.000861 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. |