| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wannerer (0) - 1 freq wannered (1) - 3 freq wanneret (1) - 1 freq wanderer (1) - 5 freq mannered (2) - 1 freq wanner (2) - 17 freq wanderers (2) - 44 freq wannerin (2) - 9 freq waanderer (2) - 2 freq wannert (2) - 22 freq winneret (2) - 1 freq wann'er (2) - 1 freq wunnered (2) - 43 freq wanners (2) - 3 freq wandered (2) - 22 freq dannered (2) - 1 freq winnered (2) - 7 freq channered (3) - 1 freq annexe (3) - 1 freq conneree (3) - 1 freq wagners (3) - 1 freq wanderit (3) - 2 freq daunnered (3) - 1 freq manere (3) - 2 freq wunnerfu (3) - 56 freq |
wannerer (0) - 1 freq wannered (2) - 3 freq wanderer (2) - 5 freq wanneret (2) - 1 freq wann'er (3) - 1 freq wunnered (3) - 43 freq wannert (3) - 22 freq winnered (3) - 7 freq wanners (3) - 3 freq winneret (3) - 1 freq wanner (3) - 17 freq wannerin (3) - 9 freq waanderer (3) - 2 freq waunners (4) - 2 freq wunnerd (4) - 1 freq wonnerin (4) - 9 freq wonners (4) - 1 freq wunnerfa (4) - 1 freq wonner (4) - 5 freq winnert (4) - 40 freq winnerin (4) - 23 freq waunnerin (4) - 3 freq wunnerin (4) - 82 freq wonnerfu (4) - 3 freq wunnerit (4) - 2 freq |
SoundEx code - W566 wannerer - 1 freq |
MetaPhone code - WNRR wannerer - 1 freq |
WANNERER |
| Time to execute Levenshtein function - 0.618832 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 - 1.311476 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.091605 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.116400 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.000989 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. |