| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| connord (0) - 2 freq concord (1) - 5 freq connor (1) - 5 freq conor (2) - 10 freq conned (2) - 1 freq conform (2) - 14 freq connery (2) - 5 freq confort (2) - 3 freq conrod (2) - 1 freq conner (2) - 2 freq coard (3) - 3 freq confound (3) - 1 freq onboard (3) - 2 freq confer (3) - 1 freq cornered (3) - 6 freq coonted (3) - 16 freq cord (3) - 18 freq concert (3) - 44 freq connie (3) - 2 freq connal (3) - 1 freq onno (3) - 20 freq canno- (3) - 1 freq concer (3) - 1 freq censors (3) - 1 freq o'connor (3) - 9 freq |
connord (0) - 2 freq concord (2) - 5 freq connor (2) - 5 freq conrod (3) - 1 freq conner (3) - 2 freq connery (3) - 5 freq conned (3) - 1 freq winnerd (4) - 1 freq cinner (4) - 1 freq cannery (4) - 1 freq hunnerd (4) - 2 freq canned (4) - 2 freq connerik (4) - 2 freq conneree (4) - 1 freq canner (4) - 1 freq cinners (4) - 4 freq conjured (4) - 9 freq scunnerd (4) - 5 freq sconnered (4) - 1 freq cunned (4) - 1 freq cornyard (4) - 2 freq contered (4) - 2 freq confort (4) - 3 freq conform (4) - 14 freq conor (4) - 10 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 - KNRT conrad - 47 freq conrod - 1 freq kinred - 2 freq kinraddie - 1 freq counrty - 1 freq connord - 2 freq kinnaird - 1 freq |
CONNORD |
| Time to execute Levenshtein function - 0.275735 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.427574 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.027776 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.036992 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.000871 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. |