| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| norske (0) - 1 freq norskie (1) - 1 freq norse (1) - 53 freq norskes (1) - 1 freq forsake (2) - 1 freq noose (2) - 15 freq horse (2) - 237 freq norside (2) - 1 freq noise (2) - 152 freq norrie (2) - 20 freq nurse (2) - 169 freq horsie (2) - 7 freq norie (2) - 47 freq nursie (2) - 4 freq corse (2) - 2 freq gorse (2) - 6 freq nirski (2) - 3 freq forsee (2) - 1 freq norskies (2) - 1 freq noyse (2) - 1 freq nosie (2) - 1 freq norge (2) - 1 freq nose (2) - 216 freq nirse (2) - 1 freq worse (2) - 211 freq |
norske (0) - 1 freq norskie (1) - 1 freq nirski (2) - 3 freq norskes (2) - 1 freq norse (2) - 53 freq nurse (3) - 169 freq norskies (3) - 1 freq nirse (3) - 1 freq nursie (3) - 4 freq norside (3) - 1 freq forsake (3) - 1 freq nynorsk (4) - 2 freq nemsake (4) - 1 freq rooskie (4) - 1 freq horsikie (4) - 1 freq forsak (4) - 1 freq nordik (4) - 1 freq anorak (4) - 11 freq nurst (4) - 2 freq nursit (4) - 1 freq nursan (4) - 3 freq nursed (4) - 5 freq rsky (4) - 1 freq narky (4) - 1 freq nursin (4) - 29 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 - NRSK nirski - 3 freq norskie - 1 freq norske - 1 freq |
NORSKE |
| Time to execute Levenshtein function - 0.214573 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.346913 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.028364 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.038039 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.000884 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. |