| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| cdrom (0) - 2 freq chrom (1) - 1 freq edrom (1) - 1 freq cd-roms (2) - 1 freq crop (2) - 23 freq carol (2) - 62 freq droo (2) - 1 freq 'dom (2) - 2 freq drum (2) - 72 freq drome (2) - 1 freq drop (2) - 39 freq chrome (2) - 8 freq crow (2) - 10 freq doom (2) - 34 freq adom (2) - 1 freq from (2) - 594 freq crem (2) - 2 freq ceram (2) - 1 freq cram (2) - 2 freq drow (2) - 4 freq chrnm (2) - 1 freq rom (2) - 4 freq dom (2) - 3 freq carolm (2) - 2 freq -dom (2) - 2 freq |
cdrom (0) - 2 freq edrom (2) - 1 freq chrom (2) - 1 freq ceram (3) - 1 freq crem (3) - 2 freq crum (3) - 1 freq dram (3) - 115 freq chrome (3) - 8 freq drem (3) - 7 freq cdgm (3) - 1 freq cram (3) - 2 freq drome (3) - 1 freq drum (3) - 72 freq caudron (4) - 1 freq hodrum (4) - 1 freq charm (4) - 30 freq draim (4) - 5 freq dreem (4) - 3 freq creme (4) - 1 freq drama (4) - 95 freq bedroom (4) - 154 freq cherm (4) - 5 freq dreme (4) - 5 freq eduroam (4) - 1 freq chirm (4) - 1 freq |
SoundEx code - C365 chitterin - 44 freq catterwa'in - 1 freq cautrine - 3 freq caterans - 5 freq cateran - 3 freq ciatterin - 1 freq chatterin - 4 freq caterin - 4 freq citroen - 2 freq cdrom - 2 freq chatroom - 2 freq cheetran - 1 freq chittrin - 1 freq chittran - 1 freq cataran - 1 freq catherine - 12 freq cathrin - 1 freq cd-roms - 1 freq caudron - 1 freq catering - 1 freq chittering - 2 freq cuiterin - 1 freq catrina - 1 freq catherinemcker - 1 freq chitterin' - 1 freq catriona - 3 freq catrionakay - 14 freq cateraneco - 9 freq catherinemmunro - 3 freq catherinetinley - 1 freq |
MetaPhone code - KTRM cdrom - 2 freq |
CDROM |
| Time to execute Levenshtein function - 0.245660 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.457356 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.031714 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.048117 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.001181 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. |