| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wiver (0) - 1 freq aiver (1) - 3 freq kiver (1) - 5 freq wiker (1) - 1 freq witer (1) - 2 freq wiser (1) - 26 freq siver (1) - 2 freq wives (1) - 42 freq diver (1) - 5 freq wiven (1) - 1 freq wive (1) - 1 freq niver (1) - 849 freq wiler (1) - 1 freq river (1) - 264 freq liver (1) - 34 freq wiher (1) - 1 freq fiver (1) - 46 freq wier (1) - 2 freq wider (1) - 54 freq wyver (1) - 2 freq iver (1) - 312 freq aver (2) - 4 freq tiger (2) - 27 freq owider (2) - 1 freq wave (2) - 129 freq |
wiver (0) - 1 freq wyver (1) - 2 freq wier (2) - 2 freq fiver (2) - 46 freq wiher (2) - 1 freq liver (2) - 34 freq wider (2) - 54 freq wavery (2) - 1 freq iwver (2) - 1 freq weaver (2) - 12 freq river (2) - 264 freq owver (2) - 1 freq iver (2) - 312 freq wiker (2) - 1 freq witer (2) - 2 freq wiler (2) - 1 freq kiver (2) - 5 freq aiver (2) - 3 freq siver (2) - 2 freq wiser (2) - 26 freq wive (2) - 1 freq niver (2) - 849 freq diver (2) - 5 freq wiven (2) - 1 freq wives (2) - 42 freq |
SoundEx code - W160 whoever - 15 freq whaever - 12 freq wiver - 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 - WFR whoever - 15 freq whaever - 12 freq wiver - 1 freq whaivver - 5 freq whaeever - 1 freq wafer - 2 freq weaver - 12 freq whaiver - 30 freq wha-ivir - 6 freq waffer - 1 freq €œwhaever - 1 freq wavery - 1 freq waahfer - 1 freq |
WIVER |
| Time to execute Levenshtein function - 0.348202 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.430644 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.027632 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.037096 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.000776 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. |