| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| receive (0) - 21 freq receiver (1) - 4 freq receives (1) - 3 freq deceive (1) - 7 freq received (1) - 48 freq repreive (2) - 1 freq beleive (2) - 1 freq recite (2) - 9 freq revive (2) - 7 freq restive (2) - 1 freq perceive (2) - 3 freq recline (2) - 2 freq recipe (2) - 33 freq receipt (2) - 18 freq deceived (2) - 2 freq sereive (2) - 1 freq reive (2) - 5 freq reserve (2) - 7 freq deceiver (2) - 2 freq remuive (2) - 4 freq recessive (2) - 1 freq rescreive (2) - 1 freq receptive (2) - 4 freq reactive (2) - 5 freq reeve (2) - 1 freq |
receive (0) - 21 freq received (2) - 48 freq deceive (2) - 7 freq receiver (2) - 4 freq receives (2) - 3 freq recile (3) - 1 freq receever (3) - 1 freq reeve (3) - 1 freq remuive (3) - 4 freq recipe (3) - 33 freq reactive (3) - 5 freq reive (3) - 5 freq receivit (3) - 3 freq recite (3) - 9 freq receivin (3) - 7 freq relive (3) - 1 freq revive (3) - 7 freq perceive (3) - 3 freq remove (4) - 12 freq reclee (4) - 1 freq recover (4) - 7 freq recoil (4) - 3 freq archive (4) - 26 freq reece (4) - 1 freq racine (4) - 3 freq |
SoundEx code - R210 recipe - 33 freq rugby - 46 freq receive - 21 freq rasp - 11 freq 'rugby - 1 freq 'recipe' - 1 freq rosscoff - 1 freq recoop - 1 freq recipie - 2 freq rock-a-bye - 1 freq rspb - 11 freq rspba - 6 freq risp - 2 freq resaif - 2 freq rose-hip - 1 freq rougvie - 1 freq recoup - 3 freq raspy - 2 freq rokeby - 1 freq reshape - 1 freq rkwp - 1 freq rcf - 1 freq rrrxb - 1 freq rzyebw - 1 freq rxjfb - 1 freq rgwip - 1 freq rqp - 1 freq royxf - 1 freq rwowzp - 1 freq rgohev - 1 freq |
MetaPhone code - RSF receive - 21 freq resaif - 2 freq |
RECEIVE |
| Time to execute Levenshtein function - 0.197810 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.353667 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.029174 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.037867 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. |