| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| almeron (0) - 1 freq cameron (2) - 127 freq alterin (2) - 2 freq aeaeron (2) - 5 freq alteran (2) - 1 freq gilmerton (3) - 1 freq simeon (3) - 8 freq deveron (3) - 1 freq aaron (3) - 5 freq aller (3) - 2 freq balmer (3) - 2 freq airon (3) - 1 freq balmerino (3) - 1 freq alberto (3) - 2 freq ollerton (3) - 1 freq aumers (3) - 4 freq merton (3) - 4 freq alert (3) - 17 freq astron (3) - 1 freq albert (3) - 25 freq altered (3) - 17 freq salmon (3) - 46 freq callerin (3) - 1 freq aapron (3) - 1 freq admirin (3) - 22 freq |
almeron (0) - 1 freq alterin (3) - 2 freq alteran (3) - 1 freq cameron (3) - 127 freq leern (4) - 1 freq alamein (4) - 1 freq admirin (4) - 22 freq leerin (4) - 5 freq eldern (4) - 4 freq almark (4) - 1 freq moron (4) - 4 freq lerone (4) - 1 freq admiran (4) - 2 freq haimerin (4) - 1 freq admeirin (4) - 1 freq alcorn (4) - 7 freq lemon (4) - 23 freq laern (4) - 13 freq yammerin (4) - 7 freq elmer (4) - 2 freq lern (4) - 3 freq aeaeron (4) - 5 freq yawmerin (4) - 1 freq balmerino (4) - 1 freq lorn (5) - 1 freq |
SoundEx code - A456 almark - 1 freq allanerly - 1 freq allmairshall - 4 freq allmairshall's - 1 freq alienar - 3 freq almerals - 1 freq alanerlye - 1 freq €˜alanerly - 1 freq aalwmrtwm - 1 freq alomar - 1 freq almeron - 1 freq alanrutherford - 14 freq |
MetaPhone code - ALMRN almeron - 1 freq |
ALMERON |
| Time to execute Levenshtein function - 0.186532 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.485906 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.027288 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.037591 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.000867 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. |