| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unease (0) - 6 freq uneasy (1) - 18 freq tease (2) - 10 freq eneaise (2) - 1 freq untae (2) - 13 freq uncast (2) - 1 freq untape (2) - 1 freq unbeast (2) - 2 freq incase (2) - 11 freq unmade (2) - 5 freq newse (2) - 3 freq unwise (2) - 1 freq neale (2) - 1 freq undae (2) - 3 freq bease (2) - 58 freq neyse (2) - 1 freq unsafe (2) - 2 freq uneaten (2) - 1 freq ineae (2) - 1 freq eease (2) - 1 freq grease (2) - 12 freq lease (2) - 14 freq unleash (2) - 2 freq neave (2) - 3 freq please (2) - 561 freq |
unease (0) - 6 freq uneasy (1) - 18 freq eneaise (2) - 1 freq neyse (2) - 1 freq ense (3) - 15 freq aeneas (3) - 3 freq unsee (3) - 1 freq enes (3) - 2 freq noyse (3) - 1 freq nasa (3) - 17 freq ukase (3) - 1 freq wanease (3) - 1 freq ones (3) - 30 freq ooneasy (3) - 1 freq neis (3) - 1 freq unis (3) - 3 freq nyse (3) - 2 freq inas (3) - 1 freq onesie (3) - 1 freq nes (3) - 1 freq anes (3) - 218 freq noas (3) - 2 freq nise (3) - 1 freq nose (3) - 211 freq noose (3) - 14 freq |
SoundEx code - U520 unco - 325 freq unca - 12 freq unique - 52 freq uneasy - 18 freq umes - 1 freq unis - 3 freq unease - 6 freq 'unco - 2 freq unce - 7 freq unhook - 1 freq unesco - 9 freq un's - 1 freq 'unesco - 3 freq unwise - 1 freq unk - 1 freq -ung - 1 freq uneco - 2 freq unich - 1 freq €œunco - 1 freq €™uang - 2 freq umwyys - 1 freq ung - 1 freq unsee - 1 freq |
MetaPhone code - UNS uneasy - 18 freq unis - 3 freq unease - 6 freq unce - 7 freq un's - 1 freq unsee - 1 freq |
UNEASE |
| Time to execute Levenshtein function - 0.212041 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.389160 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.029229 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.040839 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.000871 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. |