| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unoorament (0) - 1 freq unourament (1) - 1 freq interment (4) - 1 freq tournament (4) - 8 freq unforseen (4) - 1 freq endowment (4) - 1 freq instrument (4) - 27 freq oontment (4) - 1 freq unnerwent (4) - 1 freq enjoyment (4) - 7 freq sacrament (4) - 7 freq govrement (4) - 1 freq normen (4) - 1 freq ornament (4) - 7 freq assortment (4) - 2 freq enforcement (4) - 5 freq unfarrent (4) - 1 freq wunnerment (4) - 2 freq doormen (4) - 2 freq inrowment (4) - 1 freq decorement (4) - 1 freq anointment (4) - 1 freq endorsement (4) - 4 freq unherkent (4) - 1 freq torment (4) - 15 freq |
unoorament (0) - 1 freq unourament (1) - 1 freq oontment (5) - 1 freq enjoyment (5) - 7 freq torment (5) - 15 freq inrowment (5) - 1 freq interment (5) - 1 freq normen (5) - 1 freq enagement (6) - 1 freq garment (6) - 1 freq ointment (6) - 5 freq unherkent (6) - 1 freq iniment (6) - 1 freq ferment (6) - 4 freq raiment (6) - 2 freq normans (6) - 3 freq dormant (6) - 6 freq enjyement (6) - 1 freq endorsement (6) - 4 freq endearment (6) - 1 freq norman (6) - 58 freq foiranent (6) - 1 freq govrement (6) - 1 freq ornament (6) - 7 freq anointment (6) - 1 freq |
SoundEx code - U565 unerrinly - 1 freq unnerneath - 25 freq unreined - 1 freq unoorament - 1 freq unarmed - 5 freq unourament - 1 freq unnermine - 3 freq unairmed - 1 freq unromantic - 2 freq unhermed - 4 freq 'unhermed - 1 freq unhairmin - 1 freq unrimed - 1 freq unrantered - 1 freq unrunklin - 1 freq unrounded - 9 freq unroonded - 1 freq unremarkable - 2 freq unrung - 1 freq unnerin - 1 freq unharnessed - 1 freq unnerwent - 1 freq unnermines - 1 freq unremittin - 1 freq unrenewable - 2 freq unnerminin - 1 freq unhairmed - 1 freq unnernathe - 1 freq |
MetaPhone code - UNRMNT unoorament - 1 freq unourament - 1 freq |
UNOORAMENT |
| Time to execute Levenshtein function - 0.237097 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.455686 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.028706 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.048321 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.000886 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. |