| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| waverley (0) - 6 freq wavery (2) - 1 freq wateren (3) - 2 freq havered (3) - 7 freq waveen (3) - 1 freq luverly (3) - 4 freq overly (3) - 6 freq waveran (3) - 1 freq wateries (3) - 1 freq davered (3) - 1 freq cleverley (3) - 1 freq averse (3) - 6 freq raverie (3) - 1 freq waverers (3) - 1 freq eagerly (3) - 31 freq marley (3) - 4 freq baurley (3) - 2 freq swavered (3) - 3 freq harley (3) - 7 freq waver (3) - 1 freq watery (3) - 8 freq waverin (3) - 1 freq waterloo (3) - 26 freq bareley (3) - 1 freq watered (3) - 6 freq |
waverley (0) - 6 freq wavery (3) - 1 freq waver (4) - 1 freq waterloo (4) - 26 freq waveran (4) - 1 freq waverin (4) - 1 freq luverly (4) - 4 freq wavers (4) - 1 freq warle (4) - 1 freq everly (4) - 1 freq beverly (4) - 3 freq overly (4) - 6 freq wavey (5) - 1 freq haiverel (5) - 1 freq calerlee (5) - 1 freq anerly (5) - 7 freq barley (5) - 33 freq weavers (5) - 9 freq severely (5) - 8 freq wyver (5) - 2 freq wiver (5) - 1 freq owerly (5) - 1 freq aiverel (5) - 1 freq warl (5) - 164 freq owerlay (5) - 1 freq |
SoundEx code - W164 waverley - 6 freq wwberldvy - 1 freq waverleybooks - 1 freq |
MetaPhone code - WFRL waverley - 6 freq |
WAVERLEY |
| Time to execute Levenshtein function - 0.369493 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.537806 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.060331 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.054843 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.001187 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. |