To provide a list of candidate expressions with their associated probabilities, we employ a k-best CKY parser.
we implement Algorithm 3 described in Huang and Chiang (2005), providing an O(Gn 3 k log k) algorithm with respect to the grammar size G, phrase length n, and beam size k. We set the beam size to 2000.