Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
rotary-dial (0) - 1 freq rotary (5) - 3 freq cordial (5) - 6 freq notaries (6) - 2 freq cooardice (6) - 1 freq trial (6) - 82 freq potential (6) - 90 freq modern-day (6) - 3 freq ready-meals (6) - 1 freq impartial (6) - 1 freq dotards (6) - 1 freq rotterdam (6) - 7 freq roadkill (6) - 1 freq hoardin (6) - 6 freq arcadia (6) - 7 freq primordial (6) - 1 freq martial (6) - 5 freq roadman (6) - 3 freq rotad (6) - 2 freq terential (6) - 1 freq rosaries (6) - 3 freq otral (6) - 1 freq roadins (6) - 3 freq sun-dial (6) - 1 freq tear-drap (6) - 1 freq |
rotary-dial (0) - 1 freq tarradale (8) - 1 freq retiral (8) - 5 freq peter-uill (8) - 1 freq retard (8) - 2 freq rotary (8) - 3 freq cordial (8) - 6 freq retards (8) - 1 freq retorted (9) - 5 freq treevial (9) - 1 freq regardin (9) - 2 freq tardis (9) - 2 freq nae-deal (9) - 1 freq roared (9) - 93 freq tae-dae (9) - 6 freq rooral (9) - 1 freq tutorial (9) - 2 freq oardird (9) - 1 freq referential (9) - 2 freq tarisgal (9) - 2 freq rear-view (9) - 3 freq roar'd (9) - 1 freq rtreyd (9) - 1 freq material (9) - 86 freq fordil (9) - 1 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 - RTRTL rotary-dial - 1 freq |
ROTARY-DIAL |
Time to execute Levenshtein function - 0.282169 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.449755 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.030697 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.043511 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.000966 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. |