| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aibsolutely (0) - 1 freq absolutely (1) - 135 freq absolute (3) - 65 freq €œabsolutely (3) - 3 freq resolutely (3) - 3 freq absolyute (4) - 1 freq absolution (4) - 3 freq isolate (5) - 8 freq abzolutelyabz (5) - 2 freq rissolution (5) - 4 freq acutely (5) - 2 freq absolve (5) - 3 freq obsolete (5) - 6 freq absolved (5) - 1 freq absolutists (5) - 1 freq politely (5) - 27 freq insoluble (5) - 1 freq solely (5) - 3 freq absurdly (5) - 1 freq chocolately (5) - 1 freq blately (5) - 2 freq resolute (5) - 8 freq isolated (5) - 1 freq aister (6) - 2 freq fusomely (6) - 1 freq |
aibsolutely (0) - 1 freq absolutely (1) - 135 freq resolutely (4) - 3 freq absolute (4) - 65 freq absolution (5) - 3 freq absolyute (5) - 1 freq €œabsolutely (5) - 3 freq obsolete (6) - 6 freq blately (6) - 2 freq resolute (7) - 8 freq solely (7) - 3 freq obsoletion (7) - 1 freq insoluble (7) - 1 freq beltel (7) - 4 freq isolated (7) - 1 freq absurdly (7) - 1 freq isolate (7) - 8 freq politely (7) - 27 freq absolved (7) - 1 freq absolve (7) - 3 freq blythly (8) - 1 freq gaistly (8) - 1 freq boltet (8) - 1 freq visually (8) - 4 freq obscenely (8) - 3 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 - ABSLTL absolutely - 135 freq €œabsolutely - 3 freq aibsolutely - 1 freq |
AIBSOLUTELY |
| Time to execute Levenshtein function - 0.228966 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.397499 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.027520 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.037207 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.000820 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. |