The CYK Algorithm Implementation Wesam Fadheel &

Transcript:The CYK Algorithm Implementation Wesam Fadheel &:
The CYK Algorithm Implementation Wesam Fadheel & Mohammed Hamdi CS 6800 Spring 2016, WMU Outline CYK Algorithm. The basics of CYK Algorithm. The Chomsky Normal Form CNF. CYK Algorithm steps. How does the CYK Algorithm start? Build the Triangular Table & example 1. Build the Upper Diagonal Matrix Table & example 2. Notes. References. The CYK Algorithm It is called CYK or CKY Algorithm according to its inventors Cocke-Kasami-Younger. It is a membership problem to determine weather the string (w) belongs to the grammar (G) or not. The CYK Algorithm It is a bottom-up parser that uses the nondeterministic way in backtracking to build the table. Trace all rules and non terminal variables that derive the string ( if w  L (G) ). The basics of the CYK Algorithm It works only with rules in Chomsky Normal Form CNF. Dynamic Programming Approach in constructing the table. What are the basics of CYK Algorithm ? The Chomsky Normal Form CNF A context free grammar G=(V, , P, S) in which each rule must satisfy a set of conditions. Each rule should be as one of the following forms : A  BC A  a S   Where BC  V – {S} The CYK Algorithm steps G is a CNF grammar, w = is a string. For j = 1 to n do : If G contains the rule X  , then add X to T [ 1, j ]. For i = 2 to n do : For j = 1 to n – i + 1 do : For k = 1 to i - 1 do : For each rule X  YZ do : If Y  T [ k, j ] and Z  T [ i - k, j + k ], then : Insert X into [ i, j ]. If  T [ n, 1 ] then accept, else reject. State the CYK Algorithm steps. How does the CYK Algorithm start? Count the number of terminals in the given string to determine the dimension of the table. Look for the terminals in the right side of the given CNF rules. Start to build the table from the lower row. 1. Build the Triangular Table In each cell in the lower row, assign the variables in the CNF rules that derive each given terminal in the string. Continue to construct