| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| turner (0) - 8 freq turned (1) - 491 freq burner (1) - 3 freq tuner (1) - 1 freq turnen (1) - 2 freq turne (1) - 1 freq gturner (1) - 1 freq tusker (2) - 2 freq funner (2) - 1 freq warner (2) - 1 freq murned (2) - 4 freq gurned (2) - 1 freq turnit (2) - 27 freq gunner (2) - 2 freq burker (2) - 2 freq turnis (2) - 6 freq earner (2) - 2 freq turse (2) - 1 freq tanner (2) - 10 freq turnt (2) - 621 freq sterner (2) - 1 freq thunner (2) - 73 freq turns (2) - 354 freq wunner (2) - 281 freq tunnel (2) - 85 freq |
turner (0) - 8 freq gturner (2) - 1 freq turnen (2) - 2 freq turne (2) - 1 freq tuner (2) - 1 freq burner (2) - 3 freq turned (2) - 491 freq girner (3) - 1 freq turneen (3) - 1 freq turr (3) - 1 freq turnip (3) - 4 freq terzer (3) - 1 freq tonner (3) - 1 freq torter (3) - 1 freq tinner (3) - 1 freq corner (3) - 317 freq turn (3) - 793 freq werner (3) - 1 freq turnkey (3) - 2 freq truer (3) - 5 freq turnie (3) - 2 freq tirned (3) - 24 freq thoner (3) - 2 freq turn' (3) - 1 freq tapner (3) - 2 freq |
SoundEx code - T656 tyremarks - 1 freq trainers - 46 freq trainer - 10 freq turner's - 2 freq turner - 8 freq tremor - 3 freq threehunner - 1 freq turnower - 2 freq turn-aroon - 1 freq toremore - 1 freq trimmer - 1 freq trainwreck - 1 freq terrymurden - 1 freq tyronmarshall - 1 freq |
MetaPhone code - TRNR trainer - 10 freq turner - 8 freq drainer - 2 freq |
TURNER |
| Time to execute Levenshtein function - 0.192316 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.317965 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.027081 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.036929 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.000898 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. |