Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
desirable (0) - 4 freq undesirable (2) - 1 freq despicable (2) - 1 freq veritable (3) - 2 freq reliable (3) - 5 freq undesirables (3) - 1 freq describable (3) - 1 freq miserable (3) - 56 freq heritable (3) - 4 freq meeserable (3) - 6 freq sitable (3) - 2 freq meiserable (3) - 1 freq bearable (3) - 5 freq debatable (3) - 1 freq desire (3) - 50 freq venerable (3) - 1 freq meisurable (3) - 2 freq repairable (3) - 1 freq desiree (3) - 1 freq memorable (3) - 10 freq meesrable (3) - 2 freq describe (3) - 43 freq vejitable (3) - 1 freq disable (3) - 1 freq reperable (3) - 1 freq |
desirable (0) - 4 freq undesirable (3) - 1 freq meiserable (4) - 1 freq meeserable (4) - 6 freq meesrable (4) - 2 freq meisurable (4) - 2 freq miserable (4) - 56 freq disable (4) - 1 freq despicable (4) - 1 freq memorable (5) - 10 freq desiree (5) - 1 freq miserably (5) - 3 freq describe (5) - 43 freq reperable (5) - 1 freq meeserably (5) - 1 freq adorable (5) - 8 freq repairable (5) - 1 freq deeable (5) - 1 freq venerable (5) - 1 freq undesirables (5) - 1 freq sitable (5) - 2 freq describable (5) - 1 freq bearable (5) - 5 freq debatable (5) - 1 freq desire (5) - 50 freq |
SoundEx code - D261 deserves - 32 freq 'deserve - 1 freq deserve - 63 freq describe - 43 freq descryvin - 2 freq descrive - 25 freq descrived - 18 freq descrivin - 9 freq described - 33 freq descreived - 4 freq deserved - 58 freq description - 38 freq descreeved - 1 freq describes - 19 freq descriving - 1 freq desairve - 1 freq decrepit - 3 freq describin - 11 freq desirable - 4 freq descreivit - 5 freq describit - 3 freq disruptive - 1 freq disrupt - 1 freq desarves - 1 freq desarve - 2 freq descrievit - 5 freq descriptive - 5 freq descriptors - 1 freq descrives - 14 freq disrepair - 3 freq deskrieve - 1 freq deskreived - 4 freq deskreivin - 1 freq deskreive - 2 freq disservice - 2 freq descrieves - 4 freq desairved - 1 freq discrepancy - 1 freq decriptive - 1 freq descryvit - 1 freq descreeptions - 1 freq descreive - 3 freq descrieve - 8 freq desairves - 2 freq desarivedly - 1 freq deservaidly - 1 freq descryve - 2 freq descreve - 1 freq disreputable - 1 freq describable - 1 freq digraphs - 4 freq digraph - 3 freq digraph's - 1 freq discribe - 2 freq describing - 2 freq descriptions - 3 freq descrption - 1 freq descrieved - 1 freq deservin - 4 freq disrupted - 1 freq deskrive - 1 freq descreivin - 1 freq descreeption - 1 freq deservedly - 1 freq disruption - 3 freq deservis - 1 freq descrievin - 1 freq deservit - 3 freq dscriptions - 1 freq descrivit - 2 freq descraib - 1 freq deskraibs - 2 freq deskraibd - 1 freq deskraiban - 1 freq djrobingalloway - 3 freq descripshin - 1 freq dwzrhypkhy - 1 freq dsreb - 1 freq dgriffinphoto - 1 freq |
MetaPhone code - TSRBL desirable - 4 freq |
DESIRABLE |
Time to execute Levenshtein function - 0.179487 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.373979 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.027605 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.037058 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.000864 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. |