| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| needsna (0) - 2 freq needna (1) - 44 freq needs (2) - 340 freq needin' (2) - 7 freq needan (2) - 14 freq needen (2) - 3 freq needa (2) - 1 freq needing (2) - 6 freq needs' (2) - 1 freq needin (2) - 213 freq neednae (2) - 21 freq need'n (2) - 3 freq needle (3) - 39 freq neeps' (3) - 1 freq teeden (3) - 1 freq reeds-e (3) - 1 freq nedin (3) - 1 freq see-saa (3) - 1 freq needly (3) - 4 freq feeds (3) - 23 freq heedin (3) - 11 freq neeps (3) - 148 freq heeding (3) - 4 freq meeda (3) - 8 freq feeding (3) - 10 freq |
needsna (0) - 2 freq needna (2) - 44 freq needin (3) - 213 freq needs' (3) - 1 freq neednae (3) - 21 freq need'n (3) - 3 freq needs (3) - 340 freq needen (3) - 3 freq needan (3) - 14 freq nedin (4) - 1 freq ndna (4) - 8 freq didsna (4) - 1 freq doesna (4) - 90 freq deusna (4) - 1 freq neds (4) - 34 freq needin' (4) - 7 freq needing (4) - 6 freq needa (4) - 1 freq neeson (4) - 1 freq neds' (4) - 1 freq daesna (4) - 71 freq needae (5) - 1 freq gied-na (5) - 1 freq needler (5) - 2 freq endin (5) - 43 freq |
SoundEx code - N325 noticin - 20 freq nidgin - 3 freq nudgin - 4 freq nudge-nudge - 1 freq nutkin - 1 freq notican - 1 freq needsna - 2 freq noticing - 3 freq naedugnoo - 1 freq nedknwmy - 1 freq ndwkinmriy - 1 freq nowthisnews - 2 freq noitisnae - 1 freq |
MetaPhone code - NTSN noticin - 20 freq needsna - 2 freq noitisnae - 1 freq |
NEEDSNA |
| Time to execute Levenshtein function - 0.221941 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.380081 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.029584 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.040073 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.000924 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. |