| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rapidly (0) - 17 freq waridly (2) - 1 freq rapidity (2) - 1 freq rapid (2) - 15 freq rairly (2) - 1 freq rapids (2) - 1 freq braidly (2) - 8 freq railly (2) - 1 freq wardly (3) - 1 freq glaidly (3) - 2 freq rapin (3) - 2 freq raidit (3) - 2 freq graisly (3) - 1 freq reply (3) - 159 freq aabiddy (3) - 1 freq ariddy (3) - 32 freq daily (3) - 108 freq paisly (3) - 1 freq raedy (3) - 4 freq rail (3) - 29 freq raclly (3) - 1 freq rap-id (3) - 1 freq riddy (3) - 38 freq ragiy (3) - 1 freq rails (3) - 15 freq |
rapidly (0) - 17 freq rapids (3) - 1 freq rapid (3) - 15 freq rapidity (3) - 1 freq reply (4) - 159 freq raped (4) - 5 freq ridley (4) - 2 freq eardly (4) - 1 freq readily (4) - 7 freq paidle (4) - 1 freq waridly (4) - 1 freq rairly (4) - 1 freq railly (4) - 1 freq braidly (4) - 8 freq raiped (5) - 5 freq hairdly (5) - 55 freq raidin (5) - 9 freq reidy (5) - 1 freq ralely (5) - 5 freq lairdly (5) - 2 freq eardley (5) - 1 freq stupidly (5) - 4 freq riped (5) - 2 freq ridy (5) - 3 freq deidly (5) - 19 freq |
SoundEx code - R134 revitalisin - 4 freq rabbit-hole - 9 freq rapidly - 17 freq refettle - 1 freq rabbit-hole-an - 1 freq rabbit-hol - 4 freq rabbit-holl - 3 freq reptile - 1 freq rebuttal - 1 freq robdelaney - 1 freq |
MetaPhone code - RPTL rapidly - 17 freq reptile - 1 freq |
RAPIDLY |
| Time to execute Levenshtein function - 0.190427 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.343912 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.026750 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.039357 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.000850 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. |