| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| disarm (0) - 1 freq diary (2) - 42 freq dysart (2) - 8 freq disarmin (2) - 1 freq disa- (2) - 1 freq dispare (2) - 1 freq discard (2) - 1 freq disays (2) - 1 freq cesar (3) - 2 freq dist (3) - 18 freq disband (3) - 2 freq harm (3) - 22 freq disney (3) - 19 freq draar (3) - 6 freq deserr (3) - 1 freq diem (3) - 2 freq dishie (3) - 4 freq disagreh (3) - 1 freq disdain (3) - 10 freq dinah' (3) - 1 freq discord (3) - 5 freq airm (3) - 358 freq isa's (3) - 8 freq rosary (3) - 6 freq draem (3) - 15 freq |
disarm (0) - 1 freq disarmin (3) - 1 freq dysart (3) - 8 freq diagram (4) - 3 freq desairs (4) - 1 freq draem (4) - 15 freq dream (4) - 259 freq disarray (4) - 2 freq desire (4) - 52 freq deism (4) - 1 freq desers (4) - 1 freq dram (4) - 115 freq desair (4) - 1 freq desarve (4) - 2 freq desert (4) - 60 freq desir (4) - 1 freq dismae (4) - 1 freq dismay (4) - 15 freq draim (4) - 5 freq deserr (4) - 1 freq deform (4) - 1 freq disays (4) - 1 freq dispare (4) - 1 freq discard (4) - 1 freq disa- (4) - 1 freq |
SoundEx code - D265 deecernin - 1 freq discern - 7 freq disarmin - 1 freq disorientating - 1 freq disgruntled - 6 freq discrimination - 20 freq degerent - 1 freq diagram - 3 freq discerned - 2 freq discernin - 2 freq decorement - 1 freq decorements - 3 freq discriminators - 1 freq disremember - 2 freq disremembers - 1 freq discriminated - 2 freq disorientin - 2 freq disgreements - 1 freq discriminatory - 2 freq discreeminate - 1 freq decernis - 1 freq decern - 2 freq discernt - 1 freq disgruntilt - 1 freq discernible - 1 freq discrimination' - 1 freq disarm - 1 freq decorum - 3 freq disoriented - 1 freq discreemination - 1 freq diachronically - 1 freq disorientated - 1 freq discriminate - 3 freq decreeing - 1 freq discriminatit - 1 freq |
MetaPhone code - TSRM disarm - 1 freq |
DISARM |
| Time to execute Levenshtein function - 0.404444 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.685619 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.091976 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.104005 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.001022 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. |