| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aberlour (0) - 5 freq aberdour (1) - 9 freq aiberdour (2) - 5 freq ardour (3) - 1 freq bordour (3) - 1 freq aerlier (3) - 8 freq befour (3) - 2 freq parlour (3) - 17 freq fervour (3) - 2 freq 'parlour (3) - 1 freq errour (3) - 1 freq barbour (3) - 17 freq herbour (3) - 23 freq armour (3) - 10 freq airmour (3) - 7 freq terrour (3) - 1 freq flour (4) - 15 freq vabezlo (4) - 1 freq clour (4) - 1 freq parlours (4) - 1 freq berr (4) - 2 freq bettur (4) - 3 freq bellower (4) - 1 freq ablow (4) - 336 freq beelo (4) - 1 freq |
aberlour (0) - 5 freq aberdour (2) - 9 freq aiberdour (3) - 5 freq aerlier (4) - 8 freq barbour (4) - 17 freq parlour (4) - 17 freq bordour (4) - 1 freq parlor (5) - 1 freq berr (5) - 2 freq beyler (5) - 1 freq brur (5) - 23 freq airlier (5) - 16 freq berlin (5) - 14 freq barlow (5) - 1 freq blur (5) - 14 freq terrour (5) - 1 freq 'parlour (5) - 1 freq fervour (5) - 2 freq befour (5) - 2 freq ardour (5) - 1 freq herbour (5) - 23 freq errour (5) - 1 freq airmour (5) - 7 freq armour (5) - 10 freq birls (6) - 31 freq |
SoundEx code - A164 aprile - 36 freq april - 117 freq aiverel - 1 freq april's - 2 freq aberlour - 5 freq abril - 1 freq aprily - 2 freq appairel - 1 freq aiverie-like - 4 freq aff-warld - 13 freq a-birlin - 1 freq aberlemno - 1 freq aprill - 1 freq apryle - 2 freq averill - 1 freq averillb - 1 freq |
MetaPhone code - ABRLR aberlour - 5 freq |
ABERLOUR |
| Time to execute Levenshtein function - 0.196547 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.364395 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.027690 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.037847 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.000942 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. |