| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tenements (0) - 19 freq tenement (1) - 21 freq tenenent (2) - 1 freq tennents (2) - 5 freq elements (2) - 35 freq leemets (3) - 1 freq 'elements' (3) - 1 freq moniments (3) - 4 freq movements (3) - 9 freq element (3) - 45 freq atonement (3) - 1 freq clements (3) - 1 freq vestments (3) - 1 freq statements (3) - 19 freq regiments (3) - 12 freq eyntments (3) - 1 freq tennent's (3) - 6 freq peyments (3) - 5 freq teemen (3) - 2 freq amenments (3) - 1 freq leemeets (3) - 1 freq monuments (3) - 9 freq waements (3) - 1 freq mevement (3) - 1 freq muvements (3) - 3 freq |
tenements (0) - 19 freq tenement (2) - 21 freq tennents (3) - 5 freq torments (4) - 1 freq ornyments (4) - 1 freq ornaments (4) - 12 freq monuments (4) - 9 freq tennants (4) - 1 freq atonement (4) - 1 freq tenants (4) - 12 freq amenments (4) - 1 freq elements (4) - 35 freq tenenent (4) - 1 freq moniments (4) - 4 freq tenentis (4) - 1 freq pyements (5) - 1 freq treatments (5) - 3 freq elemints (5) - 1 freq segments (5) - 2 freq testaments (5) - 4 freq teemins (5) - 1 freq meuvements (5) - 1 freq tinints (5) - 2 freq tinamint (5) - 1 freq intments (5) - 1 freq |
SoundEx code - T555 tenement - 21 freq tenements - 19 freq tenenent - 1 freq tinamint - 1 freq |
MetaPhone code - TNMNTS tenements - 19 freq |
TENEMENTS |
| Time to execute Levenshtein function - 0.187679 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.403417 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.029903 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.073654 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.000823 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. |