| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weavers (0) - 9 freq leavers (1) - 1 freq wavers (1) - 1 freq weavers' (1) - 1 freq weaves (1) - 8 freq weaver (1) - 12 freq beavers (1) - 2 freq weathers (2) - 2 freq reapers (2) - 2 freq waaters (2) - 4 freq waders (2) - 4 freq weave (2) - 24 freq eaves (2) - 2 freq readers (2) - 87 freq reivers (2) - 17 freq veivers (2) - 1 freq 'havers (2) - 1 freq clavers (2) - 15 freq travers (2) - 4 freq quavers (2) - 2 freq slavers (2) - 12 freq wears (2) - 53 freq havers (2) - 35 freq heaves (2) - 2 freq beaver (2) - 3 freq |
weavers (0) - 9 freq wavers (1) - 1 freq weaver (2) - 12 freq weaves (2) - 8 freq beavers (2) - 2 freq weavers' (2) - 1 freq leavers (2) - 1 freq cavers (3) - 6 freq fevers (3) - 1 freq waters (3) - 18 freq havers (3) - 35 freq wave's (3) - 1 freq waves (3) - 137 freq peevers (3) - 1 freq levers (3) - 6 freq wears (3) - 53 freq wagers (3) - 1 freq savers (3) - 1 freq wavery (3) - 1 freq weers (3) - 16 freq reivers (3) - 17 freq waaters (3) - 4 freq veivers (3) - 1 freq quavers (3) - 2 freq waders (3) - 4 freq |
SoundEx code - W162 wipers - 4 freq weavers - 9 freq whaiver's - 2 freq wfirst - 2 freq wabwark - 3 freq wabwarks - 1 freq whoppers - 1 freq weavers' - 1 freq wavers - 1 freq wab-brousers - 1 freq |
MetaPhone code - WFRS weavers - 9 freq whaiver's - 2 freq weavers' - 1 freq wavers - 1 freq |
WEAVERS |
| Time to execute Levenshtein function - 0.186585 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.332085 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.027753 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.036767 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.000831 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. |