| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| needful (0) - 4 freq needfu (1) - 12 freq needfu' (1) - 43 freq heidful (2) - 1 freq heedfu (2) - 1 freq dredfu (3) - 1 freq useful (3) - 24 freq needin (3) - 213 freq tearful (3) - 2 freq peddul (3) - 1 freq needae (3) - 1 freq helpful (3) - 6 freq needle (3) - 39 freq peedlum (3) - 1 freq edfu (3) - 1 freq handful (3) - 3 freq needed (3) - 150 freq neebur (3) - 11 freq deesul (3) - 1 freq mindful (3) - 5 freq needin' (3) - 7 freq needid (3) - 1 freq needn't (3) - 2 freq needly (3) - 4 freq needs (3) - 340 freq |
needful (0) - 4 freq needfu' (2) - 43 freq needfu (2) - 12 freq heidful (3) - 1 freq needfire (4) - 1 freq needle (4) - 39 freq handful (4) - 3 freq needly (4) - 4 freq heedfu (4) - 1 freq mindful (4) - 5 freq neidil (4) - 1 freq ferful (5) - 2 freq needen (5) - 3 freq needan (5) - 14 freq naefun (5) - 1 freq needie (5) - 3 freq needgio (5) - 1 freq leidfu (5) - 1 freq earful (5) - 2 freq nueuul (5) - 1 freq dreadful (5) - 5 freq woeful (5) - 4 freq needna (5) - 44 freq aweful (5) - 1 freq needsna (5) - 2 freq |
SoundEx code - N314 netflix - 16 freq notably - 7 freq 'notable - 1 freq notable - 5 freq needful - 4 freq €˜netflix - 1 freq notability - 1 freq notplanning - 1 freq |
MetaPhone code - NTFL needful - 4 freq |
NEEDFUL |
| Time to execute Levenshtein function - 0.208470 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.362010 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.027666 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.038303 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.000926 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. |