Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
norwick (0) - 1 freq borwick (1) - 1 freq lerwick (2) - 19 freq berwick (2) - 23 freq marwick (2) - 15 freq yorick (2) - 2 freq nordic (2) - 9 freq burwick (2) - 2 freq hoswick (2) - 1 freq warwick (2) - 7 freq nordik (2) - 1 freq notwork (3) - 4 freq forwird (3) - 2 freq vorlich (3) - 1 freq objick (3) - 1 freq larick (3) - 1 freq rodrick (3) - 21 freq brick (3) - 50 freq norries (3) - 5 freq novice (3) - 5 freq morice (3) - 1 freq jorvik (3) - 1 freq hooick (3) - 1 freq bollick (3) - 2 freq lerick (3) - 1 freq |
norwick (0) - 1 freq borwick (2) - 1 freq burwick (3) - 2 freq marwick (3) - 15 freq warwick (3) - 7 freq lerwick (3) - 19 freq berwick (3) - 23 freq inwick (4) - 3 freq yorick (4) - 2 freq nordik (4) - 1 freq crawick (4) - 1 freq hoswick (4) - 1 freq nordic (4) - 9 freq qwick (5) - 4 freq nock (5) - 14 freq rick (5) - 4 freq ferrick (5) - 1 freq tirrick (5) - 6 freq partick (5) - 12 freq verdick (5) - 1 freq renwick (5) - 18 freq forfock (5) - 1 freq norwa (5) - 3 freq craick (5) - 1 freq correck (5) - 3 freq |
SoundEx code - N620 nurse - 169 freq nark - 1 freq nuris - 1 freq norse - 53 freq newark - 1 freq nears - 3 freq narrows - 3 freq norraes - 2 freq norrie's - 4 freq naewhaurs - 1 freq nearg - 1 freq nories - 25 freq nyirs - 1 freq no'rich - 1 freq nourish - 2 freq norway's - 4 freq narky - 1 freq nirski - 3 freq nouriss - 3 freq nyargs - 1 freq nyargie - 2 freq noor's - 1 freq nursie - 4 freq norskie - 1 freq nihrc - 1 freq near-high - 1 freq nirse - 1 freq neirish - 2 freq nairaes - 1 freq nourice - 3 freq norries - 5 freq norske - 1 freq €¦nurse - 1 freq norwick - 1 freq norris - 1 freq narraes - 1 freq norge - 1 freq nwrj - 1 freq nayyar's - 1 freq nories- - 1 freq nrqx - 1 freq |
MetaPhone code - NRWK norwick - 1 freq |
NORWICK |
Time to execute Levenshtein function - 0.200034 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.377955 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.031668 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.038220 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.000977 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. |