| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uriah (0) - 2 freq uzziah (2) - 2 freq hurrah (2) - 2 freq riach (2) - 5 freq urnae (2) - 32 freq abiah (2) - 1 freq urgh (2) - 2 freq rah (2) - 5 freq briar (2) - 1 freq riam (2) - 1 freq hrish (2) - 1 freq ulrich (2) - 1 freq crish (2) - 1 freq rich (2) - 192 freq uyah (2) - 2 freq burial (2) - 12 freq righ (2) - 1 freq trial (2) - 82 freq brith (2) - 4 freq irish (2) - 157 freq brah (2) - 4 freq curia (2) - 1 freq rih (2) - 1 freq isiah (2) - 1 freq friar (2) - 1 freq |
uriah (0) - 2 freq rih (2) - 1 freq rah (2) - 5 freq umah (3) - 1 freq isiah (3) - 1 freq brah (3) - 4 freq irish (3) - 157 freq uri (3) - 7 freq urine (3) - 2 freq orpah (3) - 2 freq rh (3) - 1 freq drah (3) - 1 freq ria (3) - 1 freq oriam (3) - 1 freq uraidh (3) - 1 freq urie (3) - 1 freq irh (3) - 1 freq urgh (3) - 2 freq righ (3) - 1 freq riam (3) - 1 freq orh (3) - 1 freq abiah (3) - 1 freq urnae (3) - 32 freq uyah (3) - 2 freq rich (3) - 192 freq |
SoundEx code - U600 ur - 604 freq urr - 40 freq ure - 5 freq 'ur - 7 freq urrr - 1 freq uriah - 2 freq uri - 7 freq ury - 2 freq uayry - 1 freq €œur - 3 freq ur' - 1 freq €˜ur - 12 freq urie - 1 freq |
MetaPhone code - UR ur - 604 freq urr - 40 freq ure - 5 freq 'ur - 7 freq urrr - 1 freq uriah - 2 freq uri - 7 freq ury - 2 freq uayry - 1 freq €œur - 3 freq ur' - 1 freq €˜ur - 12 freq urie - 1 freq |
URIAH |
| Time to execute Levenshtein function - 0.287737 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.444186 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.053969 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.036838 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.000969 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. |