| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| urinal (0) - 6 freq tribal (2) - 12 freq uriah (2) - 2 freq spinal (2) - 3 freq rival (2) - 14 freq urinal's (2) - 1 freq groinal (2) - 1 freq jurnal (2) - 1 freq urine (2) - 2 freq primal (2) - 3 freq rinnal (2) - 1 freq epinal (2) - 1 freq final (2) - 166 freq urnae (2) - 32 freq bridal (2) - 4 freq drindl (2) - 1 freq trial (2) - 82 freq burial (2) - 12 freq orignal (2) - 1 freq drinky (3) - 1 freq tindal (3) - 4 freq royal (3) - 174 freq trials (3) - 19 freq curing (3) - 1 freq oral (3) - 23 freq |
urinal (0) - 6 freq rinnal (3) - 1 freq raynal (3) - 1 freq final (3) - 166 freq urnae (3) - 32 freq orignal (3) - 1 freq urine (3) - 2 freq epinal (3) - 1 freq jurnal (3) - 1 freq rival (3) - 14 freq groinal (3) - 1 freq rins (4) - 101 freq ril (4) - 1 freq rinse (4) - 8 freq rinkle (4) - 2 freq orral (4) - 6 freq rinin (4) - 2 freq rana (4) - 1 freq arsenal (4) - 3 freq original (4) - 117 freq ritual (4) - 15 freq ariel (4) - 5 freq rinawa (4) - 2 freq real (4) - 592 freq urn (4) - 6 freq |
SoundEx code - U654 urinal - 6 freq urinal's - 1 freq |
MetaPhone code - URNL urinal - 6 freq |
URINAL |
| Time to execute Levenshtein function - 0.301870 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.564227 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.028267 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.074913 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.001139 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. |