Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
minerals (0) - 4 freq mineral (1) - 8 freq funerals (2) - 14 freq generals (2) - 2 freq miners (2) - 41 freq miner's (2) - 2 freq mieras (2) - 5 freq gineral (2) - 3 freq liberals (2) - 5 freq ainimals (3) - 4 freq missals (3) - 1 freq minerwell (3) - 1 freq minors (3) - 1 freq mieras's (3) - 1 freq miser's (3) - 1 freq intervals (3) - 2 freq meals (3) - 39 freq almerals (3) - 1 freq manuals (3) - 2 freq kintra's (3) - 11 freq mintal (3) - 1 freq mistral's (3) - 1 freq kinema's (3) - 1 freq minkers (3) - 3 freq generals' (3) - 1 freq |
minerals (0) - 4 freq mineral (2) - 8 freq miners (3) - 41 freq miner's (3) - 2 freq generals (3) - 2 freq funerals (3) - 14 freq minors (4) - 1 freq mainers (4) - 2 freq manuals (4) - 2 freq materials (4) - 60 freq mongrels (4) - 1 freq murals (4) - 8 freq gineral (4) - 3 freq morals (4) - 10 freq mieras (4) - 5 freq liberals (4) - 5 freq funeral' (5) - 1 freq fineries (5) - 1 freq minstrels (5) - 2 freq mines (5) - 63 freq gomerals (5) - 1 freq generall (5) - 1 freq misers (5) - 1 freq mixers (5) - 1 freq general (5) - 200 freq |
SoundEx code - M564 mineral - 8 freq memorial - 37 freq minerals - 4 freq memorials - 4 freq mannerly - 1 freq mennerly - 2 freq manorial - 1 freq €”memorials - 1 freq minerwell - 1 freq |
MetaPhone code - MNRLS minerals - 4 freq |
MINERALS |
Time to execute Levenshtein function - 0.346033 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.365089 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.027882 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.039188 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.000849 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. |