| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unwise (0) - 1 freq urwise (1) - 1 freq twise (2) - 11 freq untie (2) - 2 freq unlike (2) - 43 freq unite (2) - 11 freq wise (2) - 82 freq noise (2) - 152 freq unisex (2) - 1 freq iwise (2) - 9 freq unwind (2) - 5 freq unis (2) - 2 freq unwyve (2) - 2 freq €˜wise (2) - 1 freq aywise (2) - 1 freq aawise (2) - 1 freq upwide (2) - 1 freq uise (2) - 281 freq unease (2) - 6 freq adwise (2) - 1 freq sunrise (2) - 14 freq naise (2) - 2 freq unkist (2) - 2 freq untwist (2) - 3 freq nise (2) - 1 freq |
unwise (0) - 1 freq urwise (2) - 1 freq aawise (3) - 1 freq onywyse (3) - 1 freq aywise (3) - 1 freq unease (3) - 6 freq naise (3) - 2 freq nise (3) - 1 freq naewise (3) - 1 freq newse (3) - 3 freq adwise (3) - 1 freq unwyve (3) - 2 freq wise (3) - 82 freq twise (3) - 11 freq unis (3) - 2 freq noise (3) - 152 freq iwise (3) - 9 freq wyse (4) - 8 freq nis (4) - 2 freq noyse (4) - 1 freq mowse (4) - 2 freq unwed (4) - 1 freq alwis (4) - 23 freq unsee (4) - 1 freq wse (4) - 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 - UNWS unwise - 1 freq |
UNWISE |
| Time to execute Levenshtein function - 0.191747 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.333767 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.027888 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.037210 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.000929 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. |