Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
alph (0) - 1 freq alp (1) - 1 freq alpha (1) - 5 freq alps (1) - 2 freq ralph (1) - 5 freq alh (1) - 1 freq aph (1) - 1 freq elph (1) - 1 freq awh (2) - 6 freq alen (2) - 1 freq all' (2) - 3 freq aspd (2) - 1 freq lyh (2) - 1 freq ph (2) - 53 freq alki (2) - 1 freq halp (2) - 54 freq aagh (2) - 1 freq alab (2) - 1 freq awpr (2) - 11 freq ape (2) - 5 freq argh (2) - 4 freq daph (2) - 1 freq ales (2) - 1 freq al (2) - 237 freq ash (2) - 32 freq |
alph (0) - 1 freq alpha (1) - 5 freq elph (1) - 1 freq alp (2) - 1 freq alps (2) - 2 freq elphe (2) - 1 freq aph (2) - 1 freq ralph (2) - 5 freq alh (2) - 1 freq alchy (3) - 3 freq lh (3) - 1 freq ulpa (3) - 1 freq alpin (3) - 7 freq mph (3) - 2 freq lch (3) - 1 freq lpb (3) - 1 freq leh (3) - 3 freq lpr (3) - 1 freq lp (3) - 8 freq yalp (3) - 2 freq lah (3) - 1 freq altho (3) - 38 freq raiph (3) - 25 freq lbh (3) - 1 freq imph (3) - 1 freq |
SoundEx code - A410 alive - 160 freq alba - 75 freq aleive - 1 freq aleeve - 1 freq aloof - 2 freq alfie - 28 freq alive' - 1 freq alibi - 2 freq alf - 7 freq aleppo - 1 freq alph - 1 freq alpha - 5 freq a'luv - 1 freq alewife - 1 freq alva - 2 freq alba' - 1 freq alp - 1 freq €™alba - 1 freq alab - 1 freq ayelf - 1 freq aalf - 1 freq alyve - 1 freq allyboy - 1 freq |
MetaPhone code - ALF alive - 160 freq aleive - 1 freq aleeve - 1 freq aloof - 2 freq alfie - 28 freq alive' - 1 freq alf - 7 freq alph - 1 freq alpha - 5 freq a'luv - 1 freq alva - 2 freq aalf - 1 freq alyve - 1 freq |
ALPH |
Time to execute Levenshtein function - 0.225535 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.382248 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.031568 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.043666 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.000966 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. |