Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
strick (2) - 13 freq prick (2) - 70 freq derick (2) - 1 freq kingrick (2) - 2 freq trick (2) - 68 freq lerick (2) - 1 freq kangrick (2) - 6 freq africk (2) - 1 freq rurick (2) - 1 freq larick (2) - 1 freq yorick (2) - 2 freq rick (2) - 4 freq brick (2) - 48 freq norwick (2) - 1 freq grice (2) - 38 freq nick (2) - 133 freq gleck (3) - 1 freq shriek (3) - 21 freq brikk (3) - 3 freq nark (3) - 1 freq laricks (3) - 1 freq drink (3) - 548 freq rink (3) - 14 freq doricy (3) - 1 freq jonick (3) - 10 freq |
kangrick (3) - 6 freq kingrick (3) - 2 freq brick (4) - 48 freq rick (4) - 4 freq norwick (4) - 1 freq grice (4) - 38 freq strick (4) - 13 freq negleck (4) - 7 freq yorick (4) - 2 freq nick (4) - 133 freq derick (4) - 1 freq prick (4) - 70 freq larick (4) - 1 freq trick (4) - 68 freq lerick (4) - 1 freq africk (4) - 1 freq rurick (4) - 1 freq rodrick (5) - 21 freq 'grice' (5) - 3 freq heyrick (5) - 2 freq crock (5) - 13 freq breck (5) - 9 freq trock (5) - 12 freq neesick (5) - 1 freq greik (5) - 1 freq |
SoundEx code - N262 newcraighall - 2 freq ngers - 1 freq nokers - 1 freq nicaragua - 2 freq neisseria's - 1 freq nasser's - 1 freq noseyers - 1 freq new-gurgin - 1 freq nashers - 2 freq nacrous - 1 freq nicaraguans - 1 freq nickers - 1 freq newsreggaemusic - 1 freq newsorkney - 1 freq njiwercmzx - 1 freq noccers - 1 freq naysayers - 1 freq |
MetaPhone code - NKRK nicaragua - 2 freq |
NGRICK |
Time to execute Levenshtein function - 0.579648 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.900077 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.029741 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.104642 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.000959 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. |