| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| feedeth (0) - 1 freq endeth (2) - 1 freq herdeth (2) - 1 freq feeder (2) - 5 freq freeth (2) - 2 freq feedeen (2) - 1 freq feeders (2) - 1 freq needet (2) - 2 freq feenesh (2) - 2 freq feedit (2) - 1 freq ferget (3) - 2 freq edith (3) - 18 freq ferder (3) - 10 freq fendt (3) - 2 freq feedbeck (3) - 1 freq eejets (3) - 1 freq fleet (3) - 42 freq teedee (3) - 1 freq fleetch (3) - 3 freq feerach (3) - 3 freq feeding (3) - 10 freq feejee (3) - 2 freq feelt (3) - 22 freq feert (3) - 36 freq feddit (3) - 1 freq |
feedeth (0) - 1 freq feedit (3) - 1 freq endeth (3) - 1 freq freeth (3) - 2 freq freith (4) - 2 freq deeth (4) - 4 freq fedit (4) - 1 freq feth (4) - 45 freq edith (4) - 18 freq feeder (4) - 5 freq feenesh (4) - 2 freq feedeen (4) - 1 freq feeders (4) - 1 freq needet (4) - 2 freq herdeth (4) - 1 freq fouth (5) - 45 freq fleesh (5) - 3 freq feet (5) - 960 freq width (5) - 6 freq death (5) - 170 freq fowth (5) - 5 freq daeth (5) - 17 freq foldet (5) - 4 freq feeneesh (5) - 12 freq feddery (5) - 2 freq |
SoundEx code - F330 fadit - 10 freq faded - 16 freq fauted - 1 freq fittit - 26 freq fetid - 3 freq fitted - 27 freq fiytit - 1 freq f-teeth - 1 freq fited - 1 freq fittet - 3 freq feedeth - 1 freq fit-hadd - 1 freq feddit - 1 freq fedit - 1 freq footed - 1 freq fated - 1 freq fithaud - 3 freq feedit - 1 freq fautit - 3 freq fittid - 1 freq fettit - 1 freq fittaedee - 1 freq |
MetaPhone code - FT0 f-teeth - 1 freq feedeth - 1 freq |
FEEDETH |
| Time to execute Levenshtein function - 0.232066 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.455240 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.062236 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.079905 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.000905 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. |