| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gemmkeepers (0) - 4 freq gamekeepers (2) - 3 freq gatekeepers (3) - 11 freq goalkeepers (3) - 1 freq gamekeeper (3) - 3 freq gettkeeper (3) - 1 freq paecekeepers (4) - 1 freq gatekeeper (4) - 1 freq keepers (4) - 16 freq goalkeeper's (4) - 1 freq goalkeeper (4) - 4 freq timekeeper (4) - 3 freq shopkeepers (4) - 1 freq shopkeeper (5) - 3 freq peepers (5) - 6 freq sleepers (5) - 4 freq hemmers (5) - 1 freq teampeepee (5) - 9 freq gemme's (5) - 5 freq keeper (5) - 44 freq creepers (5) - 1 freq innkeeper (5) - 1 freq memmers (5) - 41 freq ïnnkeeper (5) - 1 freq gemmell's (5) - 1 freq |
gemmkeepers (0) - 4 freq gamekeepers (3) - 3 freq goalkeepers (5) - 1 freq gamekeeper (5) - 3 freq gatekeepers (5) - 11 freq gettkeeper (6) - 1 freq shopkeepers (7) - 1 freq gimmers (7) - 5 freq goalkeeper (7) - 4 freq timekeeper (7) - 3 freq paecekeepers (7) - 1 freq goalkeeper's (7) - 1 freq gatekeeper (7) - 1 freq keepers (7) - 16 freq gemmel's (8) - 1 freq tempers (8) - 2 freq kempers (8) - 2 freq shoapkeepers (8) - 1 freq remembers (8) - 10 freq gemmell's (8) - 1 freq emmers (8) - 4 freq gemmer (8) - 1 freq gemmies (8) - 1 freq gemmes (8) - 74 freq memmers (8) - 41 freq |
SoundEx code - G521 gamekeepers - 3 freq gangable - 1 freq gingie-flouer - 3 freq gainsbourg - 1 freq gemmkeepers - 4 freq gungapooch - 1 freq gamekeeper - 3 freq gmnzv - 1 freq gnjhvmsfye - 1 freq gjmcfkinross - 1 freq gsmhqjbxph - 1 freq gncwf - 1 freq |
MetaPhone code - JMKPRS gemmkeepers - 4 freq |
GEMMKEEPERS |
| Time to execute Levenshtein function - 0.619946 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 - 1.394696 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.091699 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.107039 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.001159 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. |