| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| door-cheek (0) - 3 freq door-chik (2) - 1 freq door-cheek's (2) - 1 freq door-sneck (3) - 1 freq oorichie (4) - 1 freq boorichie (4) - 1 freq boorachie (4) - 4 freq soor-sweet (4) - 1 freq doon-deep (4) - 1 freq door-bell (4) - 1 freq boorochie (4) - 1 freq oo-wheel (4) - 1 freq doon-here (4) - 1 freq goochee' (4) - 1 freq boorachies (4) - 3 freq oot-comes (5) - 1 freq scorcher (5) - 4 freq doun-come (5) - 1 freq donnachie (5) - 1 freq doun-here (5) - 1 freq doon-hoi (5) - 1 freq door-gap (5) - 1 freq soor-dook (5) - 1 freq pooche's (5) - 1 freq oer-het (5) - 1 freq |
door-cheek (0) - 3 freq door-chik (2) - 1 freq door-cheek's (4) - 1 freq door-sneck (6) - 1 freq doon-here (7) - 1 freq boorochie (7) - 1 freq dour-like (7) - 1 freq door-bell (7) - 1 freq drochle (7) - 5 freq boorachies (7) - 3 freq oorichie (7) - 1 freq boorichie (7) - 1 freq boorachie (7) - 4 freq douche (8) - 1 freq door-jamb (8) - 1 freq drachy (8) - 1 freq boorach (8) - 31 freq torche (8) - 8 freq boorachs (8) - 1 freq booroch (8) - 1 freq doorkey (8) - 1 freq bow-cheir (8) - 3 freq forcheid (8) - 1 freq doon-cry (8) - 1 freq rosy-cheeked (8) - 1 freq |
SoundEx code - D622 dresses - 18 freq door-cheek - 3 freq darkest - 16 freq dairkest - 3 freq derkest - 2 freq darkish - 1 freq daurkest - 5 freq druggies - 1 freq drakes - 2 freq door-cheek's - 1 freq driechest - 2 freq door-chik - 1 freq darkies - 2 freq dreichest - 2 freq derkies - 1 freq dirges - 1 freq dregies - 1 freq dreich-as-cauld-parritch - 1 freq durexuk - 1 freq drkkhgagrj - 1 freq doricocd - 1 freq derekweston - 5 freq drxuaywz - 1 freq darcyoake - 2 freq drjoshuawolrich - 1 freq |
MetaPhone code - TRXK door-cheek - 3 freq door-chik - 1 freq |
DOOR-CHEEK |
| Time to execute Levenshtein function - 0.226164 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.389129 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.027886 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.038399 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.000939 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. |