9
High-level overview of C&C Find the highest-probability result with coherent semantics Doesn’t this create billions of parses that need to be checked?

10
High-level overview of C&C Find the highest-probability result with coherent semantics Doesn’t this create millions of parses that need to be checked? Yes. A typical sentence uses 25 GB of RAM. That’s where the Beowulf cluster comes in.

11
Can we do this with NLTK? NLTK’s feature-based parser has some machinery for doing semantics