| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rounaboot (0) - 8 freq rounaboots (1) - 1 freq rounabout (1) - 1 freq roonaboot (1) - 17 freq roondaboot (2) - 11 freq aroonaboot (2) - 1 freq roonaboots (2) - 3 freq ootnaboot (2) - 1 freq roundabout (2) - 2 freq runabout (2) - 1 freq roun-about (2) - 2 freq touraboot (2) - 1 freq oot-aboot (3) - 1 freq turnaboot (3) - 1 freq inaboot (3) - 35 freq roondaboots (3) - 4 freq roundabouts (3) - 1 freq gaun-aboot (3) - 2 freq rinaboots (3) - 1 freq hoozaboot (3) - 2 freq nortaboot (3) - 1 freq howzaboot (3) - 3 freq run-doon (4) - 2 freq naeraboot (4) - 4 freq robot (4) - 6 freq |
rounaboot (0) - 8 freq rounabout (1) - 1 freq roonaboot (1) - 17 freq runabout (2) - 1 freq aroonaboot (2) - 1 freq rounaboots (2) - 1 freq roundabout (3) - 2 freq roun-about (3) - 2 freq ootnaboot (3) - 1 freq roonaboots (3) - 3 freq roondaboot (3) - 11 freq rinaboots (4) - 1 freq turnaboot (4) - 1 freq inaboot (4) - 35 freq touraboot (4) - 1 freq rounit (5) - 1 freq roun't (5) - 1 freq ronalt (5) - 32 freq robot (5) - 6 freq monbiot (5) - 1 freq roundit (5) - 3 freq turnabout (5) - 1 freq hoozaboot (5) - 2 freq roondaboots (5) - 4 freq nortaboot (5) - 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 |
ROUNABOOT |
| Time to execute Levenshtein function - 0.397826 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.817054 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.036754 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.074073 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.000952 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. |