Libraryless. Click here for Pure Java version (3675L/25K/80K).
!7 static Map<S, Int> attractors = litorderedmap( "caffeine", 3, "coffee", 2, "cube", 1, "cubes", 1, "hello", 1, "some", 1, "please", 1); sS demoText = "Helo I'd like som caffien-free cofee pleas"; p { consoleSetInput(demoText); testAnswerFunction(demoText); botSleep(); } sS answer(S s) { ret levenAttract(attractors, s); }
download show line numbers debug dex old transpilations
Travelled to 13 computer(s): aoiabmzegqzx, bhatertpkbcr, cbybwowwnfue, cfunsshuasjs, gwrvuhgaqvyk, ishqpsrjomds, lpdgvwnxivlt, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tslmcundralx, tvejysmllsmz, vouqrxazstgt
No comments. add comment
Snippet ID: | #1008387 |
Snippet name: | Correct word spelling with levenAttract [WORKS] |
Eternal ID of this version: | #1008387/8 |
Text MD5: | 0e1ea581e8975f9f62fc0a30f4f566d3 |
Transpilation MD5: | b7422234a02e67b497885ffc0347a154 |
Author: | stefan |
Category: | javax / a.i. |
Type: | JavaX source code |
Public (visible to everyone): | Yes |
Archived (hidden from active list): | No |
Created/modified: | 2017-06-01 16:08:07 |
Source code size: | 371 bytes / 22 lines |
Pitched / IR pitched: | No / No |
Views / Downloads: | 586 / 675 |
Version history: | 7 change(s) |
Referenced in: | #1008388 - levenAttract - funny Levenshtein-based spell corrector. Converts input to lower-case |