| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| werrers (0) - 1 freq weavers (2) - 9 freq warkers (2) - 43 freq werner (2) - 1 freq merters (2) - 1 freq terrors (2) - 3 freq wersels (2) - 1 freq weires (2) - 1 freq servers (2) - 1 freq weers (2) - 16 freq fermers (2) - 90 freq workers (2) - 34 freq welders (2) - 2 freq ferrets (2) - 10 freq wirkers (2) - 20 freq bearers (2) - 5 freq terriers (2) - 1 freq merkers (2) - 1 freq nerrer (2) - 2 freq ferriers (2) - 1 freq errors (2) - 7 freq ferrer (2) - 8 freq werker (2) - 2 freq wurkers (2) - 6 freq ferrero (2) - 1 freq |
werrers (0) - 1 freq errors (3) - 7 freq wirkers (3) - 20 freq warriors (3) - 20 freq terriers (3) - 1 freq workers (3) - 34 freq ferriers (3) - 1 freq wurkers (3) - 6 freq weirriors (3) - 1 freq terrors (3) - 3 freq warkers (3) - 43 freq worries (4) - 63 freq wurries (4) - 2 freq worrier (4) - 1 freq waverers (4) - 1 freq mirrors (4) - 25 freq waarkers (4) - 4 freq wurkirs (4) - 1 freq carriers (4) - 2 freq harriers (4) - 2 freq wirries (4) - 10 freq warriours (4) - 2 freq weiriors (4) - 1 freq weirriours (4) - 3 freq writers (4) - 92 freq |
SoundEx code - W662 warriours - 2 freq warriors - 20 freq weirriours - 3 freq warriors' - 1 freq weiriors - 1 freq weirriors - 1 freq warrior's - 1 freq weir-horss - 1 freq werrers - 1 freq |
MetaPhone code - WRRS warriours - 2 freq warriors - 20 freq weirriours - 3 freq warriors' - 1 freq weiriors - 1 freq weirriors - 1 freq warrior's - 1 freq werrers - 1 freq |
WERRERS |
| Time to execute Levenshtein function - 0.396188 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.541576 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.062751 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.078180 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.001035 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. |