Scribd
Upload
219 views

CYK Algorithm

The CYK algorithm is used to determine if a string is in the language generated by a context-free grammar. It works by constructing a triangular table and filling it using the grammar rules. For the example grammar G and string "ababa", the algorithm constructs a 5x5 table, compares grammar rule pairs to populate the cells, and determines that "ababa" is in the language since S is present in the final X1,5 cell. The CYK algorithm runs in O(n3) time.

Uploaded by

Habibatur Rofi'ah
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
219 views

CYK Algorithm

The CYK algorithm is used to determine if a string is in the language generated by a context-free grammar. It works by constructing a triangular table and filling it using the grammar rules. For the example grammar G and string "ababa", the algorithm constructs a 5x5 table, compares grammar rule pairs to populate the cells, and determines that "ababa" is in the language since S is present in the final X1,5 cell. The CYK algorithm runs in O(n3) time.

Uploaded by

Habibatur Rofi'ah
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 30

The CYK Algorithm

David Rodriguez-Velazquez CS 6800 Summer I - 2009

The CYK Algorithm


The membership problem:
Problem:
Given a context-free grammar G and a string w
G = (V, ,P , S) where V finite set of variables (the alphabet) finite set of terminal symbols P finite set of rules S start symbol (distinguished element of V) V and are assumed to be disjoint G is used to generate the string of a language

Question:
Is w in L(G)?

The CYK Algorithm


J. Cocke D. Younger, T. Kasami
Independently developed an algorithm to answer this question.

The CYK Algorithm Basics


The Structure of the rules in a Chomsky Normal Form grammar Uses a dynamic programming or table-filling algorithm

Chomsky Normal Form


Normal Form is described by a set of conditions that each rule in the grammar must satisfy Context-free grammar is in CNF if each rule has one of the following forms:
A BC A a, or S where B, C at most 2 symbols on right side terminal symbol null string V {S}

Construct a Triangular Table


Each row corresponds to one length of substrings
Bottom Row Strings of length 1 Second from Bottom Row Strings of length 2 . . Top Row string w

Construct a Triangular Table


Xi, i is the set of variables A such that A wi is a production of G

Compare at most n pairs of previously computed sets:


(Xi, i , Xi+1, j ), (Xi, i+1 , Xi+2, j ) (Xi, j-1 , Xj, j )

Construct a Triangular Table


X1, 5 X1, 4 X1, 3 X1, 2 X1, 1
w1

X2, 5 X2, 4 X2, 3 X2, 2


w2

X3, 5 X3, 4 X3, 3


w3

X4, 5 X4, 4
w4

X5, 5
w5

Table for string w that has length 5

Construct a Triangular Table


X1, 5 X1, 4 X1, 3 X1, 2 X1, 1
w1

X2, 5 X2, 4 X2, 3 X2, 2


w2

X3, 5 X3, 4 X3, 3


w3

X4, 5 X4, 4
w4

X5, 5
w5

Looking for pairs to compare

Example CYK Algorithm


Show the CYK Algorithm with the following example:
CNF grammar G
S AB | BC A BA | a B CC | b C AB | a

w is baaba Question Is baaba in L(G)?

Constructing The Triangular Table


S AB | BC A BA | a B CC | b C AB | a

{B}
b

{A, C}
a

{A, C}
a

{B}
b

{A, C}
a

Calculating the Bottom ROW

Constructing The Triangular Table


X1 , 2 = (Xi , i ,Xi+1 , j) = (X1 , 1 , X2 , 2) {B}{A,C} = {BA, BC} Steps:
Look for production rules to generate BA or BC There are two: S and A X1 , 2 = {S, A} S AB | BC
A BA | a B CC | b C AB | a

Constructing The Triangular Table

{S, A} {B}
b

{A, C}
a

{A, C}
a

{B}
b

{A, C}
a

Constructing The Triangular Table


X2 , 3 = (Xi , i ,Xi+1 , j) = (X2 , 2 , X3 , 3) {A, C}{A,C} = {AA, AC, CA, CC} = Y Steps:
Look for production rules to generate Y There is one: B S AB | BC X2 , 3 = {B} A BA | a
B CC | b C AB | a

Constructing The Triangular Table

{S, A} {B}
b

{B} {A, C}
a

