| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| norskie (0) - 1 freq norske (1) - 1 freq norskies (1) - 1 freq rooskie (2) - 1 freq norie (2) - 47 freq yorkie (2) - 5 freq horsie (2) - 7 freq nursie (2) - 4 freq nookie (2) - 2 freq norrie (2) - 20 freq porkie (2) - 1 freq workie (2) - 1 freq norskes (2) - 1 freq nosie (2) - 1 freq nirski (2) - 3 freq forkie (2) - 4 freq horsikie (2) - 1 freq norse (2) - 53 freq norside (2) - 1 freq tooskit (3) - 1 freq workit (3) - 22 freq nurse (3) - 169 freq whuskie (3) - 6 freq nories (3) - 25 freq horsis (3) - 3 freq |
norskie (0) - 1 freq norske (1) - 1 freq nirski (2) - 3 freq norskies (2) - 1 freq horsikie (3) - 1 freq norskes (3) - 1 freq norse (3) - 53 freq norside (3) - 1 freq rooskie (3) - 1 freq nursie (3) - 4 freq nookie (4) - 2 freq nurse (4) - 169 freq nories (4) - 25 freq nordik (4) - 1 freq nursit (4) - 1 freq nursin (4) - 29 freq forsake (4) - 1 freq nirse (4) - 1 freq workie (4) - 1 freq nosie (4) - 1 freq porkie (4) - 1 freq forkie (4) - 4 freq horsie (4) - 7 freq norrie (4) - 20 freq norie (4) - 47 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 |
NORSKIE |
| Time to execute Levenshtein function - 0.179770 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.335166 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.027289 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.037086 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.000905 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. |