| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lokomotywa' (1) - 1 freq locomotive (4) - 4 freq lookoot' (5) - 1 freq locomotive' (5) - 1 freq loomit (5) - 4 freq lookoot (5) - 1 freq skootys (5) - 1 freq loompa (5) - 1 freq skooty (5) - 2 freq promoting (6) - 1 freq prototype (6) - 1 freq tomata (6) - 5 freq skooties (6) - 1 freq promote (6) - 54 freq footy (6) - 3 freq look't (6) - 1 freq loosey (6) - 6 freq lotta (6) - 14 freq luk-oot (6) - 1 freq loost (6) - 8 freq loomed (6) - 5 freq doomit (6) - 2 freq lokt's (6) - 1 freq dakota (6) - 1 freq lofty (6) - 4 freq |
lokomotywa' (2) - 1 freq locomotive (6) - 4 freq loomit (7) - 4 freq lookoot (7) - 1 freq lookoot' (7) - 1 freq luk-oot (8) - 1 freq lookit (8) - 338 freq leitmotif (8) - 1 freq kowtow (8) - 1 freq lookt (8) - 14 freq lokket (8) - 3 freq look't (8) - 1 freq look-oot (8) - 5 freq skooty (8) - 2 freq locomotive' (8) - 1 freq looket (8) - 36 freq skootys (8) - 1 freq loompa (8) - 1 freq lota (9) - 1 freq alamooties (9) - 2 freq loopit (9) - 1 freq limit (9) - 27 freq pokemon (9) - 1 freq blakoot (9) - 1 freq loomin (9) - 9 freq |
SoundEx code - L253 locomotive - 4 freq legend - 92 freq likent - 2 freq loaksmiths - 1 freq legends - 36 freq lucendo - 1 freq loosened - 3 freq legendary - 15 freq leisn't - 1 freq lisent - 1 freq lowsint - 1 freq leigend - 1 freq leigends - 1 freq legendiry - 1 freq lessened - 1 freq lichened - 2 freq likened - 1 freq lowsened - 2 freq legend'ry - 1 freq lassie-in-waitin - 4 freq lossiemouth - 3 freq lissened - 1 freq locomotive' - 1 freq lokomotywa' - 1 freq lozent - 1 freq lowsent - 2 freq locumtenand - 3 freq lossiemooth - 1 freq lossiemouth-museum - 1 freq likeamadgiraffe - 1 freq legianet - 1 freq lucyhunterb - 5 freq lesmit - 1 freq lyceumtheatre - 1 freq legends-need - 1 freq |
MetaPhone code - LKMTW lokomotywa' - 1 freq |
LOKOMOTYWA |
| Time to execute Levenshtein function - 0.203710 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.366539 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.028745 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.037249 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.000877 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. |