Date: 2007-07-10 03:17:11Theoretical computer science Compiler construction Programming language implementation Bioinformatics Stochastic context-free grammar Complexity classes Left corner Parse tree Parsing Formal languages Linguistics Statistical natural language processing | | LSA 354: Statistical Parsing: Problem Set [Some of these problems are borrowed with thanks from Michael Collins and Regina Barzilay.] Question 1 Let’s use a very simple grammar (where S is the start symbol, and terminaAdd to Reading ListSource URL: nlp.stanford.eduDownload Document from Source Website File Size: 71,29 KBShare Document on Facebook
|