| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| received (0) - 48 freq receiver (1) - 4 freq deceived (1) - 2 freq receives (1) - 3 freq receive (1) - 21 freq reteired (2) - 3 freq reserved (2) - 11 freq deceiver (2) - 2 freq deceive (2) - 7 freq recewed (2) - 1 freq receded (2) - 1 freq reeved (2) - 2 freq reeined (2) - 1 freq sereived (2) - 1 freq re-lived (2) - 1 freq receivit (2) - 3 freq recited (2) - 2 freq receivin (2) - 7 freq remuived (2) - 5 freq resaived (2) - 2 freq revived (2) - 6 freq receever (2) - 1 freq perceived (2) - 7 freq reived (2) - 5 freq recleeved (2) - 1 freq |
received (0) - 48 freq receive (2) - 21 freq receives (2) - 3 freq deceived (2) - 2 freq receiver (2) - 4 freq receivit (3) - 3 freq perceived (3) - 7 freq recited (3) - 2 freq revived (3) - 6 freq resaived (3) - 2 freq remuived (3) - 5 freq receivin (3) - 7 freq receded (3) - 1 freq recleeved (3) - 1 freq reived (3) - 5 freq recewed (3) - 1 freq receever (3) - 1 freq reeved (3) - 2 freq recover (4) - 7 freq recaird (4) - 1 freq rived (4) - 20 freq recawed (4) - 2 freq relieved (4) - 38 freq removed (4) - 15 freq reeseeved (4) - 1 freq |
SoundEx code - R213 received - 48 freq reception - 29 freq risped - 1 freq receipt - 18 freq recaptured - 3 freq receivit - 3 freq rose-fite - 1 freq reeseeved - 1 freq respite - 4 freq rose-bed - 1 freq receptionist - 10 freq rasped - 3 freq resaived - 2 freq receptacles - 1 freq receipts - 5 freq respiyt - 1 freq rosebuds - 1 freq rispit - 1 freq receptautioun - 1 freq recapturin - 1 freq receptioun - 1 freq receptive - 4 freq receptacle - 1 freq re-shaped - 1 freq rosebed - 1 freq receptionists - 2 freq rikfyddljv - 1 freq recipt - 1 freq rugbyaid - 1 freq rosebeds - 1 freq rsbatxdve - 1 freq rspbdandg - 1 freq |
MetaPhone code - RSFT received - 48 freq receivit - 3 freq rose-fite - 1 freq reeseeved - 1 freq resaived - 2 freq |
RECEIVED |
| Time to execute Levenshtein function - 0.206866 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.358767 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.027581 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.036855 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.000856 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. |