| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beverage (0) - 3 freq beverages (1) - 1 freq leverage (1) - 4 freq beveridge (2) - 3 freq coverage (2) - 15 freq average (2) - 29 freq kevverage (2) - 1 freq sewerage (2) - 2 freq generate (3) - 4 freq peerages (3) - 1 freq reverie (3) - 2 freq teenage (3) - 22 freq seperate (3) - 2 freq everyane (3) - 1 freq heretage (3) - 1 freq behere (3) - 2 freq ceterae (3) - 1 freq severe (3) - 15 freq kivverage (3) - 1 freq reverant (3) - 3 freq beeame (3) - 1 freq belgrade (3) - 1 freq borage (3) - 2 freq everee (3) - 1 freq beenge (3) - 1 freq |
beverage (0) - 3 freq leverage (2) - 4 freq beverages (2) - 1 freq average (3) - 29 freq coverage (3) - 15 freq beveridge (3) - 3 freq verge (4) - 9 freq beverly (4) - 3 freq barrage (4) - 2 freq borage (4) - 2 freq bevridge (4) - 1 freq sewerage (4) - 2 freq kevverage (4) - 1 freq revenge (5) - 23 freq enrage (5) - 3 freq brokerage (5) - 1 freq beragh (5) - 2 freq berate (5) - 1 freq revere (5) - 1 freq veelage (5) - 12 freq steerage (5) - 6 freq brag (5) - 9 freq bruge (5) - 1 freq bavarie (5) - 1 freq braga (5) - 1 freq |
SoundEx code - B162 bifrost - 2 freq beverages - 1 freq beverage - 3 freq bifröst - 1 freq buffers - 1 freq behaviours - 2 freq beavers - 2 freq |
MetaPhone code - BFRJ beveridge - 3 freq beverage - 3 freq bevridge - 1 freq |
BEVERAGE |
| Time to execute Levenshtein function - 0.224119 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.392296 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.028005 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.037786 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.000914 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. |