| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| come-ower (0) - 1 freq vyce-ower (3) - 1 freq composer (3) - 3 freq roll-ower (3) - 1 freq oot-ower (3) - 1 freq commoner (3) - 3 freq out-ower (3) - 1 freq hameower (3) - 3 freq byde-ower (3) - 1 freq cross-ower (3) - 1 freq componer (3) - 6 freq coupower (3) - 1 freq someither (4) - 1 freq empower (4) - 2 freq comeen (4) - 1 freq compiler (4) - 2 freq sleep-ower (4) - 1 freq makeower (4) - 1 freq commoners (4) - 1 freq somewey (4) - 43 freq commone (4) - 2 freq comelie (4) - 2 freq someones (4) - 1 freq cooer (4) - 1 freq in-ower (4) - 1 freq |
come-ower (0) - 1 freq hameower (5) - 3 freq byde-ower (5) - 1 freq coupower (5) - 1 freq out-ower (5) - 1 freq componer (5) - 6 freq kaim-ower (5) - 1 freq commoner (5) - 3 freq vyce-ower (5) - 1 freq composer (5) - 3 freq oot-ower (5) - 1 freq come-ups (6) - 1 freq in-ower (6) - 1 freq tak-ower (6) - 1 freq commuter (6) - 1 freq comfor (6) - 1 freq cower (6) - 12 freq luk-ower (6) - 4 freq win-ower (6) - 1 freq comer (6) - 4 freq mower (6) - 15 freq i'mower (6) - 1 freq icedower (6) - 1 freq makeower (6) - 1 freq compeer (6) - 1 freq |
SoundEx code - C560 canary - 14 freq c'mere - 7 freq chaumer - 117 freq camera - 57 freq comer - 4 freq cinner - 1 freq caumer - 1 freq cummer - 6 freq 'c'mere' - 1 freq cymru - 5 freq canner - 1 freq come-ower - 1 freq conrie - 1 freq ceannmor - 4 freq commer - 1 freq comrie - 1 freq chamour - 1 freq cannier - 1 freq 'c'mere - 2 freq conneree - 1 freq cunnar - 1 freq cenrre - 1 freq czamer - 1 freq chaamer - 12 freq cannery - 1 freq connor - 5 freq chaummer - 2 freq canaria - 1 freq chinnery - 1 freq connery - 5 freq chimera - 2 freq conor - 10 freq €œconor - 1 freq conner - 2 freq cmuir - 1 freq |
MetaPhone code - KMWR come-ower - 1 freq kaim-ower - 1 freq |
COME-OWER |
| Time to execute Levenshtein function - 0.210793 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.375496 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.028161 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.038700 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.000901 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. |