| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unaware (0) - 6 freq unawars (1) - 1 freq unawares (1) - 5 freq aware (2) - 54 freq unawaar (2) - 3 freq unawaurs (2) - 2 freq unalane (2) - 1 freq unswer (3) - 6 freq naard (3) - 1 freq undae (3) - 3 freq frawart (3) - 2 freq untoward (3) - 1 freq inwart (3) - 1 freq natale (3) - 1 freq unlearn (3) - 2 freq snare (3) - 13 freq unsafe (3) - 2 freq awake (3) - 29 freq unlyart (3) - 1 freq unrade (3) - 1 freq award (3) - 59 freq upward (3) - 5 freq notare (3) - 1 freq untae (3) - 13 freq runaway (3) - 6 freq |
unaware (0) - 6 freq unawaar (2) - 3 freq unawares (2) - 5 freq unawars (2) - 1 freq nuwara (3) - 2 freq unawaurs (3) - 2 freq aware (3) - 54 freq ungaro (4) - 2 freq onward (4) - 5 freq awar (4) - 4 freq onymare (4) - 2 freq anymare (4) - 17 freq unwise (4) - 1 freq newark (4) - 1 freq unweir (4) - 1 freq unsure (4) - 6 freq ware (4) - 26 freq inward (4) - 7 freq naewur (4) - 2 freq beware (4) - 5 freq onawaurs (4) - 1 freq newer (4) - 7 freq inower (4) - 10 freq nare (4) - 1 freq unlear (4) - 1 freq |
SoundEx code - U560 unner - 454 freq unaware - 6 freq unnér - 5 freq unnèr - 27 freq unweir - 1 freq unnerwye - 1 freq unawaar - 3 freq uimor - 1 freq unnerway - 1 freq uimour - 3 freq uner - 2 freq umour - 1 freq unnerwey - 1 freq €˜unner - 1 freq un-hear - 1 freq |
MetaPhone code - UNWR unaware - 6 freq unweir - 1 freq unawaar - 3 freq |
UNAWARE |
| Time to execute Levenshtein function - 0.219989 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.338753 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.026774 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.036568 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.000914 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. |