COMPSCI 61A Lecture 37: CS61A-Lecture 11-30-2016

• School: Berkeley
• Department: Computer Science
• Course: COMPSCI 61A
• Professor: De Nero John

Document Summary

Discussion 11 is much better in person than at home, so come to discussion this week. Small review sessions next week will be held during lab and discussion times. A schedule of review topics will be released soon. Multiple di erent ways to interpret the line programs must be written for people to read . Some words like program have both noun and verb de nitions so we must determine which de nition to use. A tree represents a phrase tag what kind of phrase (e. g. s, np, vp) branches sequence of tree or leaf components. A leaf represents a single word: tag what kind of word (e. g. n, v) word the word. A grammar rule describes how a tag can be expanded as a sequence of tags or words. Recursive expansion process is the heart of most natural language processors. Expand all tags recursively, but force words to match input.