| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nigeria (0) - 5 freq siberia (2) - 5 freq niger (2) - 1 freq iberia (2) - 1 freq nigella (2) - 1 freq algeria (2) - 1 freq egeria (2) - 1 freq tiger (3) - 27 freq wiceia (3) - 1 freq niemi (3) - 1 freq ninetie (3) - 2 freq niver (3) - 851 freq nitherin (3) - 3 freq bikerin (3) - 1 freq tigerlil (3) - 1 freq nerra (3) - 33 freq gerda (3) - 4 freq niagara (3) - 1 freq aiverie (3) - 3 freq nickerit (3) - 1 freq nighberin (3) - 1 freq lingerie (3) - 1 freq tiersa (3) - 1 freq tiberias (3) - 1 freq wierin (3) - 4 freq |
nigeria (0) - 5 freq niger (2) - 1 freq egeria (3) - 1 freq niagara (3) - 1 freq algeria (3) - 1 freq neiger (3) - 1 freq angrya (4) - 3 freq aiger (4) - 2 freq ni'er (4) - 1 freq lingerie (4) - 1 freq niwer (4) - 28 freq nicer (4) - 6 freq nisra (4) - 2 freq nigel (4) - 49 freq neri (4) - 3 freq yinger (4) - 2 freq ainger (4) - 3 freq nigella (4) - 1 freq tiger (4) - 27 freq anger (4) - 73 freq nerra (4) - 33 freq siberia (4) - 5 freq iberia (4) - 1 freq niver (4) - 851 freq singer (5) - 47 freq |
SoundEx code - N260 nicer - 6 freq nicher - 5 freq ncer - 1 freq noughr - 1 freq nswer - 1 freq ncher - 1 freq nucear - 1 freq ncar - 1 freq nicker - 1 freq nisra - 2 freq niagara - 1 freq nasser - 1 freq nigeria - 5 freq niger - 1 freq nagarr - 2 freq neiger - 1 freq €œneiger - 1 freq nxur - 1 freq njr - 1 freq naeyisser - 1 freq nxsir - 1 freq nqr - 1 freq nazir - 1 freq nascar - 2 freq nxr - 1 freq |
MetaPhone code - NJR nigeria - 5 freq niger - 1 freq neiger - 1 freq €œneiger - 1 freq njr - 1 freq ndgear - 1 freq |
NIGERIA |
| Time to execute Levenshtein function - 0.204906 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.398307 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.028257 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.039507 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.000974 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. |