Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
urnae (0) - 32 freq wurnae (1) - 77 freq irnae (1) - 23 freq arnae (1) - 18 freq irna (2) - 22 freq ure (2) - 5 freq jurnay (2) - 6 freq wurhae (2) - 1 freq €™nae (2) - 1 freq turnie (2) - 2 freq 'nae (2) - 94 freq warnae (2) - 15 freq ornge (2) - 1 freq urlar (2) - 1 freq waurnae (2) - 1 freq wudnae (2) - 101 freq ornate (2) - 2 freq curnie (2) - 6 freq wirnae (2) - 31 freq trae (2) - 1 freq untae (2) - 13 freq canae (2) - 28 freq dusnae (2) - 12 freq ersnae (2) - 3 freq undae (2) - 3 freq |
urnae (0) - 32 freq arnae (1) - 18 freq irnae (1) - 23 freq arenae (2) - 88 freq arna (2) - 23 freq arnie (2) - 5 freq urn (2) - 6 freq arne (2) - 1 freq urny (2) - 4 freq ernie (2) - 50 freq urine (2) - 2 freq erne (2) - 4 freq irna (2) - 22 freq wurnae (2) - 77 freq daurnae (3) - 4 freq anae (3) - 1 freq burnie (3) - 16 freq ulna (3) - 1 freq rone (3) - 2 freq une (3) - 4 freq nae (3) - 9872 freq arnage (3) - 1 freq arrae (3) - 1 freq irae (3) - 1 freq erae (3) - 1 freq |
SoundEx code - U650 urnae - 32 freq urn - 6 freq urine - 2 freq urny - 4 freq |
MetaPhone code - URN urnae - 32 freq urn - 6 freq urine - 2 freq urny - 4 freq |
URNAE |
Time to execute Levenshtein function - 0.164479 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.345756 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.030067 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.039585 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.000957 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. |