| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| parallel (0) - 21 freq parallels (1) - 6 freq parable (2) - 54 freq parables (2) - 9 freq paalled (2) - 1 freq parades (3) - 7 freq caramel (3) - 11 freq parsley (3) - 8 freq arable (3) - 8 freq parauded (3) - 1 freq parlie (3) - 7 freq payable (3) - 1 freq taaller (3) - 1 freq traller (3) - 1 freq parler (3) - 2 freq pallet (3) - 3 freq spiralled (3) - 1 freq parlez (3) - 1 freq parallelism (3) - 1 freq mahalalel (3) - 2 freq petalled (3) - 1 freq parcel (3) - 45 freq park'll (3) - 1 freq carolle (3) - 2 freq parapet (3) - 3 freq |
parallel (0) - 21 freq parallels (2) - 6 freq paalled (4) - 1 freq parables (4) - 9 freq parable (4) - 54 freq paroled (5) - 1 freq palled (5) - 5 freq panelled (5) - 2 freq miralles (5) - 2 freq carolle (5) - 2 freq marlled (5) - 1 freq parasol (5) - 3 freq pedalled (5) - 1 freq paralysed (5) - 13 freq payroll (5) - 2 freq prolly (5) - 8 freq pernelle (5) - 3 freq purnell (5) - 1 freq park'll (5) - 1 freq carolled (5) - 1 freq parlied (5) - 1 freq parle (5) - 1 freq ralley (5) - 2 freq parler (5) - 2 freq pallet (5) - 3 freq |
SoundEx code - P644 parallel - 21 freq parallels - 6 freq parallelism - 1 freq |
MetaPhone code - PRLL parallel - 21 freq |
PARALLEL |
| Time to execute Levenshtein function - 0.207353 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.440587 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.037261 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.049200 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.001150 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. |