| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| norseroots (0) - 1 freq nordert' (4) - 1 freq gressroots (4) - 5 freq forenoons (4) - 1 freq grassroots (4) - 43 freq sproots (4) - 2 freq corsets (4) - 2 freq forscots (4) - 1 freq nurseries (4) - 1 freq hoosecoats (4) - 1 freq notebooks (4) - 1 freq houseroom (4) - 1 freq tree-roots (4) - 1 freq girseruits (4) - 1 freq forsooth (4) - 1 freq nortaboot (4) - 1 freq nordern (5) - 5 freq hottentots (5) - 1 freq nor-east (5) - 22 freq hooseholds (5) - 1 freq onieroads (5) - 6 freq posers (5) - 5 freq constructs (5) - 3 freq corrects (5) - 1 freq porteous (5) - 5 freq |
norseroots (0) - 1 freq nurseries (5) - 1 freq girseruits (5) - 1 freq tree-roots (6) - 1 freq forscots (6) - 1 freq corsets (6) - 2 freq nordert' (6) - 1 freq gressroots (6) - 5 freq inserts (6) - 1 freq grassroots (6) - 43 freq carrots (7) - 33 freq berserks (7) - 1 freq deserts (7) - 8 freq norskies (7) - 1 freq norraes (7) - 2 freq nasser's (7) - 1 freq kerrots (7) - 1 freq norries (7) - 5 freq norskes (7) - 1 freq narrates (7) - 1 freq norris (7) - 1 freq forests (7) - 9 freq noseyers (7) - 1 freq portraits (7) - 12 freq owersets (7) - 5 freq |
SoundEx code - N626 nursery - 29 freq nae-regrettedly - 1 freq nurseries - 1 freq neregretterien - 2 freq nursery-slope - 1 freq norseroots - 1 freq |
MetaPhone code - NRSRTS norseroots - 1 freq |
NORSEROOTS |
| Time to execute Levenshtein function - 0.348202 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.635632 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.030310 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.041265 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.001508 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. |