| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| absolve (0) - 3 freq absolved (1) - 1 freq resolve (2) - 11 freq solve (2) - 9 freq disolve (2) - 1 freq absolute (2) - 73 freq above (2) - 149 freq aesome (3) - 7 freq abodie (3) - 2 freq absence (3) - 20 freq aboose (3) - 1 freq aisle (3) - 27 freq involve (3) - 16 freq abusive (3) - 8 freq a-solo (3) - 1 freq absolyute (3) - 1 freq solver (3) - 1 freq isolde (3) - 4 freq resolved (3) - 8 freq solved (3) - 8 freq alcove (3) - 4 freq absie (3) - 1 freq evolve (3) - 7 freq able (3) - 436 freq revolve (3) - 2 freq |
absolve (0) - 3 freq absolved (2) - 1 freq absolute (3) - 73 freq disolve (3) - 1 freq solve (3) - 9 freq resolve (3) - 11 freq absolyute (4) - 1 freq salve (4) - 5 freq observe (4) - 14 freq abusive (4) - 8 freq obsolete (4) - 6 freq above (4) - 149 freq solves (5) - 3 freq bsl (5) - 22 freq souve (5) - 1 freq absorb (5) - 2 freq absense (5) - 1 freq sole (5) - 19 freq abave (5) - 1 freq sylvie (5) - 8 freq jslv (5) - 1 freq belyve (5) - 33 freq belive (5) - 2 freq silva (5) - 1 freq beleve (5) - 6 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 - ABSLF absolve - 3 freq |
ABSOLVE |
| Time to execute Levenshtein function - 0.212535 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.368005 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.027477 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.037981 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.000897 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. |