Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ragdoll (0) - 1 freq randall (2) - 7 freq ragdolled (2) - 1 freq raifall (3) - 1 freq rogmull (3) - 1 freq bag'll (3) - 1 freq magdala (3) - 1 freq maccoll (3) - 4 freq dad'll (3) - 2 freq randolph (3) - 1 freq craddol (3) - 1 freq waddell (3) - 1 freq saidill (3) - 1 freq ravioli (3) - 1 freq roll (3) - 108 freq cadboll (3) - 1 freq caroll (3) - 2 freq rattoal (3) - 1 freq atholl (3) - 1 freq rudolf (3) - 2 freq adolf (3) - 2 freq lad'll (3) - 1 freq rat-holl (3) - 1 freq candill (3) - 1 freq random (3) - 36 freq |
ragdoll (0) - 1 freq ragdolled (3) - 1 freq randall (3) - 7 freq rendall (4) - 2 freq rogmull (4) - 1 freq rain'll (5) - 1 freq candill (5) - 1 freq doll (5) - 40 freq raggle (5) - 207 freq orgill (5) - 1 freq goodall (5) - 1 freq argyll (5) - 18 freq rudolf (5) - 2 freq randomly (5) - 3 freq fag'll (5) - 1 freq waddell (5) - 1 freq magdala (5) - 1 freq saidill (5) - 1 freq bag'll (5) - 1 freq raifall (5) - 1 freq roll (5) - 108 freq russell (6) - 37 freq gbell (6) - 1 freq dull (6) - 118 freq gell (6) - 5 freq |
SoundEx code - R234 restless - 15 freq rustl't - 1 freq rustlin - 10 freq rustle - 11 freq rightly - 10 freq rustlt - 1 freq recitals - 2 freq richtly - 49 freq rustled - 4 freq rest'll - 1 freq ruggedly - 2 freq richtlie' - 1 freq richtlie - 14 freq restlessness - 1 freq richt-like - 2 freq rustlan - 1 freq rustly - 1 freq reestled - 1 freq resattled - 1 freq re-sattled - 1 freq restalrig - 1 freq residual - 1 freq ragdolled - 1 freq ragdoll - 1 freq richt-weel - 1 freq reestle - 1 freq rosewoodlondon - 3 freq recital - 1 freq rhxdylultv - 1 freq |
MetaPhone code - RKTL ruggedly - 2 freq ragdoll - 1 freq |
RAGDOLL |
Time to execute Levenshtein function - 0.494664 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.807406 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.073211 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.076678 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.001409 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. |