| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| plaudits (0) - 2 freq plaits (2) - 4 freq blaudit (2) - 2 freq plaidies (2) - 2 freq pladdies (2) - 1 freq laudies (2) - 1 freq plaidit (2) - 5 freq plunts (3) - 1 freq fludit (3) - 1 freq landis (3) - 6 freq plants (3) - 73 freq playins (3) - 1 freq pausit (3) - 4 freq scaudit (3) - 5 freq 'audit (3) - 1 freq plait (3) - 6 freq plankit (3) - 4 freq plauntins (3) - 1 freq plauntit (3) - 2 freq fleudit (3) - 2 freq lauds (3) - 1 freq applaudit (3) - 3 freq laudin (3) - 1 freq bandits (3) - 5 freq plaidie (3) - 3 freq |
plaudits (0) - 2 freq plaidit (3) - 5 freq plaidies (3) - 2 freq pladdies (3) - 1 freq plaits (3) - 4 freq plamts (4) - 1 freq pleidit (4) - 3 freq plaids (4) - 5 freq plants (4) - 73 freq pleadit (4) - 7 freq planets (4) - 41 freq laudies (4) - 1 freq blaudit (4) - 2 freq plunts (4) - 1 freq pundits (4) - 7 freq blauds (5) - 1 freq plaidin (5) - 1 freq plaiks (5) - 1 freq plaikies (5) - 1 freq laud's (5) - 1 freq poakits (5) - 7 freq pandit (5) - 57 freq laddies (5) - 198 freq ladies (5) - 54 freq alludit (5) - 2 freq |
SoundEx code - P433 pleadit - 7 freq pleaded - 17 freq peltit - 5 freq plaited - 3 freq pleatit - 3 freq pelted - 5 freq pleidit - 3 freq platitudes - 1 freq pullootit - 1 freq plaudits - 2 freq polluted - 7 freq pleated - 5 freq pleadet - 2 freq pollutet - 1 freq plaidit - 5 freq plotted - 2 freq plodded - 2 freq pollutit - 1 freq plotit - 3 freq plated - 3 freq piloted - 1 freq plöted - 1 freq pauldetarragona - 1 freq |
MetaPhone code - PLTTS plaudits - 2 freq |
PLAUDITS |
| Time to execute Levenshtein function - 0.300056 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.592408 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.028008 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.068651 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.000872 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. |