| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chappil (0) - 2 freq chappit (1) - 45 freq chappin (1) - 69 freq chappie (1) - 6 freq choppin (2) - 5 freq chapped (2) - 40 freq chappt (2) - 3 freq chaipel (2) - 11 freq chappin' (2) - 1 freq happin (2) - 16 freq clappin (2) - 46 freq clappie (2) - 3 freq happily (2) - 40 freq ehappin (2) - 1 freq crappit (2) - 4 freq shappin (2) - 5 freq chippie (2) - 10 freq crappin (2) - 11 freq cappit (2) - 3 freq chappies (2) - 1 freq chappy (2) - 2 freq cappin (2) - 1 freq chapit (2) - 1 freq clappit (2) - 46 freq champin (2) - 7 freq |
chappil (0) - 2 freq chappit (2) - 45 freq chappie (2) - 6 freq chappin (2) - 69 freq chapel (3) - 37 freq chappen (3) - 2 freq chippit (3) - 7 freq chappy (3) - 2 freq chippin (3) - 7 freq chippid (3) - 1 freq chapper (3) - 2 freq cuppil (3) - 1 freq chappan (3) - 5 freq chappies (3) - 1 freq chappaz (3) - 3 freq chappet (3) - 2 freq choppie (3) - 6 freq chaipel (3) - 11 freq happily (3) - 40 freq choppin (3) - 5 freq chippie (3) - 10 freq chappt (3) - 3 freq chapped (3) - 40 freq chipps (4) - 1 freq chippys (4) - 1 freq |
SoundEx code - C140 couple - 443 freq civil - 38 freq chaipel - 11 freq cuppla - 2 freq coble - 5 freq ceevil - 45 freq couplae - 3 freq chapel - 37 freq cupwally - 1 freq cupplie - 1 freq coupul - 7 freq cupple - 2 freq caybul - 1 freq cuppul - 1 freq cable - 12 freq cupola - 1 freq 'couple - 1 freq cheaply - 2 freq cobble - 5 freq ceevilly - 5 freq 'capela - 1 freq cïvil - 2 freq chappil - 2 freq coupla - 12 freq copula - 6 freq cabal - 2 freq chiefly - 5 freq cuppil - 1 freq ceivil - 6 freq chaiplie - 1 freq €˜chiefly - 1 freq cÃvil - 1 freq coupl'a - 1 freq couplay - 1 freq cpyl - 1 freq “civil - 1 freq cvl - 1 freq |
MetaPhone code - XPL chaipel - 11 freq chapel - 37 freq cheaply - 2 freq shapely - 2 freq chappil - 2 freq 'shapely - 1 freq chaiplie - 1 freq |
CHAPPIL |
| Time to execute Levenshtein function - 0.209787 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.373508 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.027951 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.036580 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.000936 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. |