| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| comrades (0) - 14 freq comrads (1) - 1 freq comrade (1) - 9 freq compares (2) - 7 freq compadres (2) - 1 freq cymrawes (2) - 3 freq conrad's (2) - 2 freq courries (3) - 1 freq craves (3) - 2 freq cottages (3) - 30 freq comes (3) - 962 freq comfae (3) - 1 freq crates (3) - 6 freq coinages (3) - 1 freq corroded (3) - 4 freq cochranes (3) - 1 freq cognates (3) - 7 freq curates (3) - 3 freq combines (3) - 15 freq codes (3) - 4 freq hordes (3) - 1 freq corries (3) - 15 freq commauns (3) - 2 freq consates (3) - 2 freq nomads (3) - 1 freq |
comrades (0) - 14 freq comrads (1) - 1 freq comrade (2) - 9 freq cymrawes (3) - 3 freq cords (4) - 5 freq camras (4) - 1 freq comaands (4) - 1 freq coards (4) - 1 freq compadres (4) - 1 freq compares (4) - 7 freq conrad's (4) - 2 freq commandos (5) - 1 freq companies (5) - 35 freq cornes (5) - 1 freq courses (5) - 13 freq compass (5) - 16 freq conrad (5) - 47 freq comradeship (5) - 2 freq coories (5) - 5 freq grades (5) - 10 freq parades (5) - 7 freq norrads (5) - 1 freq coads (5) - 1 freq trades (5) - 9 freq thrades (5) - 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 |
COMRADES |
| Time to execute Levenshtein function - 0.207594 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.356892 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.027650 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.037898 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.003951 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. |