| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irth (0) - 37 freq airth (1) - 11 freq firth (1) - 44 freq erth (1) - 3 freq birth (1) - 92 freq irt (1) - 3 freq girth (1) - 5 freq mirth (1) - 10 freq irh (1) - 1 freq eirth (1) - 1 freq hirth (1) - 1 freq wirth (1) - 89 freq yirth (1) - 41 freq ith (1) - 2 freq iuta (2) - 1 freq width (2) - 6 freq irrx (2) - 1 freq it- (2) - 5 freq ert (2) - 18 freq lnth (2) - 1 freq iooth (2) - 1 freq irp (2) - 2 freq ire (2) - 9 freq iri (2) - 1 freq treh (2) - 3 freq |
irth (0) - 37 freq eirth (1) - 1 freq erth (1) - 3 freq yirth (1) - 41 freq airth (1) - 11 freq irt (2) - 3 freq ith (2) - 2 freq earth (2) - 251 freq ruth (2) - 140 freq roth (2) - 2 freq wirth (2) - 89 freq birth (2) - 92 freq mirth (2) - 10 freq girth (2) - 5 freq irh (2) - 1 freq firth (2) - 44 freq hirth (2) - 1 freq rh (3) - 1 freq inthe (3) - 2 freq broth (3) - 68 freq aretha (3) - 1 freq noth (3) - 5 freq orta (3) - 1 freq rtl (3) - 1 freq hairth (3) - 26 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.364758 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.906861 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.093629 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.182992 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.001102 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. |