Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
udny (0) - 9 freq urny (1) - 4 freq hudny (1) - 2 freq oany (2) - 15 freq ony (2) - 2214 freq unn (2) - 5 freq iny (2) - 6 freq didny (2) - 16 freq runny (2) - 2 freq upn (2) - 1 freq mdn (2) - 1 freq 'ony (2) - 9 freq unt (2) - 1 freq uffy (2) - 1 freq urns (2) - 2 freq ruddy (2) - 8 freq uuno (2) - 1 freq hunny (2) - 3 freq urn (2) - 6 freq uknyc (2) - 1 freq gdnd (2) - 1 freq dey (2) - 1241 freq uy (2) - 4 freq uon (2) - 1 freq unyo (2) - 1 freq |
udny (0) - 9 freq adna (2) - 1 freq deny (2) - 52 freq adn (2) - 1 freq dna (2) - 16 freq hudny (2) - 2 freq urny (2) - 4 freq dona (3) - 1 freq uzn (3) - 1 freq dfy (3) - 1 freq eden (3) - 36 freq sudn (3) - 1 freq duina (3) - 6 freq dune (3) - 103 freq dyne (3) - 2 freq dry (3) - 471 freq hny (3) - 1 freq ud (3) - 4 freq doy (3) - 1 freq un (3) - 31 freq dane (3) - 55 freq cudna (3) - 165 freq odin (3) - 43 freq many (3) - 362 freq dudno (3) - 3 freq |
SoundEx code - U350 udny - 9 freq |
MetaPhone code - UTN udny - 9 freq |
UDNY |
Time to execute Levenshtein function - 0.197080 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.360378 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.029633 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.040199 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.000812 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. |