Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
role-play (0) - 2 freq roleplay (1) - 1 freq replay (3) - 5 freq rokelay (3) - 1 freq coldplay (3) - 2 freq foreplay (3) - 1 freq low-pay (4) - 1 freq oh-lay (4) - 3 freq rollan (4) - 2 freq roundelay (4) - 1 freq holy-day (4) - 1 freq one-day (4) - 1 freq couplay (4) - 1 freq oot-lay (4) - 1 freq relay (4) - 3 freq solemnly (4) - 18 freq radio-play (4) - 1 freq rome-naw (4) - 3 freq solemly (4) - 2 freq ralely (4) - 5 freq one-way (4) - 1 freq replays (4) - 1 freq repay (4) - 1 freq rolly-polly (4) - 1 freq yole-pulls (4) - 1 freq |
role-play (0) - 2 freq roleplay (2) - 1 freq coldplay (5) - 2 freq replay (5) - 5 freq radio-play (5) - 1 freq ralely (6) - 5 freq reply (6) - 159 freq rolly-polly (6) - 1 freq pale-pale (6) - 1 freq foreplay (6) - 1 freq rokelay (6) - 1 freq fore-paas (7) - 1 freq reliably (7) - 1 freq roll-ups (7) - 1 freq by-pley (7) - 1 freq arle-penny (7) - 1 freq ralley (7) - 2 freq ill-place (7) - 2 freq rally (7) - 10 freq multiply (7) - 9 freq role-model (7) - 1 freq royally (7) - 2 freq rollie (7) - 3 freq limply (7) - 1 freq blue-blae (7) - 1 freq |
SoundEx code - R414 rolly-polly - 1 freq reliable - 5 freq role-play - 2 freq roleplay - 1 freq reliably - 1 freq realevilhrlady - 1 freq realpaulmartin - 2 freq |
MetaPhone code - RLPL rolly-polly - 1 freq role-play - 2 freq roleplay - 1 freq |
ROLE-PLAY |
Time to execute Levenshtein function - 0.222176 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.491440 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.088278 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.099678 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.001103 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. |