| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ornaments (0) - 12 freq ornamints (1) - 2 freq ornament (1) - 5 freq ornyments (1) - 1 freq ornamentit (2) - 1 freq armaments (2) - 1 freq ointments (2) - 1 freq ornamental (2) - 3 freq ornyment (2) - 1 freq monuments (3) - 9 freq fragments (3) - 5 freq ointment (3) - 5 freq adornments (3) - 1 freq moniments (3) - 4 freq treatments (3) - 3 freq waments (3) - 1 freq laments (3) - 9 freq argiments (3) - 3 freq airmaments (3) - 1 freq tenements (3) - 19 freq filaments (3) - 1 freq tournament (3) - 8 freq oontment (3) - 1 freq arguments (3) - 23 freq torments (3) - 1 freq |
ornaments (0) - 12 freq ornamints (1) - 2 freq ornyments (1) - 1 freq ornament (2) - 5 freq ornamental (3) - 3 freq ornyment (3) - 1 freq armaments (3) - 1 freq ornamentit (3) - 1 freq argiments (4) - 3 freq tenements (4) - 19 freq arguments (4) - 23 freq moniments (4) - 4 freq airmaments (4) - 1 freq ointments (4) - 1 freq adornments (4) - 1 freq monuments (4) - 9 freq maments (5) - 1 freq eyntments (5) - 1 freq intments (5) - 1 freq amenments (5) - 1 freq argiements (5) - 11 freq airguments (5) - 2 freq torments (5) - 1 freq waments (5) - 1 freq treatments (5) - 3 freq |
SoundEx code - O655 ornamints - 2 freq ornyments - 1 freq ornament - 5 freq ornaments - 12 freq ornamentation - 1 freq orraman - 3 freq ornamentit - 1 freq ornamental - 3 freq orra-man - 1 freq ornyment - 1 freq |
MetaPhone code - ORNMNTS ornamints - 2 freq ornyments - 1 freq ornaments - 12 freq |
ORNAMENTS |
| Time to execute Levenshtein function - 0.324379 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.614057 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.079287 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.086785 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.000749 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. |