| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| papercraft (0) - 1 freq aircraft (3) - 9 freq spacecraft (3) - 3 freq minecraft (4) - 3 freq paperboay (4) - 1 freq prayer-saft (4) - 1 freq maistercraft (4) - 2 freq undercroft (4) - 1 freq paper-back (4) - 1 freq paperback (4) - 25 freq paperjust (4) - 1 freq overdraft (4) - 1 freq seacraft (4) - 1 freq aperrt (4) - 1 freq paparrazi (4) - 1 freq penchant (5) - 3 freq gatecrash (5) - 1 freq pipeclay (5) - 3 freq parrafin (5) - 1 freq ashcroft (5) - 6 freq expectant (5) - 1 freq pre-crust (5) - 2 freq paper- (5) - 2 freq earrant (5) - 1 freq ppera (5) - 24 freq |
papercraft (0) - 1 freq spacecraft (5) - 3 freq aircraft (5) - 9 freq undercroft (6) - 1 freq seacraft (7) - 1 freq aperrt (7) - 1 freq uppercut (7) - 1 freq overdraft (7) - 1 freq paparrazi (7) - 1 freq paperjust (7) - 1 freq prayer-saft (7) - 1 freq maistercraft (7) - 2 freq minecraft (7) - 3 freq rotourcraift (8) - 1 freq piercit (8) - 1 freq pie-crust (8) - 3 freq appreciatit (8) - 14 freq craft (8) - 63 freq percht (8) - 2 freq paperwork (8) - 7 freq portrait (8) - 18 freq approprit (8) - 2 freq percent (8) - 23 freq updraft (8) - 1 freq approchit (8) - 1 freq |
SoundEx code - P162 papers - 137 freq paper's - 2 freq pepper's - 1 freq pibroch - 7 freq peppers - 7 freq pipers - 10 freq paupers - 3 freq peepers - 6 freq puffers - 1 freq piper's - 2 freq poppers - 2 freq paparrazi - 1 freq paparazzi - 1 freq pibroch's - 1 freq peppercorns - 1 freq paepir-kaesin - 1 freq paipers - 5 freq peypers - 5 freq paepers - 2 freq paper-chin - 1 freq papers' - 1 freq peppercoarns - 1 freq peffers - 2 freq papershop - 3 freq peevers - 1 freq pibrochs - 1 freq paperjust - 1 freq papershoap - 1 freq paprika - 3 freq papercraft - 1 freq paperweights - 1 freq paperweight - 1 freq |
MetaPhone code - PPRKRFT papercraft - 1 freq |
PAPERCRAFT |
| Time to execute Levenshtein function - 0.361932 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.609293 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.028888 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.067187 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.000933 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. |