| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rinaboots (0) - 1 freq inaboots (1) - 3 freq inaboot (2) - 35 freq in-aboots (2) - 1 freq roonaboots (2) - 3 freq hiraboots (2) - 2 freq rounaboots (2) - 1 freq roonaboot (3) - 17 freq inboos (3) - 1 freq eraboots (3) - 1 freq in-aboot (3) - 1 freq roondaboots (3) - 4 freq print-oots (3) - 1 freq layaboots (3) - 1 freq runabout (3) - 1 freq ionabooks (3) - 1 freq rounaboot (3) - 8 freq aboots (3) - 15 freq rig-oots (3) - 2 freq faraboots (3) - 2 freq aroonaboot (4) - 1 freq aboot (4) - 10010 freq a'aboot (4) - 1 freq theraboots (4) - 1 freq i'books (4) - 1 freq |
rinaboots (0) - 1 freq roonaboots (2) - 3 freq inaboots (2) - 3 freq rounaboots (2) - 1 freq roondaboots (4) - 4 freq eraboots (4) - 1 freq runabout (4) - 1 freq rounaboot (4) - 8 freq inaboot (4) - 35 freq in-aboots (4) - 1 freq hiraboots (4) - 2 freq roonaboot (4) - 17 freq nanobots (5) - 1 freq rounabout (5) - 1 freq renaults (5) - 1 freq rainbows (5) - 2 freq roundabouts (5) - 1 freq robots (5) - 4 freq rabbits (5) - 29 freq raincoats (5) - 1 freq aroonaboot (5) - 1 freq ionabooks (5) - 1 freq layaboots (5) - 1 freq rinagates (5) - 1 freq rig-oots (5) - 2 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 - RNBTS rounaboots - 1 freq roonaboots - 3 freq rinaboots - 1 freq |
RINABOOTS |
| Time to execute Levenshtein function - 0.248902 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.462815 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.028438 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.037878 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.001092 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. |