Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
diveision (0) - 1 freq division (1) - 17 freq diversion (1) - 4 freq dimension (2) - 11 freq divisions (2) - 8 freq veision (2) - 2 freq dereision (2) - 2 freq diversions (2) - 2 freq diveesions (2) - 1 freq division' (2) - 1 freq deceision (2) - 5 freq diversioun (2) - 1 freq deveesion (2) - 1 freq divergin (3) - 1 freq iverson (3) - 1 freq davison (3) - 1 freq inversion (3) - 1 freq version (3) - 145 freq veisioun (3) - 2 freq devisin (3) - 7 freq reveisioun (3) - 1 freq digression (3) - 1 freq direction (3) - 123 freq proveision (3) - 6 freq misision (3) - 1 freq |
diveision (0) - 1 freq division (1) - 17 freq deveesion (2) - 1 freq diversion (2) - 4 freq devisin (3) - 7 freq diversioun (3) - 1 freq division' (3) - 1 freq davison (3) - 1 freq deceision (3) - 5 freq divisions (3) - 8 freq diveesions (3) - 1 freq veision (3) - 2 freq dereision (3) - 2 freq divisive (4) - 7 freq dividin (4) - 4 freq veesion (4) - 25 freq devensian (4) - 1 freq decision (4) - 87 freq revision (4) - 9 freq derision (4) - 8 freq vision (4) - 61 freq advisin (4) - 3 freq devosioun (4) - 1 freq deceesion (4) - 13 freq deceisioun (4) - 2 freq |
SoundEx code - D125 dobson's - 1 freq dobson - 4 freq devisins - 4 freq devisin - 7 freq deavesome - 1 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 - TFXN devotion - 21 freq division - 17 freq deveesion - 1 freq division' - 1 freq diveision - 1 freq devosioun - 1 freq |
DIVEISION |
Time to execute Levenshtein function - 0.189828 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.358253 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.028016 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.038440 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.000911 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. |