| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| zoomers (0) - 2 freq zoomer (1) - 3 freq boomers (1) - 1 freq ooers (2) - 11 freq sookers (2) - 2 freq dookers (2) - 10 freq tooners (2) - 1 freq zoomed (2) - 2 freq coopers (2) - 1 freq boomer (2) - 1 freq dooters (2) - 2 freq tooers (2) - 6 freq hookers (2) - 2 freq goosers (2) - 2 freq hooers (2) - 2 freq bloomers (2) - 5 freq zoomen (2) - 2 freq too'ers (2) - 1 freq comers (2) - 2 freq hooters (2) - 3 freq boolers (2) - 1 freq pooders (2) - 3 freq dooners (2) - 2 freq coosers (2) - 1 freq boozers (2) - 4 freq |
zoomers (0) - 2 freq boomers (2) - 1 freq zoomer (2) - 3 freq comers (3) - 2 freq pooers (4) - 27 freq haimers (4) - 2 freq footers (4) - 3 freq coosers (4) - 1 freq dooners (4) - 2 freq rimers (4) - 1 freq boozers (4) - 4 freq memers (4) - 1 freq timers (4) - 5 freq moors (4) - 6 freq aumers (4) - 4 freq immers (4) - 2 freq yammers (4) - 3 freq pooders (4) - 3 freq cumers (4) - 1 freq emmers (4) - 4 freq aamers (4) - 1 freq coopers (4) - 1 freq boomer (4) - 1 freq boolers (4) - 1 freq tooers (4) - 6 freq |
SoundEx code - Z562 zoomers - 2 freq |
MetaPhone code - SMRS simmers - 16 freq summer's - 15 freq simmer's - 29 freq smuirs - 3 freq smoors - 6 freq summarise - 1 freq summers - 13 freq simmers' - 1 freq smores - 1 freq smours - 1 freq smirrs - 1 freq zoomers - 2 freq simmers - 1 freq smirr's - 1 freq |
ZOOMERS |
| Time to execute Levenshtein function - 0.215833 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.384716 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.027728 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.046029 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.001357 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. |