| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gdsfc (0) - 1 freq gsfc (1) - 2 freq dsfl (2) - 1 freq msfc (2) - 3 freq gsf (2) - 1 freq ghsfp (2) - 4 freq dfc (2) - 2 freq drfw (3) - 1 freq cds (3) - 20 freq gus (3) - 21 freq gdeb (3) - 1 freq wsf (3) - 1 freq gmc (3) - 1 freq snc (3) - 1 freq gdnq (3) - 1 freq sjfc (3) - 1 freq ksc (3) - 1 freq ogfc (3) - 1 freq daff (3) - 5 freq gcc (3) - 2 freq gps (3) - 4 freq lzsfd (3) - 1 freq dcc (3) - 1 freq dsi (3) - 1 freq df (3) - 2 freq |
gdsfc (0) - 1 freq gsfc (2) - 2 freq dfc (4) - 2 freq gsf (4) - 1 freq ghsfp (4) - 4 freq msfc (4) - 3 freq dsfl (4) - 1 freq guds (5) - 1 freq gads (5) - 8 freq disc (5) - 5 freq godric (5) - 1 freq gods (5) - 73 freq ogfc (5) - 1 freq gods' (5) - 1 freq sayfc (5) - 1 freq sdasfd (5) - 1 freq geds (5) - 1 freq slc (6) - 19 freq gmse (6) - 1 freq gaif (6) - 1 freq sc (6) - 14 freq dfp (6) - 9 freq geff (6) - 1 freq gusto (6) - 6 freq insec (6) - 2 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 - KTSFK gdsfc - 1 freq |
GDSFC |
| Time to execute Levenshtein function - 0.239318 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.355981 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.031244 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.037483 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.000869 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. |