| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| allreadee (0) - 1 freq alreadee (1) - 1 freq alreadies (3) - 1 freq ulreydee (3) - 1 freq alreddie (3) - 1 freq allgitdee (3) - 1 freq aareadie (3) - 16 freq aalready (3) - 3 freq already (3) - 150 freq pleadet (4) - 2 freq a'ready (4) - 11 freq acreage (4) - 1 freq a-grade (4) - 1 freq arcades (4) - 2 freq allude (4) - 1 freq pleaded (4) - 17 freq alreidy (4) - 1 freq aweready (4) - 3 freq alloeud (4) - 1 freq allege (4) - 1 freq ariadne (4) - 4 freq arcade (4) - 8 freq alleged (4) - 1 freq aready (4) - 1 freq alliance (4) - 30 freq |
allreadee (0) - 1 freq alreadee (2) - 1 freq already (4) - 150 freq ulreydee (4) - 1 freq aalready (4) - 3 freq allude (5) - 1 freq alfred (5) - 12 freq alloed (5) - 3 freq alloeud (5) - 1 freq aalreydy (5) - 1 freq alreidy (5) - 1 freq alreedy (5) - 1 freq allied (5) - 3 freq alreddie (5) - 1 freq alreadies (5) - 1 freq allgitdee (5) - 1 freq aareadie (5) - 16 freq alleged (5) - 1 freq alloud (6) - 1 freq allooance (6) - 1 freq yallaed (6) - 1 freq allou'd (6) - 1 freq ill-made (6) - 2 freq aready (6) - 24 freq railroad (6) - 1 freq |
SoundEx code - A463 already - 150 freq alerted - 2 freq alert - 17 freq alreddy - 4 freq alreadee - 1 freq alreddie - 1 freq allreadee - 1 freq alreidy - 1 freq aalready - 3 freq alertit - 2 freq alreadies - 1 freq aalreydy - 1 freq alriddy - 3 freq al'riddy - 1 freq alreedy - 1 freq alreet - 3 freq |
MetaPhone code - ALRT already - 150 freq alert - 17 freq alreddy - 4 freq alreadee - 1 freq alreddie - 1 freq allreadee - 1 freq alreidy - 1 freq aalready - 3 freq aalreydy - 1 freq alriddy - 3 freq al'riddy - 1 freq alreedy - 1 freq alreet - 3 freq |
ALLREADEE |
| Time to execute Levenshtein function - 0.231221 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.404074 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.031373 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.041443 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.000840 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. |