| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| appen-access (0) - 1 freq appendages (4) - 1 freq appearances (4) - 9 freq appendices (4) - 1 freq appendage (5) - 1 freq approaches (5) - 11 freq apprentices (5) - 4 freq apenness (5) - 2 freq appliances (5) - 2 freq appearance (5) - 49 freq apperance (5) - 2 freq attendances (5) - 5 freq penniless (6) - 1 freq agencies (6) - 9 freq appetites (6) - 2 freq ripeness (6) - 1 freq menaces (6) - 1 freq appened (6) - 5 freq life-cless (6) - 1 freq appreciates (6) - 3 freq happence (6) - 1 freq appellachia (6) - 1 freq spectacles (6) - 7 freq repentance (6) - 3 freq penance (6) - 2 freq |
appen-access (0) - 1 freq appendices (7) - 1 freq appearances (8) - 9 freq appendages (8) - 1 freq princess (9) - 92 freq preincess (9) - 1 freq applecross (9) - 2 freq appliances (9) - 2 freq approaches (9) - 11 freq apprentices (9) - 4 freq apenness (9) - 2 freq pences (10) - 3 freq spence's (10) - 4 freq green-gless (10) - 1 freq appense (10) - 1 freq aptness (10) - 1 freq pinnaces (10) - 2 freq prentices (10) - 1 freq pendicles (10) - 1 freq prences (10) - 2 freq aipplecross (10) - 1 freq pan-scots (10) - 1 freq up-an-comers (10) - 1 freq non-accent (10) - 1 freq spencers (10) - 3 freq |
SoundEx code - A152 apens - 7 freq abeyance - 1 freq avenge - 11 freq avenues - 5 freq affeomes - 1 freq appens - 5 freq apenness - 2 freq affens - 8 freq avengit - 2 freq avenged - 3 freq avengin - 1 freq avenger - 1 freq abins - 1 freq aff-fawins - 2 freq avengers - 2 freq appunct - 1 freq appense - 1 freq afens - 2 freq appen-access - 1 freq |
MetaPhone code - APNKSS appen-access - 1 freq |
APPEN-ACCESS |
| Time to execute Levenshtein function - 0.251342 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.400323 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.027204 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.045950 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.001166 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. |