Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
arbroathhigh (0) - 1 freq arbroath' (4) - 2 freq arbroath (4) - 16 freq larberthigh (5) - 1 freq broachit (6) - 1 freq approachin (6) - 21 freq arraheid (6) - 2 freq arothaiche (6) - 2 freq broomhaugh (6) - 1 freq arra-heid (6) - 1 freq balfronhigh (6) - 1 freq arbrahamic (6) - 1 freq ardrishaig (6) - 4 freq breathin (6) - 44 freq approachin' (6) - 1 freq boathir (6) - 3 freq approaching (6) - 7 freq froathin (6) - 1 freq approachit (6) - 1 freq breathing (6) - 15 freq breath's (7) - 1 freq aathins (7) - 3 freq aromatic (7) - 2 freq bathing (7) - 1 freq galbraith (7) - 2 freq |
arbroathhigh (0) - 1 freq arbroath (7) - 16 freq larberthigh (7) - 1 freq arbroath' (7) - 2 freq broomhaugh (9) - 1 freq breathing (9) - 15 freq breathin (10) - 44 freq borthouch (10) - 2 freq breakthrough (10) - 3 freq ardrishaig (10) - 4 freq brakthrough (10) - 1 freq borthauch (10) - 3 freq arothaiche (10) - 2 freq arbrahamic (10) - 1 freq brothers (11) - 44 freq braethin (11) - 2 freq arbuthnot (11) - 1 freq breathless (11) - 3 freq brough (11) - 5 freq brath (11) - 1 freq british (11) - 232 freq breathan (11) - 4 freq breathe' (11) - 3 freq thigh (11) - 17 freq breathed (11) - 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 |
ARBROATHHIGH |
Time to execute Levenshtein function - 0.199561 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.366350 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.027373 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.037497 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.000907 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. |