| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| absolyute (0) - 1 freq absolute (1) - 73 freq absolve (3) - 3 freq absolutely (3) - 140 freq obsolete (3) - 6 freq resolute (3) - 8 freq pollute (4) - 2 freq desolate (4) - 3 freq absolution (4) - 3 freq astute (4) - 1 freq aibsolutely (4) - 1 freq absorbit (4) - 4 freq salute (4) - 19 freq blyue (4) - 1 freq associate (4) - 15 freq acolytes (4) - 1 freq isolate (4) - 8 freq about (4) - 686 freq absolved (4) - 1 freq accolytes (4) - 1 freq alyve (5) - 1 freq asure (5) - 1 freq blue (5) - 567 freq ammonite (5) - 1 freq solve (5) - 9 freq |
absolyute (0) - 1 freq absolute (1) - 73 freq obsolete (3) - 6 freq absolutely (4) - 140 freq resolute (4) - 8 freq absolve (4) - 3 freq aibsolutely (5) - 1 freq isolate (5) - 8 freq salute (5) - 19 freq desolate (5) - 3 freq absolution (5) - 3 freq absentee (6) - 1 freq oblate (6) - 1 freq solit (6) - 5 freq abeelitie (6) - 4 freq slite (6) - 4 freq bluto (6) - 1 freq abeility (6) - 4 freq abilitie (6) - 1 freq blate (6) - 82 freq blout (6) - 1 freq slut (6) - 5 freq slate (6) - 33 freq boolt (6) - 1 freq ability (6) - 44 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 - ABSLYT absolyute - 1 freq |
ABSOLYUTE |
| Time to execute Levenshtein function - 0.181682 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.377480 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.027410 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.037246 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.000863 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. |