REVIEW 1 cited by
Parsing Inside-Out
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The inside-outside probabilities are typically used for reestimating Probabilistic Context Free Grammars (PCFGs), just as the forward-backward probabilities are typically used for reestimating HMMs. I show several novel uses, including improving parser accuracy by matching parsing algorithms to evaluation criteria; speeding up DOP parsing by 500 times; and 30 times faster PCFG thresholding at a given accuracy level. I also give an elegant, state-of-the-art grammar formalism, which can be used to compute inside-outside probabilities; and a parser description formalism, which makes it easy to derive inside-outside formulas and many others.
Forward citations
Cited by 1 Pith paper
-
Branch-and-bound method for calculating Viterbi path in triplet Markov models
A branch-and-bound algorithm with multiple bound types computes the most probable marginal path in triplet Markov models much faster than exhaustive search, with m-Viterbi giving the best lower bounds.
Discussion (0). Continue with ORCID to comment.