| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zoomer (0) - 3 freq zoomed (1) - 2 freq boomer (1) - 1 freq zoomers (1) - 2 freq zoomen (1) - 2 freq pooer (2) - 159 freq boomers (2) - 1 freq pooder (2) - 49 freq toomed (2) - 2 freq zoomin (2) - 6 freq coomed (2) - 1 freq cooler (2) - 12 freq pooper (2) - 1 freq zoom (2) - 19 freq former (2) - 38 freq looker (2) - 8 freq ooter (2) - 25 freq wooer (2) - 3 freq cooser (2) - 3 freq boozer (2) - 36 freq ooner (2) - 2 freq dooner (2) - 2 freq jooder (2) - 1 freq poorer (2) - 5 freq pooter (2) - 1 freq |
zoomer (0) - 3 freq zoomen (2) - 2 freq zoomers (2) - 2 freq boomer (2) - 1 freq zoomed (2) - 2 freq zoomin (3) - 6 freq zimmer (3) - 3 freq zoom (3) - 19 freq comer (3) - 4 freq homer (3) - 1 freq sooner (4) - 29 freq soomed (4) - 7 freq elmer (4) - 2 freq timer (4) - 6 freq sooker (4) - 2 freq moore (4) - 2 freq dooter (4) - 3 freq groomer (4) - 1 freq hoover (4) - 18 freq colmer (4) - 1 freq alomar (4) - 1 freq tooter (4) - 4 freq looser (4) - 2 freq boomed (4) - 8 freq beamer (4) - 12 freq |
SoundEx code - Z560 zimmer - 3 freq zoomer - 3 freq znorway - 1 freq |
MetaPhone code - SMR smirr - 39 freq simmer - 309 freq smoor - 28 freq summer - 196 freq smear - 2 freq smaa-er - 2 freq cymru - 5 freq smore - 7 freq zimmer - 3 freq sombre - 6 freq smaaer - 7 freq zoomer - 3 freq samurai - 7 freq 'simmer - 1 freq samaria - 7 freq sumer - 1 freq smirry - 1 freq summarie - 3 freq sumburgh - 16 freq summur - 1 freq simmir - 1 freq smuir - 4 freq smora - 1 freq sma'er - 2 freq smur - 3 freq summer' - 1 freq smoar - 1 freq summ'ry - 1 freq smaer - 3 freq summary - 3 freq sma-er - 1 freq smaar - 2 freq suimmer - 1 freq €˜simmer - 1 freq €œsmirr - 1 freq smaÂ’er - 1 freq xmur - 1 freq |
ZOOMER |
| Time to execute Levenshtein function - 0.185718 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.316897 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.027309 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.037748 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.000787 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. |