Difference between revisions of "CYK Parsing"
From Cohen Courses
Jump to navigationJump to searchm |
m |
||
| Line 1: | Line 1: | ||
This is a [[Category::Method]] page for CYK Parsing. | This is a [[Category::Method]] page for CYK Parsing. | ||
| + | |||
| + | The Cocke–Younger–Kasami (CYK) algorithm is an algorithm for parsing PCFG. It is bottom up and makes use of dynamic programming. | ||
| + | |||
| + | ==Description== | ||
| + | |||
| + | The input to the algorithm is a grammar <math>G</math> in Chomsky Normal Form, and a sentence <math>X</math>. | ||
| + | The idea behind the parsing algorithm is to recursively build parses from bottom up, and mantaining a chart C[i, j] which contains productions that generates X_i to '''X[j]''' | ||
Revision as of 18:39, 30 October 2011
This is a Method page for CYK Parsing.
The Cocke–Younger–Kasami (CYK) algorithm is an algorithm for parsing PCFG. It is bottom up and makes use of dynamic programming.
Description
The input to the algorithm is a grammar in Chomsky Normal Form, and a sentence . The idea behind the parsing algorithm is to recursively build parses from bottom up, and mantaining a chart C[i, j] which contains productions that generates X_i to X[j]
