| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gfeadjrd (0) - 1 freq feard (3) - 1 freq pleaded (4) - 17 freq seabird (4) - 8 freq eader (4) - 1 freq gleamed (4) - 4 freq gadjee (4) - 1 freq felder (4) - 1 freq fedd (4) - 1 freq greased (4) - 3 freq featured (4) - 9 freq ferder (4) - 10 freq feeders (4) - 1 freq reader (4) - 89 freq feddery (4) - 2 freq fear' (4) - 1 freq 'fedder (4) - 3 freq 'fedder' (4) - 4 freq 'fender' (4) - 1 freq garrd (4) - 3 freq featurs (4) - 14 freq feadogs (4) - 1 freq seawird (4) - 1 freq 'fear (4) - 1 freq feared (4) - 35 freq |
gfeadjrd (0) - 1 freq geddered (6) - 1 freq feard (6) - 1 freq gard (7) - 4 freq gerard (7) - 2 freq fedder (7) - 36 freq fedora (7) - 3 freq guelders (7) - 1 freq fjord (7) - 2 freq feerd (7) - 1 freq guldered (7) - 10 freq faerd (7) - 10 freq gender (7) - 19 freq gaddered (7) - 16 freq goaded (7) - 1 freq fedders (7) - 21 freq faded (7) - 16 freq feardy (7) - 2 freq geddert (7) - 1 freq guerd (7) - 1 freq ferd (7) - 2 freq guerded (7) - 1 freq feeder (7) - 5 freq gaird (7) - 61 freq graded (7) - 3 freq |
SoundEx code - G132 gifts - 33 freq gifties - 4 freq gibt's - 1 freq goviedick - 1 freq govts - 1 freq gypeheidgendies - 1 freq gfeadjrd - 1 freq gqvfdoka - 1 freq |
MetaPhone code - KFTJRT gfeadjrd - 1 freq |
GFEADJRD |
| Time to execute Levenshtein function - 0.241148 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.399088 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.029444 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.038934 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.000936 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. |