Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
solomon (0) - 32 freq solomons (1) - 2 freq saloon (2) - 1 freq solemn (2) - 25 freq soleman (2) - 2 freq soomin (2) - 7 freq solumn (2) - 1 freq solomon's (2) - 2 freq salmon (2) - 46 freq sookin (3) - 52 freq rooon (3) - 1 freq slooin (3) - 1 freq cloon (3) - 8 freq seemon (3) - 17 freq shoomin (3) - 1 freq schoon (3) - 1 freq soopin (3) - 7 freq sloumin (3) - 4 freq slook (3) - 2 freq soomed (3) - 7 freq dooron (3) - 5 freq solibox (3) - 1 freq cowmon (3) - 1 freq glomin (3) - 3 freq poloko (3) - 27 freq |
solomon (0) - 32 freq solumn (2) - 1 freq soleman (2) - 2 freq solemn (2) - 25 freq solomons (2) - 2 freq salmon (2) - 46 freq sloomin (3) - 1 freq saulmon (3) - 1 freq sloumin (3) - 4 freq soomin (3) - 7 freq saloon (3) - 1 freq yoleman (4) - 1 freq solemly (4) - 2 freq solvin (4) - 2 freq silicon (4) - 1 freq sclimin (4) - 1 freq slogan (4) - 10 freq loomin (4) - 9 freq salome (4) - 1 freq looman (4) - 1 freq salon (4) - 10 freq sloom (4) - 5 freq someman (4) - 1 freq slowan (4) - 1 freq sermon (4) - 29 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 - SLMN slammin - 18 freq solemn - 25 freq salmon - 46 freq saulmon - 1 freq solomon - 32 freq slammen - 1 freq slimmin - 4 freq sloumin - 4 freq solumn - 1 freq sloomin - 1 freq soleman - 2 freq |
SOLOMON |
Time to execute Levenshtein function - 0.218121 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.348631 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.029212 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.041500 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.001057 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. |