A probabilistic LCFRS (PLCFRS) (Kato et al., 2006) is a tuple N, T, V, P, S, p such that N, T, V, P, S is a LCFRS and p : P → [0..1] a function such that for all A ∈ N : We use a probabilistic version of the CYK parser from (Seki et al., 1991), applying techniques of weighted deductive parsing (Nederhof, 2003).
our outside weights are only figures of merit (FOM).