| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ornamints (0) - 2 freq ornaments (1) - 13 freq ornyments (2) - 1 freq ornament (2) - 7 freq ornyment (3) - 1 freq tinamint (3) - 1 freq armaments (3) - 1 freq ornamental (3) - 4 freq ornamentit (3) - 1 freq treatmints (3) - 1 freq ointments (3) - 1 freq greements (4) - 1 freq traists (4) - 1 freq drains (4) - 10 freq dynamite (4) - 10 freq ondings (4) - 1 freq prints (4) - 13 freq laments (4) - 9 freq graint (4) - 4 freq proafits (4) - 18 freq organises (4) - 1 freq proamises (4) - 1 freq rains (4) - 27 freq airmaments (4) - 1 freq origins (4) - 20 freq |
ornamints (0) - 2 freq ornaments (1) - 13 freq ornyments (2) - 1 freq ornament (3) - 7 freq ornamentit (4) - 1 freq ornamental (4) - 4 freq armaments (4) - 1 freq ornyment (4) - 1 freq moniments (5) - 5 freq arguments (5) - 23 freq adornments (5) - 1 freq airmaments (5) - 1 freq monuments (5) - 9 freq tenements (5) - 20 freq ointments (5) - 1 freq treatmints (5) - 1 freq nomintes (5) - 1 freq argiments (5) - 3 freq tinamint (5) - 1 freq torments (6) - 2 freq diamants (6) - 1 freq waments (6) - 1 freq lanmines (6) - 1 freq maments (6) - 1 freq ailmints (6) - 1 freq |
SoundEx code - O655 ornament - 7 freq ornamental - 4 freq ornaments - 13 freq ornamints - 2 freq ornyments - 1 freq ornamentation - 1 freq orraman - 3 freq ornamentit - 1 freq orra-man - 1 freq ornyment - 1 freq |
MetaPhone code - ORNMNTS ornaments - 13 freq ornamints - 2 freq ornyments - 1 freq |
ORNAMINTS |
| Time to execute Levenshtein function - 0.456705 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.508779 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.034103 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.041918 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.000987 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. |