| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ower-uiss (0) - 2 freq ower-uise (1) - 1 freq oweruiss (1) - 1 freq owercaist (3) - 2 freq ower-time (3) - 1 freq ower-ying (3) - 1 freq ower-cosy (3) - 1 freq ower-suin (3) - 1 freq owerbuird (3) - 1 freq owerhails (3) - 1 freq ower-ripe (3) - 1 freq owercums (3) - 9 freq owerluikt (3) - 1 freq owerluik (3) - 2 freq owerins (3) - 1 freq fowerties (4) - 1 freq excuiss (4) - 3 freq owerlaps (4) - 2 freq owerluikit (4) - 2 freq owerfest (4) - 1 freq owerflows (4) - 1 freq owersetts (4) - 1 freq fower-fit (4) - 1 freq owergien (4) - 1 freq owerclose (4) - 1 freq |
ower-uiss (0) - 2 freq oweruiss (2) - 1 freq ower-uise (2) - 1 freq ower-suin (4) - 1 freq ower-cosy (4) - 1 freq ower-ripe (5) - 1 freq owerins (5) - 1 freq owerseas (5) - 5 freq owerhails (5) - 1 freq owercums (5) - 9 freq ower-time (5) - 1 freq owerseys (5) - 8 freq ower-ying (5) - 1 freq owercaist (5) - 2 freq ower's (6) - 2 freq wee-ness (6) - 1 freq owersets (6) - 5 freq weiss (6) - 2 freq owreseas (6) - 4 freq wyreless (6) - 4 freq ower-come (6) - 1 freq owerances (6) - 1 freq owercomes (6) - 8 freq ower-run (6) - 2 freq owers (6) - 2 freq |
SoundEx code - O620 oors - 353 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 - 9 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 |
OWER-UISS |
| Time to execute Levenshtein function - 0.222224 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.353977 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.028056 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.037925 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.000847 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. |