| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reply (0) - 159 freq repey (1) - 1 freq realy (1) - 2 freq repay (1) - 1 freq rely (1) - 16 freq replay (1) - 5 freq reely (1) - 9 freq apply (2) - 37 freq eppy (2) - 1 freq reeky (2) - 4 freq rel (2) - 1 freq epely (2) - 1 freq ropey (2) - 1 freq jeely (2) - 45 freq repel (2) - 2 freq reps (2) - 1 freq nelly (2) - 8 freq felly (2) - 1 freq reply's (2) - 6 freq epty (2) - 1 freq eely (2) - 2 freq presly (2) - 2 freq repon (2) - 8 freq ely (2) - 1 freq mealy (2) - 5 freq |
reply (0) - 159 freq replay (1) - 5 freq reely (2) - 9 freq rely (2) - 16 freq repel (2) - 2 freq repay (2) - 1 freq repey (2) - 1 freq realy (2) - 2 freq peely (3) - 18 freq really (3) - 1212 freq reilly (3) - 3 freq relay (3) - 3 freq deploy (3) - 4 freq raelly (3) - 67 freq aerly (3) - 19 freq rep (3) - 3 freq real (3) - 565 freq recl (3) - 1 freq reel (3) - 41 freq replyin (3) - 9 freq roly (3) - 8 freq imply (3) - 2 freq aply (3) - 2 freq rpcy (3) - 1 freq deeply (3) - 36 freq |
SoundEx code - R140 reply - 159 freq rope-will - 2 freq raffle - 13 freq rouble - 7 freq rebel - 26 freq rifle - 24 freq rabble - 10 freq ravel - 2 freq rubble - 7 freq ripple - 7 freq rebelle - 1 freq repel - 2 freq ruffle - 5 freq reveal - 21 freq refull - 1 freq replay - 5 freq rival - 14 freq refill - 3 freq ravioli - 1 freq 'ravioli - 2 freq rifle' - 2 freq reffel - 2 freq 'rabelo' - 1 freq riffle - 1 freq revile - 3 freq raivel - 3 freq raip-haul - 1 freq rop-will - 1 freq revell - 1 freq raifall - 1 freq raphaell - 1 freq rope'll - 1 freq 'rebel - 1 freq reveille - 1 freq 'revel' - 1 freq ruefully - 3 freq revel - 2 freq rewable - 1 freq |
MetaPhone code - RPL reply - 159 freq ripple - 7 freq repel - 2 freq replay - 5 freq rope'll - 1 freq |
REPLY |
| Time to execute Levenshtein function - 0.198932 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.377104 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.031328 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.041283 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.000834 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. |