| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ringostar (0) - 2 freq ringmaster (3) - 2 freq krissoutar (4) - 5 freq impostor (4) - 1 freq gangster (4) - 7 freq iniesta (4) - 1 freq singular (4) - 33 freq insear (4) - 1 freq kingseat (4) - 1 freq rigor (4) - 1 freq insofar (4) - 2 freq minotaur (4) - 20 freq hings-ah (4) - 2 freq rooster (4) - 18 freq rigoot (4) - 2 freq dunoottar (4) - 1 freq dinosaur (4) - 5 freq notar (4) - 2 freq sangster (4) - 24 freq ingest (4) - 2 freq ringer (4) - 6 freq instaw (4) - 1 freq hingoseed (4) - 1 freq hinmost (4) - 1 freq registrar (4) - 2 freq |
ringostar (0) - 2 freq ringmaster (4) - 2 freq sangster (5) - 24 freq bangster (5) - 4 freq register (5) - 77 freq ringmaister (5) - 2 freq gangster (5) - 7 freq youngster (6) - 2 freq ringlets (6) - 12 freq gangsta (6) - 1 freq mingsters (6) - 1 freq ragstore (6) - 1 freq kingston (6) - 2 freq inkster (6) - 1 freq sinister (6) - 10 freq fingtr (6) - 1 freq ringlet (6) - 1 freq yingist (6) - 1 freq ainster (6) - 2 freq ingested (6) - 3 freq registrar (6) - 2 freq reegistrar (6) - 1 freq rings (6) - 112 freq yingest (6) - 2 freq minister (6) - 67 freq |
SoundEx code - R522 rinses - 1 freq ramshackle - 6 freq ransacked - 2 freq ramseys - 1 freq rummages - 1 freq ringostar - 2 freq 'ramshackle - 1 freq reenges - 4 freq runcigill - 1 freq ranges - 2 freq ramsay's - 6 freq raingeese - 1 freq reinges - 5 freq ransack - 1 freq reimishis - 1 freq reneges - 1 freq re-engaged - 1 freq ransackin - 1 freq ryankeckler - 1 freq ronnycostello - 1 freq renniesusanc - 12 freq renniesusanc's - 1 freq ryanmcguigan - 1 freq |
MetaPhone code - RNKSTR ringostar - 2 freq |
RINGOSTAR |
| Time to execute Levenshtein function - 0.194896 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.392996 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.028684 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.038083 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.000944 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. |