Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
solidifies (0) - 1 freq modifies (3) - 1 freq slidies (3) - 1 freq solidarities (3) - 1 freq solidify (3) - 1 freq solidifyin (3) - 1 freq solids (4) - 1 freq shilfies (4) - 1 freq nobilities (4) - 1 freq satisfies (4) - 1 freq signifies (4) - 2 freq solicitous (4) - 2 freq modified (4) - 2 freq sionifies (4) - 1 freq solitrie (4) - 1 freq solid-wid (4) - 1 freq soldiered (4) - 1 freq modifier (4) - 1 freq specifies (4) - 2 freq modifiers (4) - 4 freq solicitors (4) - 2 freq policies (4) - 46 freq selfies (4) - 9 freq codified (4) - 4 freq slides (4) - 8 freq |
solidifies (0) - 1 freq solidifyin (4) - 1 freq solidify (4) - 1 freq slidies (4) - 1 freq soldiers (5) - 52 freq selfies (5) - 9 freq slides (5) - 8 freq modifies (5) - 1 freq solidarities (5) - 1 freq solids (5) - 1 freq shaidies (6) - 1 freq nullifies (6) - 1 freq solidarity (6) - 23 freq goldies (6) - 1 freq soldier (6) - 22 freq sliders (6) - 2 freq seignifies (6) - 1 freq sledges (6) - 1 freq soundies (6) - 2 freq solidlike (6) - 1 freq skiffies (6) - 2 freq oldies (6) - 1 freq smiddies (6) - 1 freq sionifies (6) - 1 freq soldiered (6) - 1 freq |
SoundEx code - S431 slate-pencil - 5 freq salt-borne - 1 freq should've - 18 freq sclate-pencil - 2 freq sellotape - 2 freq solidifies - 1 freq sellotape's - 1 freq solidifyin - 1 freq sellatape - 7 freq sullatober - 1 freq salt-pan - 1 freq sellotaped - 2 freq selataip - 1 freq seal'd-aff - 1 freq sealt-aff - 1 freq salutiffere - 1 freq selotaped - 1 freq solidify - 1 freq slutfraethenorth - 1 freq shouldve - 1 freq sulwathbrewers - 1 freq |
MetaPhone code - SLTFS solidifies - 1 freq |
SOLIDIFIES |
Time to execute Levenshtein function - 0.304708 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.785148 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.077727 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.038061 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.000920 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. |