Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
alfounder (0) - 1 freq founder (2) - 3 freq cofounder (2) - 1 freq anunder (3) - 44 freq blunder (3) - 3 freq 'louder (3) - 1 freq louder (3) - 40 freq allander (3) - 1 freq founders (3) - 1 freq lounger (3) - 1 freq rounder (3) - 1 freq announcer (3) - 1 freq alexender (3) - 1 freq plunder (3) - 5 freq foundert (3) - 3 freq lunder (3) - 1 freq uefaunder (3) - 1 freq flounders (3) - 2 freq loundert (3) - 1 freq founde (3) - 1 freq founded (3) - 3 freq unfounded (3) - 1 freq alexander (3) - 76 freq funder (3) - 1 freq a-dunder (3) - 1 freq |
alfounder (0) - 1 freq cofounder (3) - 1 freq founder (3) - 3 freq uefaunder (4) - 1 freq allander (4) - 1 freq funder (4) - 1 freq alexander (4) - 76 freq lunder (4) - 1 freq alexender (4) - 1 freq asunder (5) - 5 freq sounder (5) - 2 freq a-dunder (5) - 1 freq an'under (5) - 3 freq finder (5) - 5 freq foundry (5) - 4 freq lender (5) - 2 freq lander (5) - 13 freq fender (5) - 10 freq unfounded (5) - 1 freq lavender (5) - 57 freq defender (5) - 5 freq offender (5) - 2 freq louder (5) - 40 freq rounder (5) - 1 freq founders (5) - 1 freq |
SoundEx code - A415 aleevint - 1 freq album - 24 freq albums - 8 freq albania - 1 freq alban - 3 freq aleyven - 2 freq alpin - 7 freq alfenus - 1 freq aa-lappin - 8 freq alven - 1 freq alfounder - 1 freq alpinson - 1 freq albanian - 1 freq alabama - 2 freq albion - 3 freq aliveness - 2 freq aleevin - 1 freq alpine - 2 freq allophone - 1 freq albino - 2 freq alvinstraight - 1 freq alivin - 1 freq albannach - 8 freq albans - 1 freq alibammm - 2 freq |
MetaPhone code - ALFNTR alfounder - 1 freq |
ALFOUNDER |
Time to execute Levenshtein function - 0.206107 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.393390 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.027959 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.043748 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.000936 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. |