| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ugliness (0) - 1 freq uglies (2) - 1 freq oagliness (2) - 1 freq haliness (2) - 2 freq ugliest (2) - 1 freq guiness (2) - 2 freq holiness (2) - 1 freq coldness (3) - 2 freq fullness (3) - 4 freq unless (3) - 139 freq maleness (3) - 1 freq halieness (3) - 1 freq wullinness (3) - 1 freq klines (3) - 1 freq gliders (3) - 2 freq gladness (3) - 1 freq line's (3) - 2 freq dubliners (3) - 2 freq 'guinness (3) - 1 freq gayness (3) - 1 freq fellness (3) - 1 freq godliness (3) - 1 freq gledness (3) - 5 freq dowiness (3) - 1 freq laziness (3) - 1 freq |
ugliness (0) - 1 freq oagliness (2) - 1 freq holiness (3) - 1 freq guiness (3) - 2 freq haliness (3) - 2 freq lioness (4) - 2 freq goldness (4) - 1 freq guiless (4) - 1 freq glints (4) - 6 freq giless (4) - 4 freq wulness (4) - 1 freq agness (4) - 2 freq gliss (4) - 1 freq lyness (4) - 1 freq glenesk (4) - 1 freq guidiness (4) - 1 freq guinness (4) - 16 freq wileness (4) - 1 freq guidness (4) - 22 freq gless (4) - 395 freq glaess (4) - 1 freq haleness (4) - 1 freq godness (4) - 1 freq illness (4) - 24 freq glegness (4) - 7 freq |
SoundEx code - U245 uglian - 2 freq ugliness - 1 freq uslanguagesoc - 2 freq uswlemag - 1 freq ukulemae - 5 freq |
MetaPhone code - UKLNS ugliness - 1 freq |
UGLINESS |
| Time to execute Levenshtein function - 0.284360 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.484966 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.027629 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.040704 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.000989 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. |