| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| replay (0) - 5 freq reply (1) - 159 freq relay (1) - 3 freq repay (1) - 1 freq replays (1) - 1 freq repas (2) - 1 freq deploy (2) - 4 freq play (2) - 719 freq foreplay (2) - 1 freq replace (2) - 21 freq roleplay (2) - 1 freq relax (2) - 41 freq replayin (2) - 1 freq really (2) - 1212 freq reilly (2) - 3 freq yellay (2) - 2 freq mellay (2) - 1 freq repeat (2) - 77 freq delay (2) - 17 freq rely (2) - 16 freq renay (2) - 1 freq relays (2) - 2 freq realy (2) - 2 freq velay (2) - 1 freq hellay (2) - 1 freq |
replay (0) - 5 freq reply (1) - 159 freq repay (2) - 1 freq replays (2) - 1 freq relay (2) - 3 freq realiy (3) - 1 freq rely (3) - 16 freq repeat (3) - 77 freq replayed (3) - 1 freq repel (3) - 2 freq reilly (3) - 3 freq repey (3) - 1 freq reely (3) - 9 freq realy (3) - 2 freq repas (3) - 1 freq replace (3) - 21 freq roleplay (3) - 1 freq foreplay (3) - 1 freq really (3) - 1212 freq play (3) - 719 freq deploy (3) - 4 freq replayin (3) - 1 freq ploy (4) - 109 freq replica (4) - 4 freq aerly (4) - 19 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 |
REPLAY |
| Time to execute Levenshtein function - 0.177520 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.318265 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.027142 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.036363 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.000779 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. |