| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deservis (0) - 1 freq deservin (1) - 4 freq deserves (1) - 32 freq deservit (1) - 3 freq desertit (2) - 7 freq reserves (2) - 4 freq desers (2) - 1 freq decernis (2) - 1 freq reservin (2) - 1 freq desertin (2) - 2 freq desarves (2) - 1 freq reservist (2) - 3 freq deserts (2) - 8 freq reservit (2) - 5 freq deserved (2) - 58 freq deseruit (2) - 1 freq deserve (2) - 63 freq dervish (3) - 2 freq dervil (3) - 1 freq preservit (3) - 2 freq desseruit (3) - 1 freq desprait (3) - 2 freq debris (3) - 10 freq reservt (3) - 1 freq reserrs (3) - 1 freq |
deservis (0) - 1 freq deserves (1) - 32 freq desarves (2) - 1 freq deservit (2) - 3 freq deservin (2) - 4 freq deserts (3) - 8 freq deserved (3) - 58 freq desairves (3) - 2 freq deserve (3) - 63 freq desers (3) - 1 freq reserves (3) - 4 freq desertit (4) - 7 freq desirous (4) - 1 freq desertin (4) - 2 freq descrives (4) - 14 freq desires (4) - 10 freq observes (4) - 3 freq desarve (4) - 2 freq reservist (4) - 3 freq reservin (4) - 1 freq decernis (4) - 1 freq reservit (4) - 5 freq deseruit (4) - 1 freq serves (4) - 26 freq 'servin (5) - 1 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 - TSRFS deserves - 32 freq desarves - 1 freq disservice - 2 freq desairves - 2 freq deservis - 1 freq |
DESERVIS |
| Time to execute Levenshtein function - 0.213166 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.527865 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.055029 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.036614 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.000838 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. |