| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neepheidit (0) - 1 freq bee-heidit (2) - 1 freq reed-heidit (3) - 1 freq neep-heid (3) - 2 freq 'neepheids' (3) - 1 freq het-heidit (3) - 1 freq hie-heidit (3) - 1 freq hetheidit (3) - 1 freq beheidit (3) - 6 freq spreidit (4) - 3 freq snake-heidit (4) - 1 freq bawheidit (4) - 1 freq tow-heidit (4) - 1 freq expleitit (4) - 1 freq pig-heidit (4) - 1 freq dug-heidit (4) - 2 freq rid-heidit (4) - 2 freq beheidin (4) - 3 freq het-heidet (4) - 1 freq neidit (4) - 1 freq langheidit (4) - 2 freq pleidit (4) - 3 freq baa-heidit (4) - 1 freq heidit (4) - 60 freq neeperin (4) - 1 freq |
neepheidit (0) - 1 freq bee-heidit (4) - 1 freq beheidit (5) - 6 freq hetheidit (5) - 1 freq hie-heidit (5) - 1 freq neep-heid (5) - 2 freq heidit (6) - 60 freq baa-heidit (6) - 1 freq langheidit (6) - 2 freq unheedit (6) - 1 freq needit (6) - 167 freq neidit (6) - 1 freq dependit (6) - 10 freq uphaudit (6) - 13 freq pleidit (6) - 3 freq reed-heidit (6) - 1 freq spreidit (6) - 3 freq het-heidit (6) - 1 freq 'neepheids' (6) - 1 freq bawheidit (6) - 1 freq airy-heidit (7) - 1 freq needet (7) - 2 freq upheid (7) - 1 freq nephew (7) - 28 freq plaidit (7) - 5 freq |
SoundEx code - N133 naebody'd - 6 freq ïnvitit - 2 freq neepheidit - 1 freq nfutweets - 1 freq |
MetaPhone code - NFTT ïnvitit - 2 freq neepheidit - 1 freq nyght'at - 1 freq knighted - 2 freq |
NEEPHEIDIT |
| Time to execute Levenshtein function - 0.349760 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.543175 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.032568 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.038651 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.000933 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. |