| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dominance (0) - 11 freq dominate (2) - 4 freq dominant (2) - 19 freq dominatit (3) - 1 freq dominique (3) - 1 freq finance (3) - 14 freq dominic (3) - 3 freq dominie (3) - 66 freq dominated (3) - 3 freq ordinance (3) - 2 freq manance (3) - 2 freq nominate (3) - 1 freq predominance (3) - 2 freq domine (3) - 2 freq prominence (3) - 1 freq defiance (3) - 13 freq romance (3) - 39 freq dominatin (3) - 6 freq dominates (3) - 2 freq eminence (3) - 1 freq penance (4) - 2 freq dwinan (4) - 2 freq beirance (4) - 1 freq dosnae (4) - 4 freq dominies (4) - 23 freq |
dominance (0) - 11 freq dominant (3) - 19 freq manance (4) - 2 freq eminence (4) - 1 freq dominic (4) - 3 freq dominate (4) - 4 freq dominates (5) - 2 freq romance (5) - 39 freq dominion (5) - 4 freq dominions (5) - 1 freq defiance (5) - 13 freq denunce (5) - 1 freq adomnan (5) - 5 freq dominion' (5) - 1 freq dominatin (5) - 6 freq ordinance (5) - 2 freq finance (5) - 14 freq prominence (5) - 1 freq dominated (5) - 3 freq dominie (5) - 66 freq dominique (5) - 1 freq domine (5) - 2 freq dominatit (5) - 1 freq predominance (5) - 2 freq nance (6) - 7 freq |
SoundEx code - D555 dominance - 11 freq demeanin - 3 freq dominions - 1 freq dominant - 19 freq denomination - 1 freq dominion - 4 freq denominations - 5 freq dominion' - 1 freq dinnae-mention - 1 freq denominaation - 1 freq denominator - 1 freq denouement - 1 freq danhannanmep - 1 freq dinnaeyawnwhenskooshindeoderant - 1 freq |
MetaPhone code - TMNNS dominance - 11 freq dominions - 1 freq |
DOMINANCE |
| Time to execute Levenshtein function - 0.224927 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.424549 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.029080 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.039823 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.001015 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. |