| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| receptive (0) - 4 freq deceptive (1) - 2 freq recreative (2) - 1 freq perceptive (2) - 4 freq reception (2) - 30 freq recessive (2) - 1 freq receive (2) - 21 freq decriptive (3) - 1 freq deceive (3) - 7 freq elective (3) - 1 freq repetitive (3) - 2 freq restive (3) - 1 freq receives (3) - 3 freq recentlie (3) - 2 freq receptioun (3) - 1 freq relative (3) - 29 freq receptacle (3) - 1 freq recipie (3) - 2 freq deceptively (3) - 1 freq selective (3) - 4 freq secretive (3) - 1 freq receiver (3) - 4 freq reclusive (3) - 1 freq captive (3) - 4 freq reactive (3) - 5 freq |
receptive (0) - 4 freq deceptive (2) - 2 freq reception (3) - 30 freq perceptive (3) - 4 freq recreative (3) - 1 freq captive (4) - 4 freq receptioun (4) - 1 freq reactive (4) - 5 freq receive (4) - 21 freq recessive (4) - 1 freq reptile (5) - 1 freq secretive (5) - 1 freq reclusive (5) - 1 freq receipts (5) - 5 freq receipt (5) - 18 freq recipt (5) - 1 freq incentive (5) - 6 freq reductive (5) - 1 freq respective (5) - 5 freq relietive (5) - 1 freq restive (5) - 1 freq deceptively (5) - 1 freq repetitive (5) - 2 freq decriptive (5) - 1 freq recentlie (5) - 2 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 - RSPTF receptive - 4 freq |
RECEPTIVE |
| Time to execute Levenshtein function - 0.377225 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.534810 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.040181 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.064473 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.001020 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. |