explore probabilistic context free grammars

[lancejpollard]

It seems like you could use the same pattern to implement a PCFG as well:

http://en.wikipedia.org/wiki/Stochastic_context-free_grammar#Building_a_PCFG_model

It's definitely more complex, and will take some time to learn. But it seems possible.

random notes

• production rule is the name for the current .match: http://en.wikipedia.org/wiki/Production_(computer_science)
• grammar induction (automatically learning the production rules): http://sist.shanghaitech.edu.cn/faculty/tukw/icgi08.pdf
  • http://arxiv.org/pdf/1202.3732.pdf
  • http://people.csail.mit.edu/rgrosse/phd-thesis.pdf
• adapter grammars
  • http://cocosci.berkeley.edu/tom/papers/adaptornips.pdf