| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gatsby (0) - 1 freq gansey (2) - 17 freq patsy (2) - 8 freq gats (2) - 1 freq gabby (2) - 1 freq absby (2) - 1 freq gutsy (2) - 7 freq gassy (2) - 1 freq watty (3) - 1 freq patchy (3) - 5 freq grisly (3) - 4 freq garyb (3) - 2 freq bassy (3) - 1 freq toby (3) - 7 freq catty (3) - 27 freq matsuo (3) - 2 freq gasps (3) - 7 freq tabby (3) - 15 freq girssy (3) - 3 freq assay (3) - 5 freq camby (3) - 1 freq gast (3) - 5 freq gab (3) - 32 freq ootby (3) - 128 freq garnsey (3) - 1 freq |
gatsby (0) - 1 freq gats (3) - 1 freq gutsy (3) - 7 freq gits (4) - 102 freq gates (4) - 104 freq guts (4) - 73 freq gutsie (4) - 2 freq goats (4) - 17 freq gaits (4) - 30 freq gaets (4) - 4 freq gutsed (4) - 1 freq geats (4) - 1 freq gyatso (4) - 1 freq otsb (4) - 1 freq gets (4) - 432 freq gutsily (4) - 1 freq tsb (4) - 1 freq gets' (4) - 1 freq patsy (4) - 8 freq gansey (4) - 17 freq gassy (4) - 1 freq absby (4) - 1 freq gabby (4) - 1 freq lats (5) - 26 freq gate (5) - 294 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 - KTSB gatsby - 1 freq |
GATSBY |
| Time to execute Levenshtein function - 0.205619 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.385762 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.030807 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.037208 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.000996 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. |