| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unweir (0) - 1 freq nweir (1) - 6 freq aweir (2) - 1 freq undeid (2) - 3 freq unker (2) - 4 freq unveil (2) - 1 freq unser (2) - 3 freq uner (2) - 2 freq answeir (2) - 2 freq unwed (2) - 1 freq unner (2) - 454 freq under (2) - 429 freq unter (2) - 1 freq neir (2) - 24 freq sweir (2) - 84 freq unswer (2) - 6 freq unlear (2) - 1 freq unfair (2) - 10 freq 'sweir (2) - 1 freq weir (2) - 139 freq unweel (2) - 2 freq punter (3) - 15 freq yunder (3) - 10 freq undr (3) - 1 freq sweer (3) - 18 freq |
unweir (0) - 1 freq nweir (1) - 6 freq weir (3) - 139 freq unfair (3) - 10 freq unweel (3) - 2 freq unswer (3) - 6 freq unlear (3) - 1 freq inower (3) - 10 freq niwer (3) - 28 freq newer (3) - 7 freq neir (3) - 24 freq unawaar (3) - 3 freq sweir (3) - 84 freq unter (3) - 1 freq unser (3) - 3 freq unker (3) - 4 freq aweir (3) - 1 freq answeir (3) - 2 freq uner (3) - 2 freq under (3) - 429 freq unner (3) - 454 freq unwed (3) - 1 freq endear (4) - 1 freq anwey (4) - 1 freq unwrap (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 |
UNWEIR |
| Time to execute Levenshtein function - 0.181376 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.385927 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.036989 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.038132 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.000841 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. |