| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rainbow (0) - 27 freq rainbows (1) - 2 freq rainbow's (2) - 1 freq rainbows' (2) - 1 freq rainbowsr (2) - 6 freq rainbowed (2) - 1 freq rain'll (3) - 1 freq nairrow (3) - 1 freq raings (3) - 1 freq rainan (3) - 1 freq random (3) - 36 freq rainie (3) - 8 freq rain (3) - 686 freq rainin' (3) - 2 freq carnbo (3) - 1 freq rainin (3) - 41 freq rainy (3) - 16 freq rain's (3) - 6 freq aitbo (3) - 1 freq ringo (3) - 1 freq inlow (3) - 1 freq window (3) - 95 freq abbow (3) - 1 freq aknow (3) - 1 freq rai-con (3) - 1 freq |
rainbow (0) - 27 freq rainbows (2) - 2 freq rainbowed (3) - 1 freq rainbowsr (4) - 6 freq rainbows' (4) - 1 freq rainbow's (4) - 1 freq raing (5) - 1 freq rains (5) - 27 freq ribbon (5) - 21 freq rainfal (5) - 2 freq rambo (5) - 1 freq abow (5) - 1 freq rained (5) - 13 freq rinawa (5) - 2 freq inbox (5) - 4 freq raincoat (5) - 5 freq renew (5) - 7 freq rbw (5) - 1 freq ynbiw (5) - 1 freq ranown (5) - 1 freq raining (5) - 5 freq ransom (5) - 6 freq rzyebw (5) - 1 freq raine (5) - 1 freq raynor (5) - 1 freq |
SoundEx code - R510 rump - 10 freq remove - 13 freq remuive - 4 freq roon-up - 1 freq rainbow - 27 freq ramp - 13 freq run-up - 3 freq romp - 2 freq rumb - 10 freq rumb' - 1 freq rumba - 1 freq rowein-up - 1 freq rin-up - 2 freq runoff - 1 freq rin-aff - 1 freq rambo - 1 freq rmp - 1 freq ryanp - 3 freq rmf - 1 freq rmv - 1 freq rmov - 1 freq |
MetaPhone code - RNB rainbow - 27 freq |
RAINBOW rainbow - 27 freq |
| Time to execute Levenshtein function - 0.229669 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.376187 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.034932 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.038409 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.000908 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. |