| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| newport (0) - 3 freq newborn (2) - 11 freq report (2) - 227 freq export (2) - 10 freq newlot (2) - 5 freq nort (3) - 53 freq depart (3) - 7 freq btsport (3) - 1 freq neiper (3) - 6 freq repost (3) - 1 freq newsnet (3) - 2 freq reports (3) - 42 freq devoort (3) - 1 freq escort (3) - 3 freq despirt (3) - 1 freq newboarn (3) - 2 freq teleport (3) - 1 freq port (3) - 70 freq tempert (3) - 2 freq teapot (3) - 10 freq peppert (3) - 1 freq neepur (3) - 1 freq wort (3) - 1 freq resort (3) - 8 freq airport (3) - 20 freq |
newport (0) - 3 freq newlot (4) - 5 freq export (4) - 10 freq gwpart (4) - 1 freq newborn (4) - 11 freq report (4) - 227 freq neeper (5) - 5 freq heliport (5) - 2 freq sport (5) - 155 freq leopart (5) - 1 freq neepers (5) - 5 freq nept (5) - 1 freq tayport (5) - 2 freq repoort (5) - 1 freq newark (5) - 1 freq newvir (5) - 6 freq support (5) - 341 freq 'expert (5) - 1 freq expert (5) - 44 freq import (5) - 6 freq wiprt (5) - 1 freq neipers (5) - 2 freq pasport (5) - 5 freq reporte (5) - 1 freq newest (5) - 15 freq |
SoundEx code - N163 neibourheid - 1 freq newport - 3 freq nivver-do-weels - 1 freq neibourhuid - 2 freq neeborhood - 2 freq nivver-the-les - 2 freq nevertheless - 4 freq nivvirdoomynd - 1 freq neibourhood - 1 freq niffered - 2 freq neeborheid - 2 freq neebored - 1 freq niffert - 1 freq nivvertheless - 4 freq nivertheless - 1 freq neebourhood - 1 freq neeborheids - 1 freq neeburhood - 1 freq newportbakery - 1 freq neebourheid - 1 freq nfrtz - 1 freq |
MetaPhone code - NPRT newport - 3 freq |
NEWPORT |
| Time to execute Levenshtein function - 0.190596 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.333189 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.027067 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.037356 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. |