| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| weber (0) - 1 freq weeer (1) - 2 freq weyer (1) - 1 freq ueber (1) - 1 freq weer (1) - 68 freq eber (1) - 3 freq weeir (2) - 3 freq wede (2) - 10 freq mebe (2) - 1 freq wajer (2) - 1 freq weerg (2) - 1 freq 'eer (2) - 1 freq werner (2) - 1 freq wemen (2) - 16 freq efer (2) - 1 freq weaker (2) - 4 freq sewer (2) - 4 freq wheer (2) - 20 freq dewer (2) - 2 freq wiener (2) - 2 freq faber (2) - 1 freq geer (2) - 16 freq wler (2) - 1 freq sober (2) - 31 freq wiser (2) - 26 freq |
weber (0) - 1 freq eber (2) - 3 freq ueber (2) - 1 freq weer (2) - 68 freq weyer (2) - 1 freq weeer (2) - 2 freq waer (3) - 2 freq wager (3) - 9 freq uber (3) - 2 freq neeber (3) - 2 freq nebir (3) - 1 freq umber (3) - 2 freq wer (3) - 220 freq wiker (3) - 1 freq wider (3) - 54 freq we'r (3) - 42 freq bieber (3) - 1 freq aaber (3) - 22 freq cyber (3) - 4 freq lebor (3) - 1 freq wee'r (3) - 4 freq were (3) - 4095 freq ber (3) - 4 freq wee-er (3) - 29 freq amber (3) - 13 freq |
SoundEx code - W160 whoever - 15 freq whaever - 12 freq wiver - 1 freq waver - 1 freq whi'evvir - 1 freq whi'evir - 1 freq whaivver - 5 freq whaeever - 1 freq wafer - 2 freq weaver - 12 freq whaiver - 30 freq wha-ivir - 6 freq waffer - 1 freq wyver - 2 freq wapper - 2 freq €œwhaever - 1 freq weber - 1 freq wavery - 1 freq waahfer - 1 freq whopper - 3 freq wyper - 1 freq |
MetaPhone code - WBR weber - 1 freq |
WEBER |
| Time to execute Levenshtein function - 0.327077 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.555918 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.080922 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.100580 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.001214 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. |