| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sorner (0) - 3 freq sooner (1) - 29 freq corner (1) - 324 freq horner (1) - 2 freq sorners (1) - 2 freq joiner (2) - 14 freq sorny (2) - 2 freq soccer (2) - 4 freq toner (2) - 1 freq sores (2) - 3 freq sower (2) - 1 freq turner (2) - 8 freq solder (2) - 2 freq sorn (2) - 28 freq dormer (2) - 2 freq sorr (2) - 1 freq porter (2) - 14 freq borne (2) - 13 freq sored (2) - 1 freq sortet (2) - 4 freq owner (2) - 28 freq sarne (2) - 1 freq sortir (2) - 1 freq sojer (2) - 23 freq sodjer (2) - 7 freq |
sorner (0) - 3 freq sooner (2) - 29 freq horner (2) - 2 freq sorners (2) - 2 freq corner (2) - 324 freq ornar (3) - 4 freq warner (3) - 1 freq mourner (3) - 2 freq sorcery (3) - 1 freq hornier (3) - 1 freq shoner (3) - 1 freq coarner (3) - 47 freq suner (3) - 3 freq suiner (3) - 27 freq shaner (3) - 3 freq server (3) - 2 freq rouner (3) - 2 freq coroner (3) - 3 freq siner (3) - 1 freq shuner (3) - 1 freq spooner (3) - 1 freq sonar (3) - 1 freq shiner (3) - 3 freq earner (3) - 2 freq seener (3) - 14 freq |
SoundEx code - S656 shirramuir - 2 freq sorner - 3 freq share-owners - 1 freq sorners - 2 freq screenwriter - 1 freq shirramair - 1 freq scharnhorst - 1 freq sherramuir - 1 freq sarahmurphy - 1 freq |
MetaPhone code - SRNR sorner - 3 freq |
SORNER |
| Time to execute Levenshtein function - 0.234266 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.387638 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.031937 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.037190 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.000895 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. |