Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
sambies (0) - 1 freq sabies (1) - 13 freq lambies (1) - 4 freq samples (2) - 2 freq sannies (2) - 7 freq sammie's (2) - 1 freq gambles (2) - 2 freq sarnies (2) - 1 freq tammies (2) - 1 freq mammies (2) - 7 freq babies (2) - 28 freq jammies (2) - 14 freq ambles (2) - 2 freq sommies (2) - 3 freq babbies (2) - 13 freq sybies (2) - 1 freq dumbies (2) - 1 freq barbies (2) - 3 freq abies (2) - 3 freq saies (2) - 1 freq saxties (2) - 4 freq shambles (2) - 30 freq damies (2) - 1 freq sallies (2) - 3 freq rabies (2) - 2 freq |
sambies (0) - 1 freq lambies (2) - 4 freq sabies (2) - 13 freq sybies (3) - 1 freq zombies (3) - 6 freq dumbies (3) - 1 freq maybies (3) - 1 freq sommies (3) - 3 freq saabs (4) - 1 freq smuirs (4) - 3 freq sambucas (4) - 1 freq smokes (4) - 8 freq sumbidee (4) - 1 freq smiles (4) - 103 freq sam's (4) - 2 freq mbes (4) - 1 freq samba (4) - 1 freq smits (4) - 1 freq maybes (4) - 50 freq lambs (4) - 56 freq symbols (4) - 13 freq similes (4) - 1 freq sombidy (4) - 1 freq jambs (4) - 1 freq sybes (4) - 1 freq |
SoundEx code - S512 snaps - 23 freq snaabas - 1 freq snappishly - 2 freq sumphs - 8 freq snaaba's - 1 freq snuves - 1 freq sma-boukit - 2 freq symbiosis - 1 freq snobs - 1 freq snubs - 1 freq sniffs - 5 freq snipes - 3 freq scumbag - 2 freq scomfished - 3 freq sun-baked - 1 freq snawbaws - 1 freq snap-snap-snap - 1 freq shame-faced - 2 freq synapses - 1 freq simpsons' - 1 freq somepiece - 5 freq shampsin - 1 freq swanbister - 1 freq snipie's - 1 freq simpson - 10 freq sionifies - 1 freq swamps - 2 freq 'scomfish - 1 freq snuffbox - 2 freq shewin-box - 1 freq snuffs - 1 freq sumps - 1 freq skummfisht - 1 freq scomfishin - 2 freq scomfish - 2 freq snaabaas - 1 freq sea-myaavs - 1 freq snibs - 1 freq sham-faced - 1 freq snips - 2 freq snp's - 1 freq snapchat - 5 freq snobbish - 1 freq sambucas - 1 freq some-fuckin-hing - 1 freq scomfishes - 1 freq snps - 2 freq snapshots - 1 freq snapback - 1 freq symposium - 1 freq simpsons - 2 freq schnapps - 1 freq snpcommandments - 1 freq sambies - 1 freq snpsoosie - 4 freq simpsonuna - 1 freq snufkinn - 1 freq snpjlfgmj - 1 freq snpkdyofficial - 1 freq snpstudents - 1 freq snpkelvin - 1 freq |
MetaPhone code - SMS siem's - 1 freq seems - 517 freq seams - 6 freq smaas - 1 freq sums - 43 freq same's - 4 freq symes - 2 freq syme's - 1 freq seamus - 3 freq zombies - 6 freq seamaws - 2 freq seem's - 3 freq sea-maws - 4 freq sammie's - 1 freq sammy's - 4 freq seemes - 1 freq sooms - 3 freq sam's - 2 freq zumbas - 1 freq soums - 3 freq semi's - 1 freq semes - 2 freq smoosie - 2 freq sea-maws' - 1 freq siems - 2 freq sum's - 1 freq some's - 1 freq seumas - 17 freq cims - 1 freq 'syme's - 1 freq sie-mews - 1 freq smaws - 1 freq xmas - 48 freq sommies - 3 freq saems - 1 freq xmos - 1 freq semis - 4 freq sambies - 1 freq xxxmissy - 1 freq sma's - 1 freq |
SAMBIES |
Time to execute Levenshtein function - 0.210274 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.374714 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.031130 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.040764 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.000837 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. |