| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| northumbrianrep (0) - 1 freq northumbrian (3) - 16 freq northumbria (4) - 10 freq northumbria- (4) - 1 freq northumbria-' (4) - 4 freq northumberland (5) - 3 freq noarthumbria (5) - 1 freq northbridge (6) - 1 freq northumb (7) - 1 freq northummerlaun (7) - 1 freq northerner (7) - 1 freq northmaven (7) - 1 freq northmaist (8) - 1 freq torturin (8) - 1 freq thumban (8) - 1 freq northerners (8) - 1 freq nhsthebrave (8) - 1 freq northern (8) - 63 freq northwards (8) - 5 freq nortmaven (8) - 1 freq northren (8) - 19 freq nocturne (8) - 2 freq northampton (8) - 1 freq 'remembrance (8) - 1 freq nurturin (8) - 2 freq |
northumbrianrep (0) - 1 freq northumbrian (5) - 16 freq northumbria- (7) - 1 freq northumbria-' (7) - 4 freq northumbria (7) - 10 freq noarthumbria (8) - 1 freq northumberland (8) - 3 freq northbridge (10) - 1 freq northerner (10) - 1 freq northerners (11) - 1 freq northmaven (11) - 1 freq northumb (11) - 1 freq northummerlaun (11) - 1 freq northampton (12) - 1 freq northren (12) - 19 freq northmen (12) - 2 freq northern (12) - 63 freq northernly (12) - 1 freq noarthern (13) - 1 freq remembrance (13) - 14 freq thumbin (13) - 3 freq rembrancer (13) - 1 freq thumbprints (13) - 1 freq northart (13) - 3 freq northwart (13) - 2 freq |
SoundEx code - N635 northumbria-' - 4 freq northumbria - 10 freq near-at-haun - 2 freq northmen - 2 freq northumberland - 3 freq norton - 3 freq norration - 1 freq northumbria- - 1 freq noarthumbria - 1 freq northummerlaun - 1 freq northumbrian - 16 freq nortmaven - 1 freq northampton - 1 freq narration - 1 freq narrautioun - 1 freq nardini's - 1 freq northmaist - 1 freq northumb - 1 freq northmaven - 1 freq northumbrianrep - 1 freq |
MetaPhone code - NR0MRNRP northumbrianrep - 1 freq |
NORTHUMBRIANREP |
| Time to execute Levenshtein function - 0.241635 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.702741 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.050862 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.037957 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.000846 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. |