Timeline for How to automatically connect letters into words?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 17, 2015 at 9:19 | history | edited | InformedA | CC BY-SA 3.0 |
add dynamic programming code to previous exhaustive search
|
| Feb 16, 2015 at 3:57 | comment | added | InformedA | @Jörg W Mittag If you want to choose one solution, you need to have a grammar (even crude one) and then define a corpus from which statistics can be drawn. The rest is about ranking using extracted stats. | |
| Feb 16, 2015 at 1:33 | comment | added | slebetman | @Tim. Yes, it's the dictContains(part) bit. It checks if the word exists in the dictionary. It's not shown how that's implemented. What's shown is how the parts are combined in various combinations and those combinations are checked against the dictionary. | |
| Feb 15, 2015 at 18:51 | comment | added | Tim | Thanks. Where is the part in the code that can recognize a sequence of letters as a word? Does it need some human used dictionary? | |
| Feb 15, 2015 at 16:00 | comment | added | Jörg W Mittag | @slebetman: I guess it depends on whether you interpret "meaningful" as "meaningful in context" or simply "individual meaningful words". | |
| Feb 15, 2015 at 14:28 | comment | added | slebetman | @JörgWMittag: Does it need to? The question doesn't specify that the software needs to produce correct result. Only meaningful results. So the correct answer to your answer would be to print both results. | |
| Feb 15, 2015 at 14:16 | comment | added | Jörg W Mittag | In the example from my answer, how does your algorithm decide which one of the two possible solutions is the correct one? | |
| Feb 15, 2015 at 14:04 | history | answered | InformedA | CC BY-SA 3.0 |