Publications (2)

1Experiments with Spectral Learning of LatentVariable PCFGsN , 1 ≤ i ≤ n, then apply the CKY algorithm to find the parse tree that maximizes the sum of the marginals. For simplicity...

2Approximate PCFG Parsing Using Tensor Decompositionj) ∈ τ if nonterminal a spans words xi · · ·xj in the parse tree τ . 488 Inputs: Sentence x1 · · ·xN , PCFG (N ,L,R)...