| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| apashley (0) - 4 freq cashley (2) - 2 freq ashley (2) - 10 freq patsley (3) - 1 freq apache (3) - 2 freq apaches (3) - 3 freq mashles (3) - 1 freq weasley (3) - 2 freq apostles (3) - 6 freq apathy (3) - 8 freq spaley (3) - 3 freq paisley (3) - 61 freq gashle (3) - 1 freq pathwey (3) - 6 freq parsley (3) - 8 freq 'paisley (3) - 1 freq arseley (3) - 1 freq sparkley (3) - 2 freq aawey (4) - 6 freq washen (4) - 2 freq charnley (4) - 6 freq aaftly (4) - 1 freq pastless (4) - 1 freq garishly (4) - 1 freq acushla (4) - 1 freq |
apashley (0) - 4 freq ashley (3) - 10 freq cashley (3) - 2 freq paisley (4) - 61 freq gashle (4) - 1 freq hushle (5) - 1 freq pushes (5) - 8 freq asshole (5) - 2 freq pushed (5) - 92 freq reishle (5) - 2 freq pastel (5) - 2 freq pishes (5) - 2 freq reeshle (5) - 11 freq ayshely (5) - 1 freq espeshlee (5) - 1 freq apskeel (5) - 2 freq epistle (5) - 5 freq pishae (5) - 2 freq youshly (5) - 1 freq posher (5) - 1 freq pisher (5) - 1 freq paisely (5) - 2 freq pusher (5) - 3 freq pystle (5) - 2 freq irishly (5) - 1 freq |
SoundEx code - A124 absolute - 73 freq absolve - 3 freq absolutely - 140 freq abigail - 2 freq apocalypse - 10 freq aff-kilter - 1 freq absolved - 1 freq apocalyptic - 6 freq absolyute - 1 freq apskeelin - 2 freq apskeel - 2 freq absolution - 3 freq absolutists - 1 freq €œabsolutely - 3 freq abzolutelyabz - 2 freq absoluteginius - 1 freq auobglasgow - 1 freq afjgillespie - 1 freq aibsolutely - 1 freq afzal - 1 freq apashley - 4 freq |
MetaPhone code - APXL apashley - 4 freq |
APASHLEY |
| Time to execute Levenshtein function - 0.200547 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.352574 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.027723 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.038523 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.000914 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. |