| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| keysersosse (0) - 2 freq keystrokes (5) - 1 freq bylerhoose (5) - 5 freq easterhoose (5) - 4 freq geysers (5) - 2 freq feeroese (5) - 1 freq keerious (5) - 3 freq gersoise (5) - 5 freq keerstee (5) - 2 freq espresso (6) - 4 freq jeemsons (6) - 1 freq weerless (6) - 2 freq temderness (6) - 1 freq meiserie (6) - 1 freq generous (6) - 21 freq neeborhoose (6) - 1 freq reserve (6) - 8 freq melrose (6) - 6 freq peterson (6) - 2 freq menseless (6) - 9 freq keppers (6) - 1 freq niedergasse (6) - 2 freq leprosie (6) - 8 freq evermore (6) - 2 freq sprosie (6) - 1 freq |
keysersosse (0) - 2 freq reassess (8) - 1 freq serssit (8) - 2 freq kaiser's (8) - 2 freq kinross (8) - 6 freq keerstee (8) - 2 freq gersoise (8) - 5 freq keystrokes (8) - 1 freq serss (8) - 1 freq geysers (8) - 2 freq keerious (8) - 3 freq kerless (8) - 1 freq guysers (9) - 2 freq deerness (9) - 3 freq surhoose (9) - 1 freq reservist (9) - 3 freq assess (9) - 8 freq reservists (9) - 1 freq keepersbaw (9) - 1 freq reserrs (9) - 1 freq kwerious (9) - 8 freq keess (9) - 10 freq eross (9) - 1 freq desers (9) - 1 freq kessock (9) - 1 freq |
SoundEx code - K262 keekers - 3 freq kickers - 1 freq kaiser's - 2 freq keeker-kistie - 2 freq kayakers - 1 freq keekersqeeker - 1 freq kickarse - 2 freq keysersosse - 2 freq kaiserchiefs - 2 freq |
MetaPhone code - KSRSS keysersosse - 2 freq |
KEYSERSOSSE |
| Time to execute Levenshtein function - 0.241878 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.444902 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.029390 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.041439 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.000913 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. |