| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eberdeen (0) - 3 freq aberdeen (1) - 112 freq aiberdeen (2) - 266 freq aberdein (2) - 1 freq eferneen (2) - 1 freq berween (2) - 1 freq gaerdeen (2) - 3 freq 'aberdeen (2) - 1 freq everyeen (2) - 4 freq bedeen (2) - 1 freq gerdeen (2) - 10 freq gerden (3) - 4 freq everee (3) - 1 freq estreen (3) - 1 freq bedein (3) - 2 freq burden (3) - 24 freq evergreen (3) - 6 freq gairdeen (3) - 4 freq beeteen (3) - 1 freq beyden (3) - 1 freq spendeen (3) - 1 freq aiberden (3) - 1 freq owergeen (3) - 2 freq endeen (3) - 3 freq abeeen (3) - 1 freq |
eberdeen (0) - 3 freq aberdeen (1) - 112 freq aberdein (2) - 1 freq aiberdeen (2) - 266 freq burden (3) - 24 freq birden (3) - 1 freq aiberden (3) - 1 freq gerdeen (3) - 10 freq aiberdein (3) - 3 freq bedeen (3) - 1 freq aibirdeen (3) - 1 freq gaerdeen (3) - 3 freq berween (3) - 1 freq 'aberdeen (3) - 1 freq 'burden (4) - 1 freq verdean (4) - 3 freq yesaberdeen (4) - 1 freq bedien (4) - 1 freq burneen (4) - 2 freq aiberdeeeen (4) - 1 freq bryden (4) - 14 freq aiberdene (4) - 1 freq boarden (4) - 1 freq gaerden (4) - 1 freq a'iberdeen (4) - 1 freq |
SoundEx code - E163 everything - 97 freq efforts - 50 freq everythin - 119 freq everythin's - 3 freq everytime - 10 freq effort - 105 freq everywhaut - 1 freq everyday - 32 freq everything's - 3 freq everday - 2 freq eupboards - 1 freq effert - 1 freq effirt - 3 freq everything'll - 1 freq effart - 1 freq everyday' - 1 freq ever-decreasing - 1 freq €œeveryday - 2 freq effortlessly - 4 freq everthin - 2 freq €œeverything - 2 freq everythin' - 1 freq €™everything - 1 freq eberdeen - 3 freq evertype - 2 freq everthings - 1 freq efforts' - 1 freq everythins - 3 freq everton - 3 freq everydaysaschoolday - 1 freq |
MetaPhone code - EBRTN eberdeen - 3 freq |
EBERDEEN |
| Time to execute Levenshtein function - 0.240631 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.412467 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.029432 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.037209 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.000880 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. |