Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
rhyming (0) - 10 freq rhymin' (1) - 2 freq rhymin (1) - 15 freq shaming (2) - 1 freq shyting (2) - 1 freq hiding (3) - 12 freq hykin (3) - 1 freq 'hing (3) - 8 freq rhymer (3) - 12 freq ming (3) - 12 freq stymin (3) - 1 freq rammin (3) - 3 freq shynin (3) - 1 freq aming (3) - 3 freq phoning (3) - 4 freq huving (3) - 1 freq rowling (3) - 3 freq raging (3) - 3 freq ryvin (3) - 1 freq gying (3) - 38 freq drying (3) - 6 freq racing (3) - 18 freq coming (3) - 118 freq vying (3) - 1 freq remine (3) - 2 freq |
rhyming (0) - 10 freq rhymin (2) - 15 freq rhymin' (2) - 2 freq shaming (3) - 1 freq shyting (4) - 1 freq teeming (5) - 1 freq raring (5) - 2 freq raking (5) - 4 freq shaping (5) - 1 freq rhymes (5) - 40 freq aeyhing (5) - 1 freq ringing (5) - 4 freq acoming (5) - 1 freq rating (5) - 1 freq hing (5) - 604 freq reffing (5) - 1 freq shamin (5) - 2 freq bumming (5) - 2 freq trimming (5) - 1 freq thiing (5) - 1 freq rhyme (5) - 64 freq rhine (5) - 2 freq primming (5) - 1 freq humping (5) - 1 freq cuming (5) - 1 freq |
SoundEx code - R552 remains - 61 freq reminiscences - 3 freq reminiscin - 4 freq romance - 39 freq remeens - 1 freq remonstrate - 1 freq rhyming - 10 freq running - 47 freq romans - 44 freq ruining - 3 freq reminisce - 6 freq romunce - 5 freq reminiscent - 2 freq romansch - 4 freq romance-based - 1 freq renounced - 1 freq romances - 2 freq roumans - 2 freq romanies - 1 freq romauncin - 1 freq romancin - 1 freq remonstrance - 1 freq romaunces - 1 freq ranunculus - 1 freq reminiscencies - 1 freq €˜romance - 1 freq remonstratin - 1 freq rinning - 7 freq €œreminiscences - 1 freq remington - 1 freq renunciation - 2 freq reminiscence - 2 freq raining - 5 freq rainiangel - 1 freq rhymingweavers - 1 freq ronanmcsherryuh - 1 freq raminski - 1 freq romanscotland - 2 freq reminiscing - 1 freq reminis - 1 freq romancticness - 1 freq |
MetaPhone code - RMNK rhyming - 10 freq |
RHYMING |
Time to execute Levenshtein function - 0.186711 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.358923 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.027187 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.037274 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.000897 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. |