Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
arbroath (0) - 16 freq arbroath' (1) - 2 freq €œbreath (3) - 1 freq breath (3) - 233 freq broth (3) - 68 freq broat (3) - 14 freq broach (3) - 6 freq aboat (3) - 2 freq froath (3) - 1 freq abroad (3) - 34 freq brath (3) - 1 freq approach (3) - 105 freq boath (3) - 2 freq abooot (4) - 2 freq arrol's (4) - 1 freq oath (4) - 13 freq e-boat (4) - 2 freq croat (4) - 1 freq acroass (4) - 104 freq redpath (4) - 2 freq warbeth (4) - 1 freq airth (4) - 11 freq braeth (4) - 26 freq harrot (4) - 3 freq brathe (4) - 1 freq |
arbroath (0) - 16 freq arbroath' (2) - 2 freq brath (4) - 1 freq broth (4) - 68 freq breath (4) - 233 freq brathe (5) - 1 freq breathe (5) - 60 freq braeth (5) - 26 freq breith (5) - 35 freq airbrush (5) - 3 freq breeth (5) - 7 freq breathy (5) - 1 freq borth (5) - 73 freq brith (5) - 4 freq braith (5) - 215 freq 'breathe (5) - 1 freq froath (5) - 1 freq broat (5) - 14 freq broach (5) - 6 freq €œbreath (5) - 1 freq boath (5) - 2 freq rebirth (5) - 5 freq reproach (6) - 2 freq wrath (6) - 19 freq berth (6) - 21 freq |
SoundEx code - A616 airborne - 4 freq airport - 20 freq arbroath - 16 freq airforce - 2 freq airy-fairy - 2 freq airports - 3 freq airport's - 1 freq arbor-vitae - 1 freq arverie-like - 1 freq arbroath' - 2 freq airforss - 1 freq aeroports - 1 freq arbrahamic - 1 freq airbornesappers - 1 freq airbrush - 3 freq arbroathhigh - 1 freq arabforlife - 1 freq arborist - 1 freq |
MetaPhone code - ARBR0 arbroath - 16 freq arbroath' - 2 freq arbroathhigh - 1 freq |
ARBROATH |
Time to execute Levenshtein function - 0.191842 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.376407 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.030676 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.038214 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.000973 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. |