| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| likewise (0) - 44 freq lykewise (1) - 1 freq likewice (1) - 2 freq like-wise (1) - 1 freq likewyse (1) - 3 freq lykwise (2) - 1 freq likeweese (2) - 1 freq dimewise (2) - 1 freq likelie (2) - 11 freq lykewake (3) - 1 freq likelier (3) - 1 freq liaise (3) - 2 freq likweese (3) - 1 freq mikewizz (3) - 10 freq iwise (3) - 9 freq likesey (3) - 1 freq lifetime (3) - 52 freq naewise (3) - 1 freq liegis (3) - 2 freq lewis (3) - 68 freq likesae (3) - 4 freq laikewies (3) - 1 freq time-wise (3) - 1 freq edgewise (3) - 1 freq leise (3) - 1 freq |
likewise (0) - 44 freq lykewise (1) - 1 freq likewyse (1) - 3 freq likeweese (2) - 1 freq lykwise (2) - 1 freq likewice (2) - 2 freq like-wise (2) - 1 freq laikewies (3) - 1 freq likeweys (3) - 4 freq likweese (3) - 1 freq lewis (4) - 68 freq lakewyes (4) - 1 freq like's (4) - 2 freq likes (4) - 524 freq likesae (4) - 4 freq likesey (4) - 1 freq lykewake (4) - 1 freq likelie (4) - 11 freq dimewise (4) - 1 freq lykes (5) - 4 freq liks (5) - 7 freq homewise (5) - 1 freq lakes (5) - 2 freq license (5) - 12 freq likks (5) - 2 freq |
SoundEx code - L220 likes - 524 freq likewise - 44 freq lochs - 32 freq legacie - 2 freq lassies - 308 freq likesay - 25 freq lassock's - 1 freq lassies' - 11 freq laughs - 60 freq lassie's - 44 freq lykewise - 1 freq lauchs - 21 freq lucas - 2 freq lakis - 1 freq lyggis - 1 freq lucus - 1 freq lasses - 69 freq locus - 3 freq luckies - 1 freq lue-seek - 1 freq lugosi - 1 freq loses - 6 freq lachs - 3 freq lexis - 4 freq logic - 22 freq loch's - 1 freq lizzie's - 9 freq leggies - 10 freq lackeys - 3 freq lasheg - 1 freq losses - 15 freq lashes - 7 freq loki's - 3 freq lockis - 1 freq lauch's - 4 freq legacy - 44 freq 'lassies - 3 freq looses - 2 freq lajos - 2 freq likesae - 4 freq leagues - 19 freq lakewyes - 1 freq leeches - 4 freq lauches - 1 freq lasses' - 1 freq loasses - 5 freq locke's - 1 freq likweese - 1 freq likeweese - 1 freq lugache - 1 freq lieges - 1 freq lassikie - 2 freq lowses - 6 freq laaghs - 3 freq like's - 2 freq laich-hoose - 11 freq lisa's - 1 freq lucky's - 1 freq lizzik - 1 freq laikewies - 1 freq laikes - 1 freq likesey - 1 freq lykewake - 1 freq lassock - 2 freq lakes - 2 freq loghs - 1 freq likeweys - 4 freq likewice - 2 freq liegis - 2 freq lykwyes - 1 freq lasgies - 3 freq lookeg - 1 freq luscious - 1 freq laces - 11 freq lykes - 4 freq laichs - 1 freq lykwise - 1 freq likewyse - 3 freq leggis - 1 freq luggage - 3 freq lagos - 2 freq luca's - 1 freq luggies - 7 freq like-wise - 1 freq leaches - 3 freq loco's - 1 freq league's - 1 freq likes - 1 freq lassiess - 1 freq luchs - 1 freq lcawwxk - 1 freq lszhx - 1 freq lauzzygxo - 3 freq |
MetaPhone code - LKWS likewise - 44 freq lykewise - 1 freq likweese - 1 freq likeweese - 1 freq laikewies - 1 freq likeweys - 4 freq likewice - 2 freq lykwise - 1 freq like-wise - 1 freq |
LIKEWISE |
| Time to execute Levenshtein function - 0.231300 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.373996 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.028678 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.060046 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.001068 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. |