| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ornyment (0) - 1 freq ornyments (1) - 1 freq ornament (1) - 7 freq oontment (2) - 1 freq ointment (2) - 5 freq ornaments (2) - 13 freq argyment (2) - 2 freq tenement (3) - 21 freq eyntment (3) - 2 freq ointments (3) - 1 freq argiment (3) - 2 freq raiment (3) - 2 freq govrnement (3) - 2 freq peyment (3) - 6 freq onyene (3) - 1 freq liniment (3) - 1 freq orient (3) - 1 freq tournament (3) - 8 freq iniment (3) - 1 freq monument (3) - 16 freq rolment (3) - 1 freq airgyment (3) - 6 freq greement (3) - 20 freq fornent (3) - 35 freq ornamentit (3) - 1 freq |
ornyment (0) - 1 freq ornament (1) - 7 freq ornyments (2) - 1 freq ornaments (3) - 13 freq argyment (3) - 2 freq tournament (4) - 8 freq liniment (4) - 1 freq moniment (4) - 9 freq iniment (4) - 1 freq airgyment (4) - 6 freq ornamints (4) - 2 freq monument (4) - 16 freq rolment (4) - 1 freq argiment (4) - 2 freq tenement (4) - 21 freq ointment (4) - 5 freq oontment (4) - 1 freq argument (4) - 80 freq ornamental (4) - 4 freq ornamentit (4) - 1 freq raiment (4) - 2 freq argiement (5) - 25 freq payment (5) - 4 freq kinmont (5) - 3 freq griement (5) - 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 - ORNMNT ornament - 7 freq ornyment - 1 freq |
ORNYMENT |
| Time to execute Levenshtein function - 0.267555 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.847170 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.027686 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.091700 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.000922 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. |