| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| absolved (0) - 1 freq absolve (1) - 3 freq unsolved (2) - 2 freq resolved (2) - 8 freq solved (2) - 8 freq absorbed (2) - 4 freq absolute (3) - 73 freq dissolved (3) - 2 freq solve (3) - 9 freq above (3) - 149 freq devolved (3) - 7 freq absconded (3) - 1 freq envolved (3) - 1 freq involved (3) - 140 freq disolve (3) - 1 freq salved (3) - 1 freq aborted (3) - 1 freq booled (3) - 2 freq revolved (3) - 1 freq evolved (3) - 9 freq resolve (3) - 11 freq solver (3) - 1 freq solves (3) - 3 freq observed (3) - 11 freq bolted (3) - 19 freq |
absolved (0) - 1 freq absolve (2) - 3 freq solved (3) - 8 freq resolved (3) - 8 freq unsolved (3) - 2 freq observed (4) - 11 freq salved (4) - 1 freq absorbed (4) - 4 freq bolted (5) - 19 freq evolved (5) - 9 freq solver (5) - 1 freq resolve (5) - 11 freq slaved (5) - 1 freq enslaved (5) - 2 freq obsairved (5) - 6 freq revolved (5) - 1 freq baeloved (5) - 1 freq beluved (5) - 1 freq solves (5) - 3 freq beloved (5) - 25 freq solve (5) - 9 freq booled (5) - 2 freq devolved (5) - 7 freq envolved (5) - 1 freq dissolved (5) - 2 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 - ABSLFT absolved - 1 freq |
ABSOLVED |
| Time to execute Levenshtein function - 0.216595 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.433214 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.032655 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.042855 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.001145 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. |