| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| singapore (0) - 9 freq bangalore (3) - 1 freq singalong (3) - 1 freq pinafore (3) - 1 freq mingary (4) - 1 freq kingdome (4) - 2 freq galore (4) - 22 freq sycamore (4) - 7 freq sinkhole (4) - 1 freq singe (4) - 3 freq sippose (4) - 2 freq signatory (4) - 1 freq fingars (4) - 1 freq sincere (4) - 13 freq senator (4) - 2 freq ingiborg (4) - 2 freq lan-afore (4) - 1 freq singer (4) - 41 freq snare (4) - 13 freq inspire (4) - 24 freq kintore (4) - 4 freq singular (4) - 33 freq ping-pong (4) - 1 freq ringtone (4) - 1 freq swingpark (4) - 1 freq |
singapore (0) - 9 freq singer (5) - 41 freq singular (5) - 33 freq bangalore (5) - 1 freq inspire (6) - 24 freq snare (6) - 13 freq snore (6) - 6 freq snape (6) - 1 freq singers (6) - 54 freq sinatra (6) - 3 freq swingpark (6) - 1 freq pinafore (6) - 1 freq singan (6) - 12 freq singal (6) - 1 freq senator (6) - 2 freq sniper (6) - 3 freq single (6) - 241 freq saunpaper (6) - 1 freq mingary (6) - 1 freq sanger (6) - 1 freq singe (6) - 3 freq sincere (6) - 13 freq seingular (6) - 1 freq singalong (6) - 1 freq singis (7) - 1 freq |
SoundEx code - S521 sensible - 33 freq smoke-blackened - 1 freq singapore - 9 freq swingpark - 1 freq songbirds - 2 freq semi-quavers - 1 freq shinsplints - 2 freq sangbuik - 1 freq songbook - 1 freq snackbar - 1 freq sinsible - 1 freq songbird - 1 freq sunspots - 1 freq snakebake - 2 freq sangbeuks - 1 freq sinkfae - 1 freq snaa-covered - 1 freq sainsbury - 1 freq sensibly - 2 freq sainsbury's - 1 freq scenesofulster - 1 freq shanksybraniel - 1 freq snxvusgkj - 1 freq simchafisher - 2 freq swansofficial - 1 freq sneekyboy - 1 freq sensibeilities - 1 freq sangobeg - 1 freq snsbi - 1 freq smqscjpxza - 2 freq sonzyb - 2 freq |
MetaPhone code - SNKPR singapore - 9 freq |
SINGAPORE |
| Time to execute Levenshtein function - 0.183846 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.348744 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.028061 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.036789 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.000801 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. |