| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yesaberdeen (0) - 1 freq €˜aberdeen (3) - 1 freq 'aberdeen (3) - 1 freq fmaaberdeen (3) - 1 freq eberdeen (3) - 3 freq o'aberdeen (3) - 1 freq aberdeen (3) - 112 freq stvaberdeen (3) - 4 freq yestereen (3) - 1 freq mspaberdeen (3) - 12 freq yesterdae (4) - 1 freq aberdein (4) - 1 freq a'iberdeen (4) - 1 freq aiberdeen (4) - 266 freq yestreen (4) - 58 freq loversaberdeen (4) - 1 freq kennyaberdeen (4) - 1 freq soulaberdeen (4) - 2 freq gaerdeen (4) - 3 freq firstaberdeen (4) - 4 freq trendaberdeen (4) - 1 freq aberdeenfc (5) - 169 freq estreen (5) - 1 freq yistreen (5) - 4 freq spendeen (5) - 1 freq |
yesaberdeen (0) - 1 freq o'aberdeen (4) - 1 freq aberdeen (4) - 112 freq eberdeen (4) - 3 freq 'aberdeen (4) - 1 freq a'iberdeen (5) - 1 freq aiberdeen (5) - 266 freq soulaberdeen (5) - 2 freq aberdein (5) - 1 freq yestereen (5) - 1 freq €˜aberdeen (5) - 1 freq fmaaberdeen (5) - 1 freq stvaberdeen (5) - 4 freq mspaberdeen (5) - 12 freq aiberden (6) - 1 freq soberen (6) - 1 freq saberin (6) - 1 freq faburden (6) - 1 freq aiberdein (6) - 3 freq yesterdae (6) - 1 freq aibirdeen (6) - 1 freq yestreen (6) - 58 freq gaerdeen (6) - 3 freq sarkeen (7) - 1 freq steereen (7) - 2 freq |
SoundEx code - Y216 yesaberdeen - 1 freq |
MetaPhone code - YSBRTN yesaberdeen - 1 freq |
YESABERDEEN |
| Time to execute Levenshtein function - 0.246498 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.402695 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.027844 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.037649 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.000965 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. |