| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| deveesion (0) - 1 freq deveesions (1) - 1 freq deceesion (1) - 13 freq dereeshion (2) - 4 freq deceision (2) - 5 freq reveesions (2) - 1 freq veesion (2) - 25 freq dereision (2) - 2 freq diveesions (2) - 1 freq deceesions (2) - 10 freq devensian (2) - 1 freq diversion (2) - 4 freq diveision (2) - 1 freq enveesion (2) - 1 freq decision (3) - 86 freq deceisioun (3) - 2 freq inversion (3) - 1 freq aversion (3) - 3 freq revision (3) - 9 freq eleision (3) - 1 freq delusion (3) - 3 freq derision (3) - 8 freq reveesitin (3) - 1 freq devosioun (3) - 1 freq everson (3) - 3 freq |
deveesion (0) - 1 freq diveision (2) - 1 freq deceesion (2) - 13 freq deveesions (2) - 1 freq devensian (3) - 1 freq diversion (3) - 4 freq enveesion (3) - 1 freq devosioun (3) - 1 freq dereision (3) - 2 freq deceision (3) - 5 freq devisin (3) - 7 freq division (3) - 17 freq veesion (3) - 25 freq diveesions (3) - 1 freq reveisioun (4) - 1 freq veision (4) - 2 freq desysion (4) - 1 freq deveron (4) - 1 freq derision (4) - 8 freq devotion (4) - 20 freq revision (4) - 9 freq reveesions (4) - 1 freq delusion (4) - 3 freq dereeshion (4) - 4 freq decision (4) - 86 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 - TFXN devotion - 20 freq division - 17 freq deveesion - 1 freq division' - 1 freq diveision - 1 freq devosioun - 1 freq |
DEVEESION |
| Time to execute Levenshtein function - 0.184196 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.422127 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.035886 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.045001 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.000805 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. |