| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| salmond (0) - 24 freq salmon (1) - 46 freq almond (1) - 4 freq lamond (2) - 1 freq saulmon (2) - 1 freq almonds (2) - 2 freq summond (2) - 1 freq carmond (2) - 4 freq twalmond (2) - 5 freq saicond (2) - 11 freq raymond (2) - 2 freq saecond (2) - 3 freq saloons (2) - 1 freq saumon (2) - 19 freq saloon (2) - 1 freq salon (2) - 10 freq stond (3) - 3 freq sallna (3) - 1 freq solomons (3) - 2 freq saison (3) - 20 freq saand (3) - 13 freq alyona (3) - 3 freq seicond (3) - 1 freq harmony (3) - 15 freq haldon (3) - 1 freq |
salmond (0) - 24 freq almond (2) - 4 freq salmon (2) - 46 freq saulmon (3) - 1 freq summond (3) - 1 freq lamond (3) - 1 freq solomons (4) - 2 freq salon (4) - 10 freq lomond (4) - 16 freq summoned (4) - 4 freq saloon (4) - 1 freq sealand (4) - 1 freq soumand (4) - 1 freq solomon (4) - 32 freq saloons (4) - 1 freq twalmond (4) - 5 freq carmond (4) - 4 freq almonds (4) - 2 freq saumon (4) - 19 freq saicond (4) - 11 freq raymond (4) - 2 freq saecond (4) - 3 freq salved (5) - 1 freq soond (5) - 399 freq palming (5) - 1 freq |
SoundEx code - S455 sclimmin - 18 freq slammin - 18 freq salmon - 46 freq salmon-leap - 1 freq slamannan - 1 freq saulmon - 1 freq solomon's - 2 freq solomons - 2 freq solomon - 32 freq slammen - 1 freq salamanca - 1 freq salmond - 24 freq 'salmon-ella' - 1 freq slimmin - 4 freq salmonella - 3 freq skaeliment - 1 freq sloumin - 4 freq sklimmin - 4 freq sloomin - 1 freq sclimin - 1 freq soleman - 2 freq |
MetaPhone code - SLMNT salmond - 24 freq |
SALMOND |
| Time to execute Levenshtein function - 0.409289 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.639387 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.059065 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.036884 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.000836 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. |