| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gatekeepers (0) - 11 freq gatekeeper (1) - 1 freq gamekeepers (1) - 3 freq gamekeeper (2) - 3 freq paecekeepers (3) - 1 freq gemmkeepers (3) - 4 freq goalkeepers (3) - 1 freq gatekeepin (3) - 1 freq gettkeeper (3) - 1 freq passkeeper's (4) - 1 freq gatherers (4) - 1 freq keepers (4) - 16 freq timekeeper (4) - 3 freq goalkeeper (4) - 4 freq shopkeepers (4) - 1 freq goalkeeper's (4) - 1 freq paepers (5) - 2 freq kempers (5) - 2 freq steeers (5) - 1 freq keeper (5) - 44 freq peepers (5) - 6 freq keekers (5) - 3 freq steerers (5) - 1 freq cheepers (5) - 1 freq sleepers (5) - 4 freq |
gatekeepers (0) - 11 freq gamekeepers (2) - 3 freq gatekeeper (2) - 1 freq goalkeepers (4) - 1 freq gamekeeper (4) - 3 freq gatekeepin (5) - 1 freq gettkeeper (5) - 1 freq gemmkeepers (5) - 4 freq paecekeepers (5) - 1 freq goalkeeper's (6) - 1 freq keepers (6) - 16 freq goalkeeper (6) - 4 freq gatherers (6) - 1 freq timekeeper (7) - 3 freq gathers (7) - 3 freq gawkers (7) - 1 freq tempers (7) - 2 freq gaitherers (7) - 2 freq shopkeepers (7) - 1 freq gaiters (8) - 1 freq shoapkeepers (8) - 1 freq gatewyes (8) - 1 freq steeper (8) - 1 freq caterers (8) - 1 freq tweeters (8) - 1 freq |
SoundEx code - G321 gut-sprung - 1 freq gatsby - 1 freq gatekeepers - 11 freq gatekeepin - 1 freq gettkeeper - 1 freq gowdspink - 4 freq guideship - 1 freq gtjpn - 1 freq gydxbtw - 1 freq gdsfc - 1 freq gatekeeper - 1 freq |
MetaPhone code - KTKPRS gatekeepers - 11 freq |
GATEKEEPERS |
| Time to execute Levenshtein function - 0.200024 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.372685 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.027559 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.037771 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.000932 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. |