26
Consider the PCFG given below:
Using CKY algorithm for PCFG, find the no. of parse trees for the string "ababa" and the probability score for the most probable tree.
| S -> A B | 0.3 | |
| S -> B C | 0.7 | |
| A -> B A | 0.4 | |
| A -> a | 0.6 | |
| B -> CC | 0.7 | |
| B -> b | 0.3 | |
| C -> A B | 0.3 | |
| C -> a | 0.7 |

