Natural Language Processing · free preview
Chart Parsing with CKY and Neural Span Scores
Chomsky normal form, the CKY dynamic program over spans, packed representations of all parses, span-based neural disambiguation, and PARSEVAL evaluation.
1. Chart Parsing with CKY and Neural Span Scores
Chart Parsing with CKY and Neural Span Scores
2. Scoring spans with a network
Scoring spans with a network
3. CKY and span scores in Python
CKY and span scores in Python
4. Binarizing a long rule
How does conversion to Chomsky normal form handle the rule , and why is the conversion safe?
5. What a cell holds
In the CKY table, what does cell contain, and where does the algorithm look when filling it?
6. Counting split points
A constituent spans 5 words, from fencepost to fencepost . How many split points with must CKY try when filling that cell? Answer with the number.
7. The cubic cost
CKY parses a sentence of words with three nested loops, over columns, cells, and split points. For , how many (cell, split) combinations does the algorithm consider, ignoring the grammar? Answer with the number.
8. Labeled precision and recall
A parser's tree contains 9 constituents, the gold tree contains 10, and 8 constituents match exactly in label and span. Compute the labeled , rounding to three decimals.
Practice this interactively
Free account · instant grading · spaced review that schedules itself.
Start this course for free