| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| devisin (0) - 7 freq revisin (1) - 5 freq devisit (1) - 4 freq devisins (1) - 4 freq revision (2) - 9 freq derision (2) - 8 freq despisin (2) - 1 freq dividin (2) - 4 freq devydin (2) - 1 freq decidin (2) - 17 freq division (2) - 17 freq desisien (2) - 1 freq decision (2) - 86 freq deisil (2) - 1 freq derivin (2) - 1 freq deridin (2) - 1 freq devised (2) - 1 freq definin (2) - 4 freq deistin (2) - 3 freq revisit (2) - 3 freq eisin (2) - 1 freq devise (2) - 2 freq devotin (2) - 1 freq davison (2) - 1 freq devlin (2) - 1 freq |
devisin (0) - 7 freq davison (2) - 1 freq division (2) - 17 freq devisins (2) - 4 freq devisit (2) - 4 freq advisin (2) - 3 freq revisin (2) - 5 freq devlin (3) - 1 freq devotin (3) - 1 freq devise (3) - 2 freq deivin (3) - 1 freq devosioun (3) - 1 freq diveision (3) - 1 freq deveesion (3) - 1 freq devised (3) - 1 freq divinin (3) - 1 freq devisive (3) - 2 freq desisien (3) - 1 freq revision (3) - 9 freq dividin (3) - 4 freq derision (3) - 8 freq decision (3) - 86 freq devydin (3) - 1 freq desine (4) - 1 freq devine (4) - 3 freq |
SoundEx code - D125 dobson's - 1 freq dobson - 4 freq devisins - 4 freq devisin - 7 freq defusing - 1 freq division - 17 freq deficiencies - 1 freq deveesion - 1 freq deficient - 3 freq diveesions - 1 freq davison - 1 freq divisions - 8 freq diapason - 1 freq division' - 1 freq dubbieknowe - 2 freq diveision - 1 freq deficient' - 1 freq debasement - 1 freq debasements - 1 freq devosioun - 1 freq dowffsome - 1 freq deveesions - 1 freq davyshanks - 8 freq dvegxynyls - 1 freq davejmcgregor - 16 freq defqmha - 1 freq dafcnews - 1 freq daveshnedders - 1 freq dvkgmdqpco - 1 freq |
MetaPhone code - TFSN devisin - 7 freq davison - 1 freq |
DEVISIN |
| Time to execute Levenshtein function - 0.198802 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.445353 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.028412 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.036943 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.000761 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. |