Context-free grammar G is in Chomsky Normal Form (CNF). In a production / rule in G, a non-terminal symbol can be replaced by ... . Assume that there are no other non-terminal symbols involved in this production. infinite number of terminal symbols. at most two terminal symbols. up to three terminal symbols. exactly one terminal symbol. Probabilistic CKY algorithm with backpointers is NOT designed to? perform Part of Speech tagging Help build all possible, valid, parse trees for some grammatically correct sentence S. Decide if some sentence S is grammatically correct in some grammar G. Decide which valid parse tree for some grammatically correct sentence S is most likely. Which one is not true? Bag of Words is a numerical vector. Bag of Words values can be 0 (zero) or 1 (only). Bag of Words approach preserves relationships between words. Bag of words can represent entire novel