| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ornyments (0) - 1 freq ornaments (1) - 13 freq ornyment (1) - 1 freq ornament (2) - 7 freq ointments (2) - 1 freq ornamints (2) - 2 freq moniments (3) - 5 freq oontment (3) - 1 freq ornamentit (3) - 1 freq ointment (3) - 5 freq arguments (3) - 23 freq monuments (3) - 9 freq greements (3) - 1 freq payments (3) - 3 freq argiments (3) - 3 freq adornments (3) - 1 freq fragments (3) - 6 freq argyment (3) - 2 freq torments (3) - 2 freq armaments (3) - 1 freq eyntments (3) - 1 freq ornamental (3) - 4 freq intments (3) - 1 freq peyments (3) - 5 freq tenements (3) - 20 freq |
ornyments (0) - 1 freq ornaments (1) - 13 freq ornamints (2) - 2 freq ornyment (2) - 1 freq ornament (3) - 7 freq argiments (4) - 3 freq adornments (4) - 1 freq armaments (4) - 1 freq monuments (4) - 9 freq tenements (4) - 20 freq arguments (4) - 23 freq ornamental (4) - 4 freq ornamentit (4) - 1 freq ointments (4) - 1 freq moniments (4) - 5 freq peyments (5) - 5 freq amenments (5) - 1 freq argiements (5) - 11 freq regiments (5) - 12 freq airmaments (5) - 1 freq airguments (5) - 2 freq intments (5) - 1 freq payments (5) - 3 freq eyntments (5) - 1 freq fragments (5) - 6 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 |
ORNYMENTS |
| Time to execute Levenshtein function - 0.215709 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.374598 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.027488 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.037826 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.000923 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. |