| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| novembar (0) - 1 freq november (1) - 86 freq novemmer (2) - 7 freq novemer (2) - 1 freq nevermar (3) - 1 freq 'novemmer (3) - 1 freq noventae (3) - 1 freq nose-bag (3) - 1 freq novena (3) - 1 freq novella (3) - 4 freq novercal (3) - 1 freq noymarp (4) - 1 freq dizember (4) - 2 freq neebor (4) - 43 freq never (4) - 1661 freq toolbar (4) - 1 freq norman (4) - 58 freq love-bug (4) - 1 freq norma (4) - 2 freq nucear (4) - 1 freq moveable (4) - 1 freq neeber (4) - 2 freq soulbar (4) - 1 freq rover (4) - 12 freq noarmal (4) - 1 freq |
novembar (0) - 1 freq november (1) - 86 freq novemer (3) - 1 freq novemmer (3) - 7 freq number (5) - 174 freq nhmbr (5) - 1 freq nevermar (5) - 1 freq 'novemmer (5) - 1 freq comber (6) - 2 freq ombr (6) - 1 freq naemair (6) - 1 freq annemar (6) - 1 freq member (6) - 75 freq nebir (6) - 1 freq naemer (6) - 3 freq neibor (6) - 3 freq niver (6) - 851 freq naver (6) - 3 freq decembir (6) - 2 freq dezember (6) - 4 freq nevar (6) - 1 freq remember (6) - 191 freq neebur (6) - 11 freq ramember (6) - 2 freq bomber (6) - 3 freq |
SoundEx code - N151 novembar - 1 freq november - 86 freq nip-nebs - 2 freq nipnebs - 5 freq naepumpkinsallowed - 1 freq |
MetaPhone code - NFMR novembar - 1 freq november - 86 freq novemmer - 7 freq novemer - 1 freq 'novemmer - 1 freq |
NOVEMBAR |
| Time to execute Levenshtein function - 0.214277 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.402013 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.027799 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.037596 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.001227 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. |