| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ugugly (0) - 2 freq ugly (2) - 69 freq uruguy (2) - 1 freq gully (2) - 16 freq smugly (2) - 8 freq gurly (2) - 17 freq snugly (2) - 3 freq wully (3) - 127 freq stuggy (3) - 1 freq eggsy (3) - 4 freq surly (3) - 3 freq bugsy (3) - 4 freq july (3) - 71 freq uggs (3) - 2 freq geggy (3) - 2 freq unul (3) - 1 freq shuggy (3) - 1 freq bully (3) - 23 freq glumly (3) - 1 freq eggy (3) - 1 freq foully (3) - 1 freq rugby (3) - 46 freq gulf (3) - 9 freq usual (3) - 235 freq hugely (3) - 4 freq |
ugugly (0) - 2 freq googly (3) - 3 freq aggle (3) - 2 freq gurly (3) - 17 freq geegly (3) - 1 freq eggle (3) - 2 freq ugly (3) - 69 freq gully (3) - 16 freq golly (4) - 4 freq godly (4) - 6 freq oogly (4) - 2 freq guile (4) - 4 freq gangly (4) - 2 freq gurl (4) - 3 freq gurgle (4) - 2 freq guidly (4) - 4 freq muggle (4) - 4 freq gull (4) - 7 freq gyely (4) - 52 freq gul (4) - 1 freq puggle (4) - 1 freq gly (4) - 1 freq vaguely (4) - 8 freq jougle (4) - 1 freq coggly (4) - 1 freq |
SoundEx code - U224 ugugly - 2 freq ususally - 1 freq |
MetaPhone code - UKKL ugugly - 2 freq |
UGUGLY |
| Time to execute Levenshtein function - 0.212993 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.364009 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.027564 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.038551 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.000874 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. |