Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
receptacle (0) - 1 freq receptacles (1) - 1 freq acceptable (3) - 25 freq receptive (3) - 4 freq repeatable (3) - 1 freq meeracle (4) - 5 freq relatable (4) - 3 freq reception (4) - 30 freq deceptive (4) - 2 freq respectable (4) - 12 freq replace (4) - 21 freq refettle (4) - 1 freq repentance (4) - 3 freq regrettable (4) - 1 freq remerkable (4) - 4 freq presentable (4) - 3 freq reputable (4) - 3 freq reperable (4) - 1 freq delectable (4) - 1 freq receptioun (4) - 1 freq spectacle (4) - 7 freq detectable (4) - 2 freq acceptance (4) - 31 freq renewable (4) - 3 freq reptile (4) - 1 freq |
receptacle (0) - 1 freq receptacles (2) - 1 freq repeatable (5) - 1 freq receptive (5) - 4 freq acceptable (5) - 25 freq reciprocal (6) - 2 freq recital (6) - 1 freq receptioun (6) - 1 freq recycle (6) - 3 freq reputable (6) - 3 freq reptile (6) - 1 freq recentlie (6) - 2 freq sceptical (6) - 3 freq recently (6) - 78 freq reception (6) - 30 freq reciproc (7) - 1 freq repeatedly (7) - 4 freq recipt (7) - 1 freq recapturin (7) - 1 freq rectangle (7) - 2 freq deceptively (7) - 1 freq receipt (7) - 18 freq sceptic (7) - 2 freq receipts (7) - 5 freq reconcile (7) - 3 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 - RSPTKL receptacle - 1 freq |
RECEPTACLE |
Time to execute Levenshtein function - 0.204679 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.373057 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.027705 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.037159 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.000861 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. |