Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
keepers (0) - 16 freq keeper's (1) - 4 freq peepers (1) - 6 freq keeper (1) - 44 freq neepers (1) - 5 freq keppers (1) - 1 freq kempers (1) - 2 freq keekers (1) - 3 freq keepen (2) - 1 freq lepers (2) - 4 freq keep's (2) - 3 freq ee-ers (2) - 1 freq heefers (2) - 1 freq deeners (2) - 1 freq helpers (2) - 12 freq keiper (2) - 1 freq kelters (2) - 1 freq keeps (2) - 161 freq peypers (2) - 5 freq sleepers (2) - 4 freq cheepers (2) - 1 freq keener (2) - 6 freq teegers (2) - 36 freq leipers (2) - 2 freq kebbers (2) - 1 freq |
keepers (0) - 16 freq keppers (2) - 1 freq kempers (2) - 2 freq neepers (2) - 5 freq keekers (2) - 3 freq keeper's (2) - 4 freq peepers (2) - 6 freq keeper (2) - 44 freq peypers (3) - 5 freq keeps (3) - 161 freq kippers (3) - 7 freq paepers (3) - 2 freq keiper (3) - 1 freq neipers (3) - 2 freq leipers (3) - 2 freq reapers (3) - 2 freq keep's (3) - 3 freq lepers (3) - 4 freq keeped (4) - 1 freq kivers (4) - 3 freq speers (4) - 7 freq pers (4) - 1 freq uppers (4) - 2 freq paipers (4) - 5 freq pipers (4) - 10 freq |
SoundEx code - K162 kebbers - 1 freq kivers - 3 freq keepers - 16 freq kivvers - 5 freq kippers - 7 freq keppers - 1 freq keeper's - 4 freq kivverage - 1 freq kvrsliy - 1 freq keepersbaw - 1 freq keepyourgermstoyourself - 1 freq keprsga - 1 freq kevverage - 1 freq |
MetaPhone code - KPRS capers - 7 freq keepers - 16 freq gowpers - 2 freq kippers - 7 freq keppers - 1 freq keeper's - 4 freq coppers - 9 freq cooper's - 2 freq caprois - 1 freq cuprous - 1 freq coopers - 1 freq caper's - 1 freq coprse - 1 freq |
KEEPERS |
Time to execute Levenshtein function - 0.214076 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.326524 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.027556 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.037590 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.001043 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. |