| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uneasy (0) - 18 freq unease (1) - 6 freq easy (2) - 444 freq peasy (2) - 3 freq sneaky (2) - 9 freq newsy (2) - 1 freq unean (2) - 1 freq funtasy (2) - 1 freq uneasily (2) - 4 freq €œeasy (2) - 1 freq uncast (2) - 1 freq unbeast (2) - 2 freq queasy (2) - 2 freq steasy (2) - 1 freq neast (2) - 1 freq unleash (2) - 2 freq greasy (2) - 27 freq 'easy (2) - 2 freq ooneasy (2) - 1 freq unleasht (3) - 2 freq unhappy (3) - 10 freq unst (3) - 12 freq hasy (3) - 1 freq peaky (3) - 1 freq yeast (3) - 11 freq |
uneasy (0) - 18 freq unease (1) - 6 freq ooneasy (2) - 1 freq noas (3) - 2 freq ones (3) - 31 freq neyse (3) - 1 freq inas (3) - 1 freq nosy (3) - 6 freq nasa (3) - 17 freq noisy (3) - 13 freq nes (3) - 1 freq eneaise (3) - 1 freq neis (3) - 1 freq 'easy (3) - 2 freq insy (3) - 4 freq anas (3) - 9 freq aeneas (3) - 3 freq unis (3) - 2 freq newsy (3) - 1 freq uneasily (3) - 4 freq unean (3) - 1 freq queasy (3) - 2 freq enes (3) - 2 freq peasy (3) - 3 freq neast (3) - 1 freq |
SoundEx code - U520 unco - 328 freq unca - 12 freq unique - 52 freq uneasy - 18 freq umes - 1 freq unis - 2 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 - 2 freq unease - 6 freq unce - 7 freq un's - 1 freq unsee - 1 freq |
UNEASY |
| Time to execute Levenshtein function - 0.226619 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.452836 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.031153 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.039785 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.000865 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. |