Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
irth (0) - 37 freq eirth (1) - 1 freq airth (1) - 11 freq mirth (1) - 12 freq erth (1) - 3 freq ith (1) - 2 freq irh (1) - 1 freq firth (1) - 46 freq hirth (1) - 1 freq yirth (1) - 43 freq birth (1) - 92 freq girth (1) - 5 freq wirth (1) - 91 freq irt (1) - 3 freq argh (2) - 4 freq ruth (2) - 145 freq irks (2) - 1 freq tth (2) - 1 freq nairth (2) - 1 freq kyth (2) - 3 freq forth (2) - 82 freq iooth (2) - 1 freq airts (2) - 356 freq iota (2) - 2 freq mith (2) - 63 freq |
irth (0) - 37 freq yirth (1) - 43 freq erth (1) - 3 freq airth (1) - 11 freq eirth (1) - 1 freq irt (2) - 3 freq roth (2) - 2 freq ruth (2) - 145 freq girth (2) - 5 freq earth (2) - 253 freq wirth (2) - 91 freq ith (2) - 2 freq birth (2) - 92 freq mirth (2) - 12 freq irh (2) - 1 freq hirth (2) - 1 freq firth (2) - 46 freq urgh (3) - 2 freq rtz (3) - 2 freq brath (3) - 1 freq seth (3) - 4 freq derth (3) - 2 freq furth (3) - 105 freq garth (3) - 3 freq lyth (3) - 1 freq |
SoundEx code - I630 irth - 37 freq irate - 1 freq irt - 3 freq i'roadie - 3 freq iheardee - 3 freq ird - 1 freq irrate - 1 freq iarraidh - 1 freq |
MetaPhone code - IR0 irth - 37 freq |
IRTH |
Time to execute Levenshtein function - 0.209503 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.355254 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.028024 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.040593 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.001277 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. |