| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unromantic (0) - 1 freq €˜romantic (2) - 1 freq romantic (2) - 42 freq aromatic (3) - 2 freq romuntic (3) - 5 freq romantics (3) - 1 freq onomastics (4) - 2 freq pneumatic (4) - 1 freq undantit (4) - 1 freq thrombotic (4) - 1 freq somatic (4) - 1 freq unrelentin (4) - 3 freq automatic (4) - 11 freq unremittin (4) - 1 freq germanic (4) - 55 freq romancin (4) - 1 freq unprelatic (4) - 1 freq romania (4) - 1 freq unlamentin (4) - 1 freq semantic (4) - 11 freq idiomatic (4) - 3 freq unplantit (4) - 1 freq undemotic (4) - 1 freq enigmatic (4) - 6 freq unlamentit (4) - 1 freq |
unromantic (0) - 1 freq romantic (3) - 42 freq romuntic (4) - 5 freq €˜romantic (4) - 1 freq aromatic (5) - 2 freq romantics (5) - 1 freq enigmatic (6) - 6 freq undemotic (6) - 1 freq unlamentin (6) - 1 freq frantic (6) - 9 freq germanic (6) - 55 freq dramatic (6) - 28 freq unlamentit (6) - 1 freq semantic (6) - 11 freq neuromagnetic (6) - 1 freq unremittin (6) - 1 freq unrelentin (6) - 3 freq romanticise (7) - 1 freq unourament (7) - 1 freq mantc (7) - 1 freq nomintes (7) - 1 freq normandie (7) - 1 freq romance (7) - 37 freq tormentin (7) - 5 freq nominatit (7) - 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 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 unromantic - 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 - UNRMNTK unromantic - 1 freq |
UNROMANTIC |
| Time to execute Levenshtein function - 0.227059 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.416703 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.029444 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.038100 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.000827 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. |