| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| absolute (0) - 73 freq absolyute (1) - 1 freq absolutely (2) - 140 freq obsolete (2) - 6 freq resolute (2) - 8 freq absolve (2) - 3 freq isolate (3) - 8 freq absolved (3) - 1 freq desolate (3) - 3 freq astute (3) - 1 freq about (3) - 686 freq salute (3) - 19 freq aibsolutely (3) - 1 freq absolution (3) - 3 freq nolte (4) - 1 freq aboit (4) - 1 freq abolish (4) - 1 freq solt (4) - 7 freq bolster (4) - 4 freq abeility (4) - 4 freq aboose (4) - 1 freq blout (4) - 1 freq awsome (4) - 2 freq abdicate (4) - 1 freq accolade (4) - 1 freq |
absolute (0) - 73 freq absolyute (1) - 1 freq obsolete (2) - 6 freq absolutely (3) - 140 freq absolve (3) - 3 freq resolute (3) - 8 freq aibsolutely (4) - 1 freq salute (4) - 19 freq absolution (4) - 3 freq isolate (4) - 8 freq desolate (4) - 3 freq abilitie (5) - 1 freq solit (5) - 5 freq insulate (5) - 1 freq slut (5) - 5 freq slite (5) - 4 freq abeilitie (5) - 2 freq blate (5) - 82 freq absent (5) - 12 freq abeelity (5) - 7 freq oblate (5) - 1 freq bolt (5) - 43 freq absentee (5) - 1 freq boolt (5) - 1 freq slate (5) - 33 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 - ABSLT absolute - 73 freq |
ABSOLUTE |
| Time to execute Levenshtein function - 0.222067 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.427907 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.027629 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.038361 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.000875 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. |