| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gettkeeper (0) - 1 freq gatekeeper (2) - 1 freq gamekeeper (3) - 3 freq gatekeepers (3) - 11 freq goalkeeper (3) - 4 freq gemmkeepers (3) - 4 freq gatekeepin (4) - 1 freq shopkeeper (4) - 3 freq innkeeper (4) - 1 freq steeper (4) - 1 freq goalkeepers (4) - 1 freq ïnnkeeper (4) - 1 freq timekeeper (4) - 3 freq keeper (4) - 43 freq gamekeepers (4) - 3 freq test-paper (5) - 1 freq fetternear (5) - 1 freq exkeese (5) - 1 freq sleeper (5) - 2 freq gestered (5) - 1 freq teeger (5) - 187 freq gaitherer (5) - 4 freq retweeted (5) - 5 freq rottweiler (5) - 1 freq sweeper (5) - 3 freq |
gettkeeper (0) - 1 freq gatekeeper (3) - 1 freq goalkeeper (5) - 4 freq gamekeeper (5) - 3 freq gatekeepers (5) - 11 freq gatekeepin (6) - 1 freq gemmkeepers (6) - 4 freq timekeeper (6) - 3 freq keeper (7) - 43 freq gutter (7) - 32 freq gitter (7) - 1 freq gutterie (7) - 1 freq gamekeepers (7) - 3 freq innkeeper (7) - 1 freq shopkeeper (7) - 3 freq steeper (7) - 1 freq goalkeepers (7) - 1 freq betther (8) - 18 freq guttery (8) - 3 freq better (8) - 1675 freq distemper (8) - 1 freq etter (8) - 2 freq getten (8) - 13 freq metther (8) - 1 freq pettawater (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 - JTKPR gettkeeper - 1 freq |
GETTKEEPER |
| Time to execute Levenshtein function - 0.242392 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.393635 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.030028 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.038342 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.001215 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. |