Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
uouadays (0) - 1 freq nouadays (1) - 44 freq nooadays (2) - 90 freq nowadays (2) - 22 freq noudays (2) - 1 freq noo-adays (3) - 2 freq sundays (3) - 15 freq nou-a-days (3) - 1 freq nooadaes (3) - 1 freq danadays (3) - 10 freq nooaday's (3) - 1 freq holidays (3) - 87 freq noodays (3) - 4 freq holaedays (3) - 1 freq noondays (3) - 1 freq mondays (3) - 4 freq noo'adays (3) - 2 freq shadays (3) - 1 freq boadys (3) - 2 freq nooradays (3) - 1 freq adays (3) - 3 freq sodas (4) - 1 freq tuesdays (4) - 3 freq poundan (4) - 3 freq loudly (4) - 27 freq |
uouadays (0) - 1 freq nouadays (2) - 44 freq noudays (3) - 1 freq nooadays (3) - 90 freq adays (3) - 3 freq noodays (4) - 4 freq adaes (4) - 1 freq days (4) - 1574 freq boadys (4) - 2 freq adayas (4) - 1 freq nooadaes (4) - 1 freq nowadays (4) - 22 freq dous (5) - 6 freq coads (5) - 1 freq aaways (5) - 1 freq goads (5) - 30 freq ads (5) - 9 freq das (5) - 23 freq heydays (5) - 1 freq adams (5) - 9 freq duys (5) - 1 freq aways (5) - 58 freq deys (5) - 9 freq i'days (5) - 2 freq boays (5) - 109 freq |
SoundEx code - U320 uouadays - 1 freq udqa - 1 freq udkja - 1 freq uwtk - 1 freq utq - 2 freq utj - 1 freq uwtx - 1 freq |
MetaPhone code - UTS uouadays - 1 freq |
UOUADAYS |
Time to execute Levenshtein function - 0.186814 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.365014 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.028481 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.039710 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.000926 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. |