| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| respite (0) - 4 freq despite (1) - 97 freq repute (2) - 12 freq inspite (2) - 3 freq reipit (2) - 2 freq respiyt (2) - 1 freq resit (2) - 1 freq respone (2) - 1 freq resile (2) - 1 freq restit (2) - 18 freq rispit (2) - 1 freq reunite (2) - 1 freq rewrite (2) - 2 freq despyte (2) - 1 freq despise (2) - 5 freq respin (2) - 1 freq restive (2) - 1 freq recite (2) - 9 freq spite (2) - 72 freq repete (2) - 1 freq reivit (3) - 4 freq risit (3) - 1 freq refine (3) - 4 freq jestit (3) - 1 freq petite (3) - 1 freq |
respite (0) - 4 freq respiyt (2) - 1 freq despite (2) - 97 freq rispit (2) - 1 freq restit (3) - 18 freq spite (3) - 72 freq repete (3) - 1 freq despyte (3) - 1 freq respin (3) - 1 freq reipit (3) - 2 freq repute (3) - 12 freq inspite (3) - 3 freq resit (3) - 1 freq respone (3) - 1 freq enspyte (4) - 1 freq reset (4) - 1 freq seepit (4) - 4 freq rappit (4) - 1 freq rispin (4) - 1 freq rest (4) - 683 freq graspit (4) - 3 freq spit (4) - 69 freq rippit (4) - 15 freq resort (4) - 8 freq raspin (4) - 5 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 - RSPT risped - 1 freq receipt - 18 freq respite - 4 freq rasped - 3 freq respiyt - 1 freq rispit - 1 freq recipt - 1 freq |
RESPITE |
| Time to execute Levenshtein function - 0.200843 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.376604 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.027889 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.038462 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.000854 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. |