| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pleurer (0) - 1 freq pleure (1) - 1 freq pleuter (1) - 1 freq paerer (2) - 1 freq pleyer (2) - 2 freq steurer (2) - 1 freq pleumen (2) - 1 freq purer (2) - 2 freq clearer (2) - 26 freq neurer (2) - 1 freq plester (2) - 2 freq spleuter (2) - 3 freq pleiter (2) - 1 freq neuter (3) - 2 freq bleezer (3) - 1 freq purr (3) - 3 freq plestert (3) - 2 freq pleugh (3) - 2 freq pleece (3) - 1 freq pleisur (3) - 33 freq 'louder (3) - 1 freq glenure (3) - 7 freq bearer (3) - 7 freq lere (3) - 2 freq leyder (3) - 1 freq |
pleurer (0) - 1 freq pleuter (2) - 1 freq pleure (2) - 1 freq clearer (3) - 26 freq purer (3) - 2 freq pleyer (3) - 2 freq paerer (3) - 1 freq pleiter (3) - 1 freq flerr (4) - 4 freq pelter (4) - 1 freq peerier (4) - 17 freq puirer (4) - 6 freq pleyers (4) - 7 freq pleisir (4) - 3 freq clairer (4) - 1 freq plainer (4) - 3 freq player (4) - 131 freq plooter (4) - 1 freq blurr (4) - 1 freq pleasure (4) - 74 freq pler (4) - 1 freq perr (4) - 23 freq plover (4) - 9 freq plural (4) - 56 freq plyter (4) - 3 freq |
SoundEx code - P466 pleurer - 1 freq |
MetaPhone code - PLRR pleurer - 1 freq |
PLEURER |
| Time to execute Levenshtein function - 0.218876 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.459464 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.029044 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.073367 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.001014 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. |