| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| peapods (0) - 2 freq weapons (2) - 35 freq teapots (2) - 2 freq pea-cods (2) - 1 freq peacod (2) - 1 freq periods (2) - 17 freq beards (3) - 12 freq seagows (3) - 1 freq peas (3) - 54 freq despots (3) - 5 freq peaked (3) - 1 freq paco's (3) - 2 freq methods (3) - 8 freq repons (3) - 1 freq jealous (3) - 55 freq peps (3) - 1 freq pape's (3) - 1 freq eairds (3) - 2 freq pads (3) - 41 freq purposs (3) - 3 freq pompoms (3) - 1 freq peppy's (3) - 2 freq beacons (3) - 4 freq pedro's (3) - 1 freq peeped (3) - 10 freq |
peapods (0) - 2 freq periods (3) - 17 freq peeped (4) - 10 freq papoose (4) - 2 freq poaped (4) - 1 freq peoples (4) - 13 freq papa's (4) - 1 freq pads (4) - 41 freq peepers (4) - 6 freq pleads (4) - 5 freq paps (4) - 9 freq papas (4) - 2 freq pods (4) - 7 freq plaids (4) - 5 freq pape's (4) - 1 freq ipods (4) - 1 freq peypokes (4) - 1 freq pends (4) - 2 freq peps (4) - 1 freq rapids (4) - 1 freq peacod (4) - 1 freq pea-cods (4) - 1 freq weapons (4) - 35 freq teapots (4) - 2 freq peypers (4) - 5 freq |
SoundEx code - P132 puppy-dug - 3 freq puppy-dug's - 1 freq peapods - 2 freq poopit's - 1 freq poopits - 1 freq puppets - 2 freq poppets - 1 freq |
MetaPhone code - PPTS peapods - 2 freq poopit's - 1 freq poopits - 1 freq puppets - 2 freq poppets - 1 freq |
PEAPODS |
| Time to execute Levenshtein function - 0.601326 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.984431 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.031670 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.070363 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.000895 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. |