Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
divisions (0) - 8 freq division' (1) - 1 freq division (1) - 17 freq devisins (2) - 4 freq diveesions (2) - 1 freq visions (2) - 7 freq diveision (2) - 1 freq decisions (2) - 29 freq diversions (2) - 2 freq provisions (3) - 12 freq derision (3) - 8 freq missions (3) - 3 freq dilations (3) - 1 freq delusions (3) - 3 freq dominions (3) - 1 freq misision (3) - 1 freq devotions (3) - 4 freq deceisions (3) - 2 freq divisive (3) - 7 freq dividin' (3) - 1 freq diversion's (3) - 1 freq civilians (3) - 2 freq davison (3) - 1 freq dividin (3) - 4 freq davidsons (3) - 3 freq |
divisions (0) - 8 freq division' (2) - 1 freq diveesions (2) - 1 freq devisins (2) - 4 freq division (2) - 17 freq deveesions (3) - 1 freq decisions (3) - 29 freq diversions (3) - 2 freq visions (3) - 7 freq diveision (3) - 1 freq davison (4) - 1 freq deceisions (4) - 2 freq davidsons (4) - 3 freq deecisions (4) - 1 freq devisin (4) - 7 freq invasions (4) - 1 freq devotions (4) - 4 freq delusions (4) - 3 freq revision (5) - 9 freq diversion (5) - 4 freq avysins (5) - 1 freq devosioun (5) - 1 freq divines (5) - 1 freq reveesions (5) - 1 freq deceesions (5) - 10 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 - TFXNS devotiouns - 1 freq devotions - 4 freq diveesions - 1 freq divisions - 8 freq deveesions - 1 freq |
DIVISIONS |
Time to execute Levenshtein function - 0.231828 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.555490 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.029445 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.070468 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.000841 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. |