| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| absolute (0) - 65 freq absolyute (1) - 1 freq obsolete (2) - 6 freq resolute (2) - 8 freq absolutely (2) - 135 freq absolve (2) - 3 freq desolate (3) - 3 freq absolution (3) - 3 freq salute (3) - 19 freq absolved (3) - 1 freq isolate (3) - 8 freq astute (3) - 1 freq aibsolutely (3) - 1 freq about (3) - 671 freq aplate (4) - 1 freq resolutely (4) - 3 freq insole (4) - 1 freq souter (4) - 9 freq resolve (4) - 10 freq doute (4) - 2 freq gasoline (4) - 1 freq abort (4) - 3 freq pollute (4) - 2 freq abott (4) - 2 freq athouten (4) - 2 freq |
absolute (0) - 65 freq absolyute (1) - 1 freq obsolete (2) - 6 freq absolve (3) - 3 freq absolutely (3) - 135 freq resolute (3) - 8 freq aibsolutely (4) - 1 freq salute (4) - 19 freq isolate (4) - 8 freq desolate (4) - 3 freq absolution (4) - 3 freq abilitie (5) - 1 freq abeelity (5) - 7 freq oblate (5) - 1 freq solt (5) - 7 freq abeilitie (5) - 2 freq bluto (5) - 1 freq solit (5) - 5 freq absentee (5) - 1 freq absent (5) - 12 freq abeility (5) - 2 freq blate (5) - 82 freq slite (5) - 4 freq insulate (5) - 1 freq ability (5) - 43 freq |
SoundEx code - A124 absolute - 65 freq absolve - 3 freq absolutely - 135 freq abigail - 2 freq apocalypse - 10 freq aff-kilter - 1 freq absolved - 1 freq absolyute - 1 freq apocalyptic - 4 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 - ABSLT absolute - 65 freq |
ABSOLUTE |
| Time to execute Levenshtein function - 0.305876 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.848779 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.034451 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.068888 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.000882 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. |