Hi all, in a bit of spare time I sketched a basic implementation of (in memory) probabilistic context free grammars which, if properly trained, can be used to build the parse tree of a given sentence, however (also looking at the doc on the website) it's not completely clear what's already implemented in trunk, I see there are 2 algorithms for parsing, could someone shed some light on them? And eventually fire an opinion for adding PCFGs as an additional algorithm?
Regards, Tommaso
