| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unheeded (0) - 1 freq upheezed (2) - 2 freq unhermed (2) - 4 freq unheedit (2) - 1 freq unheuked (2) - 1 freq heeded (2) - 14 freq needed (2) - 150 freq unweshed (3) - 1 freq heered (3) - 2 freq speeded (3) - 2 freq 'unhermed (3) - 1 freq unsered (3) - 1 freq neded (3) - 3 freq unneedit (3) - 1 freq heeder (3) - 1 freq upreeted (3) - 1 freq uncheaned (3) - 1 freq unreined (3) - 1 freq wheedled (3) - 2 freq unfreed (3) - 1 freq heeden (3) - 5 freq intended (3) - 14 freq succeeded (3) - 8 freq seeded (3) - 3 freq sneezed (3) - 10 freq |
unheeded (0) - 1 freq needed (3) - 150 freq unheuked (3) - 1 freq heeded (3) - 14 freq unheedit (3) - 1 freq headed (4) - 38 freq nceded (4) - 1 freq beheided (4) - 7 freq needid (4) - 1 freq unhooked (4) - 1 freq unloaded (4) - 1 freq unheard (4) - 8 freq heded (4) - 1 freq heided (4) - 35 freq unhermed (4) - 4 freq upheezed (4) - 2 freq neded (4) - 3 freq unherd (4) - 2 freq heedid (4) - 1 freq threeded (5) - 2 freq unopened (5) - 4 freq unsheddied (5) - 1 freq ushered (5) - 5 freq enteeced (5) - 1 freq heeled (5) - 1 freq |
SoundEx code - U533 united - 75 freq unheedit - 1 freq undootadly - 1 freq untied - 7 freq undeid - 3 freq undeterred - 7 freq untitled - 1 freq untidy - 1 freq unitet - 3 freq undettered - 1 freq unneedit - 1 freq unitit - 29 freq unteddert - 1 freq undootedly - 2 freq united's - 1 freq uneytit - 1 freq unheeded - 1 freq unitedprotestan - 1 freq 'united - 1 freq unitedrewind - 1 freq |
MetaPhone code - UNHTT unheedit - 1 freq unheeded - 1 freq |
UNHEEDED |
| Time to execute Levenshtein function - 0.205596 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.365020 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.027433 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.045497 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.000889 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. |