| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| chesthairs (0) - 1 freq chesters (3) - 4 freq carstairs (3) - 1 freq cheshire (3) - 10 freq desairs (4) - 1 freq hertsair (4) - 3 freq thairs (4) - 14 freq chairs (4) - 69 freq chestitie (4) - 1 freq camstairy (4) - 2 freq stairs (4) - 209 freq chieftains (4) - 1 freq costgaird (4) - 1 freq cheaters (4) - 1 freq i'stairs (4) - 1 freq bestirs (4) - 2 freq cheptours (4) - 4 freq wheelchairs (4) - 1 freq cheddars (4) - 1 freq sweethairt (4) - 4 freq chestane (4) - 1 freq whethir (4) - 3 freq restairt (4) - 2 freq cheeters (4) - 1 freq cheptir (4) - 9 freq |
chesthairs (0) - 1 freq chesters (4) - 4 freq cheshire (5) - 10 freq carstairs (5) - 1 freq chepters (6) - 1 freq cheaters (6) - 1 freq chestnuts (6) - 5 freq chest's (6) - 2 freq heathers (6) - 1 freq chester (6) - 1 freq cheeters (6) - 1 freq cheptours (6) - 4 freq chests (6) - 7 freq chamchars (6) - 1 freq shoothers (7) - 26 freq chists (7) - 1 freq chanters (7) - 9 freq thestovies (7) - 22 freq healthers (7) - 1 freq ghosters (7) - 1 freq chastise (7) - 1 freq shithers (7) - 1 freq coasters (7) - 4 freq clusters (7) - 5 freq crashers (7) - 2 freq |
SoundEx code - C236 custart - 4 freq cistercian - 1 freq coasters - 4 freq coaster - 18 freq castrate - 2 freq custard - 15 freq cistern - 6 freq chak-strenthened - 1 freq casters - 2 freq castor-oil - 1 freq cast-iron - 1 freq castration - 1 freq custurt - 1 freq 'castor - 1 freq cheuchter - 1 freq 'castor' - 1 freq coquetry - 1 freq castrated - 1 freq castor - 3 freq caster - 2 freq chester - 1 freq chustdoowaer - 1 freq cash-tray - 1 freq custrin - 1 freq castrati - 1 freq castrato - 1 freq chesthairs - 1 freq coster - 1 freq chesters - 4 freq |
MetaPhone code - XS0RS chesthairs - 1 freq |
CHESTHAIRS |
| Time to execute Levenshtein function - 0.327239 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.698698 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.069976 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.047522 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.000833 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. |