| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rasped (0) - 3 freq gasped (1) - 21 freq rapped (1) - 4 freq grasped (1) - 3 freq rasper (1) - 1 freq raiped (1) - 5 freq ramped (1) - 3 freq raped (1) - 6 freq risped (1) - 1 freq rested (2) - 12 freq raxxed (2) - 14 freq trapped (2) - 24 freq raked (2) - 16 freq rasher (2) - 1 freq dashed (2) - 14 freq passed (2) - 314 freq raced (2) - 14 freq fashed (2) - 82 freq hashed (2) - 4 freq rapet (2) - 16 freq riped (2) - 2 freq haiped (2) - 1 freq rape- (2) - 2 freq clasped (2) - 8 freq hasted (2) - 2 freq |
rasped (0) - 3 freq risped (1) - 1 freq ramped (2) - 3 freq raiped (2) - 5 freq raped (2) - 6 freq rasper (2) - 1 freq rapped (2) - 4 freq gasped (2) - 21 freq grasped (2) - 3 freq aspd (3) - 1 freq erased (3) - 4 freq gresped (3) - 1 freq rasp (3) - 11 freq rapid (3) - 15 freq lisped (3) - 1 freq raspan (3) - 1 freq respec (3) - 5 freq rushed (3) - 38 freq rusted (3) - 5 freq raspy (3) - 3 freq roped (3) - 1 freq respek (3) - 2 freq sped (3) - 8 freq hesped (3) - 1 freq roasted (3) - 5 freq |
SoundEx code - R213 received - 53 freq reception - 30 freq risped - 1 freq receipt - 18 freq recaptured - 3 freq receivit - 3 freq rose-fite - 1 freq reeseeved - 1 freq respite - 4 freq rugby-tackle - 1 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 - RSPT risped - 1 freq receipt - 18 freq respite - 4 freq rasped - 3 freq respiyt - 1 freq rispit - 1 freq recipt - 1 freq |
RASPED |
| Time to execute Levenshtein function - 0.453174 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 - 1.097934 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.029697 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.159203 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.000994 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. |