{A, C}
a

{B}
b

{A, C}
a

Constructing The Triangular Table


X3 , 4 = (Xi , i ,Xi+1 , j) = (X3 , 3 , X4 , 4) {A, C}{B} = {AB, CB} = Y Steps:
Look for production rules to generate Y There are two: S and C S AB | BC X3 , 4 = {S, C} A BA | a
B CC | b C AB | a

Constructing The Triangular Table

{S, A} {B}
b

{B} {A, C}
a

{S, C} {A, C}
a

{B}
b

{A, C}
a

Constructing The Triangular Table


X4 , 5 = (Xi , i ,Xi+1 , j) = (X4 , 4 , X5 , 5) {B}{A, C} = {BA, BC} = Y Steps:
Look for production rules to generate Y There are two: S and A S AB | BC X4 , 5 = {S, A} A BA | a
B CC | b C AB | a

Constructing The Triangular Table

{S, A} {B}
b

{B} {A, C}
a

{S, C} {A, C}
a

{S, A} {B}
b

{A, C}
a

Constructing The Triangular Table


X1 , 3 = (Xi , i ,Xi+1 , j) (Xi , i+1 ,Xi+2 , j)
= (X1 , 1 , X2 , 3) , (X1 , 2 , X3 , 3)

{B}{B} U {S, A}{A, C}= {BB, SA, SC, AA, AC} = Y Steps:
Look for production rules to generate Y S AB | BC There are NONE: S and A A BA | a B CC | b X1 , 3 = C AB | a no elements in this set (empty set)

Constructing The Triangular Table

{S, A} {B}
b

{B} {A, C}
a

{S, C} {A, C}
a

{S, A} {B}
b

{A, C}
a

Constructing The Triangular Table


X2 , 4 = (Xi , i ,Xi+1 , j) (Xi , i+1 ,Xi+2 , j)
= (X2 , 2 , X3 , 4) , (X2 , 3 , X4 , 4)

{A, C}{S, C} U {B}{B}= {AS, AC, CS, CC, BB} = Y Steps:


Look for production rules to generate Y S AB | BC There is one: B A BA | a B CC | b X2 , 4 = {B} C AB | a

Constructing The Triangular Table

{S, A} {B}
b

{B} {B} {A, C}


a

{S, C} {A, C}
a

{S, A} {B}
b

{A, C}
a

Constructing The Triangular Table


X3 , 5 = (Xi , i ,Xi+1 , j) (Xi , i+1 ,Xi+2 , j)
= (X3 , 3 , X4 , 5) , (X3 , 4 , X5 , 5)

{A,C}{S,A} U {S,C}{A,C} = {AS, AA, CS, CA, SA, SC, CA, CC} = Y Steps:
Look for production rules to generate Y There is one: B X3 , 5 = {B}
S AB | BC A BA | a B CC | b C AB | a

Constructing The Triangular Table

{S, A} {B}
b

{B} {B} {A, C}


a

{B} {S, C} {A, C}


a

{S, A} {B}
b

{A, C}
a

Final Triangular Table


{S, A, C} {S, A} {B}
b

X1, 5 {S, A, C} {B} {B} {A, C}


a

{B} {S, C} {A, C}


a

{S, A} {B}
b

{A, C}
a

- Table for string w that has length 5 - The algorithm populates the triangular table

Example (Result)
Is baaba in L(G)? Yes We can see the S in the set X1n where n = 5 We can see the table the cell X15 = (S, A, C) then if S X15 then baaba L(G)

Theorem
The CYK Algorithm correctly computes X i j for all i and j; thus w is in L(G) if and only if S is in X1n. The running time of the algorithm is O(n3).

References
J. E. Hopcroft, R. Motwani, J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Second Edition, Addison Wesley, 2001 T.A. Sudkamp, An Introduction to the Theory of Computer Science Languages and Machines, Third Edition, Addison Wesley, 2006

Question
Show the CYK Algorithm with the following example:
CNF grammar G
S AB | BC A BA | a B CC | b C AB | a

w is ababa Question Is ababa in L(G)?

Basics of CYK Algorithm


The Structure of the rules in a Chomsky Normal Form grammar Uses a dynamic programming or table-filling algorithm

Complexity O(n3)

You might also like