| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rudyard (0) - 2 freq redcard (2) - 1 freq ruary (3) - 1 freq bumbard (3) - 1 freq yard (3) - 43 freq lubbard (3) - 2 freq rewaard (3) - 2 freq richard (3) - 71 freq radar (3) - 11 freq reynard (3) - 3 freq rudas (3) - 1 freq ruddied (3) - 2 freq bussard (3) - 1 freq hubbard (3) - 13 freq upward (3) - 5 freq guard (3) - 39 freq radars (3) - 1 freq redars (3) - 1 freq ruders (3) - 1 freq tullyard (3) - 2 freq rudder (3) - 4 freq rawyards (3) - 1 freq rdad (3) - 1 freq ruder (3) - 2 freq reward (3) - 47 freq |
rudyard (0) - 2 freq redcard (3) - 1 freq rdad (4) - 1 freq ruders (4) - 1 freq ruder (4) - 2 freq redars (4) - 1 freq retard (4) - 2 freq regard (4) - 16 freq ridseard (4) - 1 freq radars (4) - 1 freq rydand (4) - 2 freq reward (4) - 47 freq reynard (4) - 3 freq radar (4) - 11 freq ruddied (4) - 2 freq rewaard (4) - 2 freq rared (5) - 2 freq daurd (5) - 1 freq record (5) - 99 freq roared (5) - 93 freq riders (5) - 8 freq ruddy (5) - 8 freq draed (5) - 1 freq radioed (5) - 1 freq regaird (5) - 39 freq |
SoundEx code - R363 retorts - 2 freq retard - 2 freq retired - 42 freq retreat - 26 freq retorted - 5 freq retirt - 1 freq rotterdam - 7 freq retort - 3 freq retortit - 2 freq retirit - 3 freq retreating - 1 freq retards - 1 freq rudyard - 2 freq retreatit - 7 freq retoured - 14 freq retreat't - 1 freq roadworthy - 2 freq reteired - 3 freq ratrettit - 1 freq rid-haired - 1 freq rid-rid - 1 freq retreatin - 1 freq retourt - 1 freq retiret - 1 freq rotary-dial - 1 freq retir't - 1 freq radioruderham - 1 freq rtreyd - 1 freq retreaded - 1 freq rethered - 1 freq ruthieredart - 10 freq retiredgreyhound - 2 freq |
MetaPhone code - RTYRT rudyard - 2 freq |
RUDYARD |
| Time to execute Levenshtein function - 0.221075 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.457754 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.029073 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.037037 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.000912 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. |