Hi, The main algorithm (called chunking in the trunk) is based on Ratnapharki's work. It is best to directly read the paper.
http://link.springer.com/article/10.1023/A:1007502103375 This is a shift-reduced parser which incidentally are becoming quite fashionable again. For example, Stanford CoreNLP recently released a shift-reduced parser themselves, as an alternative to their PCFGs, lexicalized parser. HTH, Rodrigo On Wed, Oct 15, 2014 at 9:32 AM, Tommaso Teofili <[email protected]> wrote: > 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
