| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chaunces (0) - 6 freq chunces (1) - 8 freq chances (1) - 60 freq chaunce (1) - 49 freq chaunted (2) - 2 freq chainges (2) - 7 freq chanced (2) - 6 freq chuncer (2) - 3 freq chancel (2) - 1 freq chancer (2) - 19 freq chauncin (2) - 1 freq changes (2) - 58 freq chaucer (2) - 4 freq haunles (2) - 3 freq chancers (2) - 3 freq caunles (2) - 13 freq chunce (2) - 82 freq chaunts (2) - 2 freq chuncers (2) - 1 freq chaunties (2) - 1 freq chance (2) - 548 freq chunced (2) - 2 freq chuncey (2) - 1 freq chaenges (2) - 3 freq chance'd (3) - 1 freq |
chaunces (0) - 6 freq chances (1) - 60 freq chunces (1) - 8 freq chaunce (2) - 49 freq chuncers (3) - 1 freq chaunts (3) - 2 freq chunce (3) - 82 freq chaunties (3) - 1 freq chaenges (3) - 3 freq chancers (3) - 3 freq chunced (3) - 2 freq chance (3) - 548 freq chuncey (3) - 1 freq chuncer (3) - 3 freq chanced (3) - 6 freq chainges (3) - 7 freq chancer (3) - 19 freq chancel (3) - 1 freq chauncin (3) - 1 freq changes (3) - 58 freq chans (4) - 1 freq chices (4) - 1 freq chunse (4) - 15 freq chants (4) - 6 freq chunks (4) - 9 freq |
SoundEx code - C522 census - 101 freq coinages - 1 freq conquest - 6 freq chinges - 4 freq chances - 60 freq concoctions - 6 freq changes - 58 freq chynges - 53 freq camschachelt - 1 freq consciousness - 16 freq chynge-hoose - 2 freq concoction - 2 freq consequences - 18 freq consequence - 9 freq cheinges - 9 freq conjugal - 2 freq chainges - 7 freq consistency - 7 freq cheynges - 7 freq camsheuch - 2 freq chaynge's - 1 freq conscious - 24 freq concious - 4 freq chyngees - 1 freq concessiouns - 1 freq consisted - 3 freq coansecraitit - 1 freq chunces - 8 freq consist - 6 freq consigns - 1 freq cheenges - 1 freq chainsaaz - 1 freq consistently - 5 freq consistent - 19 freq concise - 13 freq concussion - 4 freq chaunces - 6 freq consecratit - 1 freq census' - 1 freq consists - 11 freq 'concise - 2 freq chenges - 16 freq concocted - 1 freq cheinge-houssis - 1 freq conseistit - 1 freq chaenges - 3 freq consisternt - 1 freq consiously - 1 freq consign - 1 freq cunzies - 1 freq consecutively - 1 freq censuses - 2 freq concoctin - 1 freq conquistadors - 1 freq consecrated - 1 freq camshuch - 1 freq conseistent - 1 freq conjectures - 1 freq concessions - 4 freq cynicism - 4 freq conseestin - 1 freq chainsaws - 1 freq connachs - 1 freq cannases - 1 freq camshachelt - 1 freq conjecture - 3 freq camshachalt - 1 freq conseestency - 1 freq conseistin - 1 freq €œconcussion - 1 freq conquests - 1 freq consistit - 2 freq consistentscots - 1 freq camshach - 1 freq concession - 2 freq consequential - 1 freq €™consequently - 1 freq consciously - 3 freq consistint - 2 freq chaenchis - 1 freq cheenchis - 2 freq conshis - 1 freq consequently - 1 freq consiÂ’s - 1 freq consis - 1 freq consi's - 1 freq changeasongtitletidoric - 12 freq comecoachwithme - 49 freq comecoachwime - 1 freq cwuhmukoxw - 1 freq |
MetaPhone code - XNSS chances - 60 freq chunces - 8 freq chainsaaz - 1 freq chaunces - 6 freq chainsaws - 1 freq |
CHAUNCES |
| Time to execute Levenshtein function - 0.204279 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.357920 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.027435 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.037045 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.000949 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. |