Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
likegold (0) - 1 freq likely (3) - 311 freq icecold (3) - 1 freq likened (3) - 1 freq likeable (3) - 2 freq liked (3) - 189 freq lik'able (4) - 1 freq likeweys (4) - 4 freq likly (4) - 21 freq likelier (4) - 1 freq likelie (4) - 11 freq begoud (4) - 104 freq wikeind (4) - 1 freq €œbehold (4) - 1 freq marigold (4) - 2 freq lithgow (4) - 1 freq lieges (4) - 1 freq lined (4) - 51 freq mikerid (4) - 1 freq luked (4) - 14 freq licked (4) - 10 freq liegis (4) - 2 freq laked (4) - 1 freq likewyse (4) - 3 freq liker (4) - 9 freq |
likegold (0) - 1 freq liked (5) - 189 freq likened (5) - 1 freq likeable (5) - 2 freq likely (5) - 311 freq lik'd (6) - 4 freq leggid (6) - 1 freq likiil (6) - 1 freq lakely (6) - 2 freq legend (6) - 92 freq legged (6) - 10 freq lik'ly (6) - 1 freq legal (6) - 85 freq leuthold (6) - 2 freq luiked (6) - 75 freq gold (6) - 115 freq lyked (6) - 3 freq ligged (6) - 1 freq kiraagold (6) - 1 freq linfield (6) - 2 freq likid (6) - 1 freq lifeguard (6) - 3 freq likkly (6) - 2 freq likelihood (6) - 3 freq legoland (6) - 2 freq |
SoundEx code - L224 logical - 11 freq lexical - 25 freq logically - 2 freq legislation - 38 freq loughgiel - 1 freq legislative - 10 freq lochgelly - 18 freq legislatioun - 2 freq legislator - 1 freq legislators - 3 freq legislations - 1 freq lusciously - 1 freq lochgilphead - 2 freq legislate - 3 freq legislatures - 1 freq legislature - 1 freq louiseglen - 2 freq lisajewelluk - 1 freq legislating - 1 freq likegold - 1 freq lokiskywalker - 7 freq |
MetaPhone code - LKKLT likegold - 1 freq |
LIKEGOLD |
Time to execute Levenshtein function - 0.282838 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.398615 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.027733 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.037844 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.000932 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. |