| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spanner (0) - 11 freq spanker (1) - 1 freq spanners (1) - 5 freq spinner (1) - 1 freq shanner (1) - 1 freq scanner (1) - 1 freq spanned (1) - 1 freq sanners (2) - 2 freq stannert (2) - 3 freq danner (2) - 13 freq spencer (2) - 16 freq spenser (2) - 1 freq spaniel (2) - 4 freq shanter (2) - 18 freq tanner (2) - 10 freq panned (2) - 7 freq spalter (2) - 2 freq panzer (2) - 1 freq spankers (2) - 2 freq sander (2) - 1 freq ganner (2) - 1 freq ponner (2) - 1 freq spanged (2) - 2 freq planner (2) - 4 freq scanned (2) - 13 freq |
spanner (0) - 11 freq spinner (1) - 1 freq scanner (2) - 1 freq shanner (2) - 1 freq spanned (2) - 1 freq spanners (2) - 5 freq spanker (2) - 1 freq stunner (3) - 9 freq scunner (3) - 97 freq spennen (3) - 1 freq skinner (3) - 1 freq shinner (3) - 1 freq spannt (3) - 1 freq spinne (3) - 2 freq ponner (3) - 1 freq skunner (3) - 3 freq spunder (3) - 1 freq shunner (3) - 2 freq spannin (3) - 4 freq spooner (3) - 1 freq sinner (3) - 10 freq spencer (3) - 16 freq spenser (3) - 1 freq pander (4) - 1 freq banner (4) - 19 freq |
SoundEx code - S156 seven-year - 2 freq souvenir - 5 freq submerged - 6 freq seiven-year - 1 freq spaniards - 1 freq submarine - 5 freq submarines - 3 freq spanner - 11 freq spanners - 5 freq shopowner - 1 freq souvenirs - 6 freq spooner - 1 freq skippin-rope - 1 freq spammers - 2 freq scvunnered - 1 freq spinner - 1 freq submerge - 1 freq spinyorra - 1 freq spaniard - 1 freq sgfwmrvscs - 1 freq |
MetaPhone code - SPNR spanner - 11 freq spooner - 1 freq spinner - 1 freq |
SPANNER |
| Time to execute Levenshtein function - 0.275333 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.485467 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.027270 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.037151 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.000892 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. |