| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| barrowload (0) - 1 freq barryload (2) - 1 freq barrowlands (3) - 2 freq barrowman (3) - 1 freq barrows (4) - 1 freq narrowly (4) - 1 freq marroond (4) - 1 freq borrowed (4) - 6 freq barrowfu (4) - 2 freq borrooed (4) - 2 freq narrowed (4) - 5 freq burrowed (4) - 1 freq cairt-load (4) - 1 freq barrowafc (4) - 1 freq barrelled (4) - 3 freq carrowdore (4) - 1 freq broomloan (4) - 1 freq barrowful (4) - 2 freq baronboar (4) - 1 freq barolo (4) - 1 freq marrow (5) - 32 freq bardlorn (5) - 1 freq narrowin (5) - 5 freq barce-lona (5) - 1 freq parboiled (5) - 1 freq |
barrowload (0) - 1 freq barryload (3) - 1 freq burrowed (5) - 1 freq barrelled (5) - 3 freq barrowman (5) - 1 freq barrowlands (5) - 2 freq borrowed (5) - 6 freq narrowed (6) - 5 freq barrowful (6) - 2 freq barrowafc (6) - 1 freq narrowly (6) - 1 freq borrooed (6) - 2 freq barrows (6) - 1 freq barrowfu (6) - 2 freq bowled (7) - 1 freq barrmill (7) - 2 freq bowld (7) - 3 freq nerrowed (7) - 1 freq burrowin (7) - 2 freq borrow-foo (7) - 1 freq growled (7) - 14 freq borrelia (7) - 1 freq crowled (7) - 2 freq barred (7) - 15 freq burrows (7) - 5 freq |
SoundEx code - B643 birlt - 25 freq birled - 69 freq burlt - 1 freq barryload - 1 freq birlit - 2 freq bröled - 1 freq barrelled - 3 freq birl't - 1 freq brillident - 1 freq burled - 2 freq barrowload - 1 freq |
MetaPhone code - BRLT birlt - 25 freq birled - 69 freq burlt - 1 freq barryload - 1 freq birlit - 2 freq bröled - 1 freq barrelled - 3 freq birl't - 1 freq burled - 2 freq barrowload - 1 freq |
BARROWLOAD |
| Time to execute Levenshtein function - 0.624286 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.866637 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.040857 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.042442 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.001009 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. |