| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rocknroll (0) - 1 freq rockall (3) - 1 freq rockpools (3) - 1 freq cockerel (4) - 5 freq scroll (4) - 19 freq knoll (4) - 2 freq carroll (4) - 6 freq rockness (4) - 1 freq rockport (4) - 1 freq rover'll (4) - 1 freq poker'll (4) - 2 freq rockery (4) - 1 freq caroll (4) - 2 freq jonrell (4) - 1 freq bogeyroll (4) - 1 freq fock'll (4) - 1 freq rockform (4) - 1 freq rocker (4) - 3 freq cornhill (5) - 5 freq rocketin (5) - 1 freq romanoff (5) - 1 freq fuckinell (5) - 1 freq fowk'll (5) - 14 freq backdrop (5) - 3 freq lockdoon (5) - 55 freq |
rocknroll (0) - 1 freq rockall (5) - 1 freq rockpools (6) - 1 freq jonrell (7) - 1 freq caroll (7) - 2 freq fock'll (7) - 1 freq fuckinell (7) - 1 freq mackerrell (7) - 1 freq rockery (7) - 1 freq rocker (7) - 3 freq rockform (7) - 1 freq carroll (7) - 6 freq knoll (7) - 2 freq cockerel (7) - 5 freq rockness (7) - 1 freq scroll (7) - 19 freq rockport (7) - 1 freq backerly (8) - 1 freq cornell (8) - 1 freq counsell (8) - 1 freq mockingly (8) - 1 freq brockville (8) - 1 freq o'connell (8) - 1 freq rciarlm (8) - 1 freq rain'll (8) - 1 freq |
SoundEx code - R256 ragnar - 18 freq ragnar's - 3 freq ragnarok - 3 freq raisonneur - 1 freq russamyre - 1 freq rigmarole - 3 freq reckoners - 1 freq rash-ma-reishilt - 1 freq rockin-horse - 1 freq regeneration - 3 freq regenerate - 1 freq rosemarkie - 3 freq rushmore - 2 freq rigmarie - 2 freq rosiemoore - 1 freq rsmorrow - 1 freq rcsneartshub - 1 freq rocknroll - 1 freq |
MetaPhone code - RKNRL rocknroll - 1 freq |
ROCKNROLL |
| Time to execute Levenshtein function - 0.235353 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.418141 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.032905 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.039038 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.000891 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. |