| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| debasements (0) - 1 freq debasement (1) - 1 freq basement (3) - 9 freq decorements (3) - 3 freq departments (3) - 1 freq easement (3) - 9 freq detachments (3) - 1 freq meuvements (4) - 1 freq tenements (4) - 19 freq bemusement (4) - 2 freq casement (4) - 3 freq moavements (4) - 1 freq settlements (4) - 4 freq waements (4) - 1 freq enactments (4) - 1 freq bazement (4) - 1 freq densemen (4) - 1 freq amusements (4) - 1 freq decorement (4) - 1 freq denouement (4) - 1 freq derailment (4) - 2 freq measurements (4) - 1 freq detachment (4) - 2 freq abatement (4) - 1 freq enagement (4) - 1 freq |
debasements (0) - 1 freq debasement (2) - 1 freq decorements (5) - 3 freq basement (5) - 9 freq amusements (6) - 1 freq detachments (6) - 1 freq departments (6) - 1 freq easement (6) - 9 freq engagements (7) - 3 freq elements (7) - 35 freq pavements (7) - 26 freq diamonts (7) - 3 freq vestments (7) - 1 freq placements (7) - 5 freq dissidents (7) - 2 freq abuliments (7) - 1 freq dissydents (7) - 4 freq diamants (7) - 1 freq dockiments (7) - 1 freq abatement (7) - 1 freq depairtments (7) - 17 freq adjustments (7) - 1 freq statements (7) - 19 freq embankments (7) - 1 freq documents (7) - 44 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 - TBSMNTS debasements - 1 freq |
DEBASEMENTS |
| Time to execute Levenshtein function - 0.202140 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.381429 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.027370 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.043973 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.000830 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. |