| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| comrads (0) - 1 freq comrades (1) - 14 freq comrade (1) - 9 freq commands (2) - 4 freq commans (2) - 3 freq cora's (2) - 3 freq commas (2) - 3 freq camras (2) - 1 freq nomads (2) - 1 freq coards (2) - 1 freq compass (2) - 16 freq norrads (2) - 1 freq conrad's (2) - 2 freq cords (2) - 5 freq comaands (2) - 1 freq conrad (2) - 47 freq coads (2) - 1 freq charade (3) - 2 freq congrats (3) - 15 freq corss (3) - 9 freq orrals (3) - 13 freq gomerals (3) - 1 freq crabs (3) - 7 freq comrie (3) - 1 freq forays (3) - 2 freq |
comrads (0) - 1 freq comrades (1) - 14 freq comrade (2) - 9 freq cords (3) - 5 freq camras (3) - 1 freq comaands (3) - 1 freq coards (3) - 1 freq camera's (4) - 1 freq cerds (4) - 1 freq cooards (4) - 2 freq curds (4) - 3 freq cards (4) - 33 freq coowards (4) - 1 freq comer's (4) - 1 freq cruds (4) - 2 freq cairds (4) - 88 freq caerds (4) - 1 freq comers (4) - 2 freq cooerds (4) - 1 freq cowards (4) - 5 freq cymrawes (4) - 3 freq cameras (4) - 10 freq commas (4) - 3 freq conrad (4) - 47 freq coads (4) - 1 freq |
SoundEx code - C563 comrades - 14 freq comrade - 9 freq conrad - 47 freq conrod - 1 freq conrad's - 2 freq camaraderie - 4 freq channert - 3 freq comradeship - 2 freq comrade-like - 1 freq cummerit - 1 freq chunnert - 1 freq conrayed - 1 freq channered - 1 freq comrads - 1 freq comaraderie - 1 freq cammyrudkin - 12 freq counrty - 1 freq comaradory - 1 freq comradepangloss - 1 freq connord - 2 freq |
MetaPhone code - KMRTS comrades - 14 freq comrads - 1 freq |
COMRADS |
| Time to execute Levenshtein function - 0.208624 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.452693 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.027789 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.037231 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.000944 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. |