| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grillaberdeen (0) - 1 freq trendaberdeen (4) - 1 freq soulaberdeen (4) - 2 freq stvaberdeen (5) - 4 freq €˜aberdeen (5) - 1 freq yesaberdeen (5) - 1 freq sportaberdeen (5) - 1 freq firstaberdeen (5) - 4 freq a'iberdeen (5) - 1 freq o'aberdeen (5) - 1 freq aboutaberdeen (5) - 5 freq aiberdeen (5) - 266 freq aberdeen (5) - 112 freq gaerdeen (5) - 3 freq mspaberdeen (5) - 12 freq fmaaberdeen (5) - 1 freq aroonaiberdeen (5) - 1 freq kennyaberdeen (5) - 1 freq 'aberdeen (5) - 1 freq gerryinaberdeen (5) - 28 freq brewdogaberdeen (6) - 1 freq gerdeen (6) - 10 freq hiddenaberdeen (6) - 12 freq raedeen (6) - 1 freq sillerweed (6) - 1 freq |
grillaberdeen (0) - 1 freq gerryinaberdeen (7) - 28 freq soulaberdeen (7) - 2 freq trendaberdeen (7) - 1 freq firstaberdeen (8) - 4 freq aroonaiberdeen (8) - 1 freq fmaaberdeen (9) - 1 freq scillybirder (9) - 1 freq kennyaberdeen (9) - 1 freq mspaberdeen (9) - 12 freq gillgreeny (9) - 1 freq grilled (9) - 2 freq girlfreen (9) - 1 freq 'aberdeen (9) - 1 freq gaerdeen (9) - 3 freq yesaberdeen (9) - 1 freq €˜aberdeen (9) - 1 freq stvaberdeen (9) - 4 freq a'iberdeen (9) - 1 freq sportaberdeen (9) - 1 freq o'aberdeen (9) - 1 freq aboutaberdeen (9) - 5 freq aiberdeen (9) - 266 freq aberdeen (9) - 112 freq gaerden (10) - 1 freq |
SoundEx code - G641 girlfriend - 18 freq girlfriend's - 2 freq girlfrien - 1 freq girlfreend - 4 freq girlfiend - 1 freq girlfriends - 1 freq girlfreins - 1 freq grillaberdeen - 1 freq 'girlfriend - 1 freq girlfreen - 1 freq |
MetaPhone code - KRLBRTN grillaberdeen - 1 freq |
GRILLABERDEEN |
| Time to execute Levenshtein function - 0.576094 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.623054 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.027774 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.080439 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.000961 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. |