| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rounabout (0) - 1 freq roundabout (1) - 2 freq runabout (1) - 1 freq rounaboot (1) - 8 freq roun-about (1) - 2 freq rounaboots (2) - 1 freq roundabouts (2) - 1 freq roonaboot (2) - 17 freq aroonaboot (3) - 1 freq roondaboot (3) - 11 freq turnabout (3) - 1 freq howsabout (3) - 1 freq roonaboots (3) - 3 freq ootnaboot (3) - 1 freq touraboot (3) - 1 freq ronalt (4) - 32 freq round-up (4) - 1 freq hereabout (4) - 1 freq howzaboot (4) - 3 freq turnaboot (4) - 1 freq hoozaboot (4) - 2 freq roubrub (4) - 2 freq roundit (4) - 3 freq rinaboots (4) - 1 freq nortaboot (4) - 1 freq |
rounabout (0) - 1 freq runabout (1) - 1 freq rounaboot (1) - 8 freq roonaboot (2) - 17 freq roun-about (2) - 2 freq roundabout (2) - 2 freq aroonaboot (3) - 1 freq rounaboots (3) - 1 freq roonaboots (4) - 3 freq ootnaboot (4) - 1 freq roondaboot (4) - 11 freq turnabout (4) - 1 freq roundabouts (4) - 1 freq rinaboots (5) - 1 freq roundit (5) - 3 freq robot (5) - 6 freq rounit (5) - 1 freq turnaboot (5) - 1 freq roun't (5) - 1 freq inaboot (5) - 35 freq ronalt (5) - 32 freq touraboot (5) - 1 freq hoozaboot (6) - 2 freq rubato (6) - 1 freq howsabout (6) - 1 freq |
SoundEx code - R513 roonaboot - 17 freq removed - 17 freq rounaboot - 8 freq rimbaud - 1 freq rounaboots - 1 freq remuived - 5 freq renivatien - 1 freq roomptetoo - 1 freq ramped - 3 freq rampit - 2 freq roonaboots - 3 freq roun-about - 2 freq renoved - 1 freq rainbowed - 1 freq runabout - 1 freq rimbaud's - 1 freq rounabout - 1 freq rinaboots - 1 freq removit - 1 freq renovatin - 1 freq romped - 1 freq r'umpteenth - 1 freq re-invadit - 1 freq renovate - 1 freq runfatboyrun - 1 freq |
MetaPhone code - RNBT roonaboot - 17 freq rounaboot - 8 freq roun-about - 2 freq runabout - 1 freq rounabout - 1 freq |
ROUNABOUT |
| Time to execute Levenshtein function - 0.227103 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.410385 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.028097 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.038424 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.000921 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. |