| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| abigail (0) - 2 freq abraid (3) - 11 freq asail (3) - 1 freq arisaig (3) - 1 freq bugil (3) - 1 freq abstain (3) - 6 freq agai (3) - 2 freq bigake (3) - 5 freq agal (3) - 1 freq abiah (3) - 1 freq assail (3) - 7 freq biggit (3) - 245 freq animal (3) - 101 freq agait (3) - 1 freq 'biggit (3) - 1 freq albagal (3) - 1 freq bail (3) - 14 freq gail (3) - 3 freq bicaim (3) - 4 freq 'biggin (3) - 6 freq bogil (3) - 4 freq abijah (3) - 5 freq taigil (3) - 2 freq biggid (3) - 4 freq abidin (3) - 9 freq |
abigail (0) - 2 freq bogil (3) - 4 freq bugil (3) - 1 freq bigly (4) - 2 freq bigamy (4) - 1 freq taigil (4) - 2 freq albagal (4) - 1 freq beguile (4) - 6 freq gail (4) - 3 freq bail (4) - 14 freq bigsie (4) - 4 freq bial (4) - 1 freq vigil (4) - 53 freq bigake (4) - 5 freq abril (4) - 1 freq agal (4) - 1 freq legal (5) - 85 freq baggie (5) - 12 freq baal (5) - 14 freq bygaein (5) - 1 freq egil (5) - 4 freq iegil (5) - 1 freq bill (5) - 551 freq bigot (5) - 4 freq billia (5) - 1 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 - ABKL abigail - 2 freq |
ABIGAIL |
| Time to execute Levenshtein function - 0.228059 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.345320 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.028596 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.038718 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.000978 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. |