| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| redandwhite (0) - 1 freq aredandwhitefan (4) - 1 freq near-white (4) - 1 freq meanwhile (4) - 42 freq reachit (5) - 2 freq blae-white (5) - 1 freq sandwhich (5) - 1 freq readie (5) - 36 freq regenwhistie (5) - 1 freq redactit (5) - 1 freq danite (5) - 5 freq remindit (5) - 7 freq readit (5) - 3 freq chaak-white (5) - 2 freq dandie (5) - 1 freq meanwile (5) - 1 freq rewrite (5) - 2 freq rosy-white (5) - 1 freq regardit (5) - 1 freq panshite (5) - 1 freq randie (5) - 8 freq feejaywhite (5) - 1 freq reddit (5) - 13 freq tesswhite (5) - 1 freq meanwhiles (5) - 2 freq |
redandwhite (0) - 1 freq aredandwhitefan (6) - 1 freq redundant (7) - 5 freq randit (8) - 1 freq regenwhistie (8) - 1 freq snawwhite (8) - 1 freq remindit (8) - 7 freq reddit (8) - 13 freq meanwhile (8) - 42 freq near-white (8) - 1 freq rosy-white (8) - 1 freq iainrwhite (8) - 1 freq renownit (8) - 1 freq ridd-hot (8) - 1 freq danicht (9) - 4 freq redundancy (9) - 3 freq denwette (9) - 1 freq roondit (9) - 13 freq endowit (9) - 1 freq kennawhat (9) - 1 freq remindet (9) - 4 freq landwart (9) - 11 freq ready-het (9) - 1 freq randert (9) - 1 freq redd-out (9) - 1 freq |
SoundEx code - R353 road-end - 3 freq reid-haundit - 2 freq reidhaundit - 1 freq redeemed - 5 freq rithmatick - 3 freq readmitted - 1 freq readmittance - 1 freq rodent - 4 freq rodents - 2 freq reddened - 1 freq rationed - 4 freq ready-made - 3 freq radiant - 5 freq rid-haunded - 1 freq redundant - 5 freq reedened - 4 freq reid-haindit - 1 freq redundancy - 3 freq raeddened - 1 freq redeemit - 1 freq rydand - 2 freq redoundand - 1 freq reident - 2 freq rotund - 1 freq retained - 2 freq redandwhite - 1 freq redtintedglasses - 1 freq rtomdavies - 1 freq |
MetaPhone code - RTNTHT redandwhite - 1 freq |
REDANDWHITE |
| Time to execute Levenshtein function - 0.254229 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.432625 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.030719 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.039983 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.000870 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. |