Edge-Based Best-First Chart Parsing

  title={Edge-Based Best-First Chart Parsing},
  author={Eugene Charniak and Sharon Goldwater and Mark Johnson},
Best-first probabilistic chart parsing attempts to parse efficiently by working on edges that are judged ~'best" by some probabilistic figure of merit (FOM). Recent work has used probabilistic context-free grammars (PCFGs) to assign probabilities to constituents, and to use these probabilities as the starting point for the FOM. This paper extends this approach to using a probabilistic FOM to judge edges (incomplete constituents), thereby giving a much finergrained control over parsing effort… CONTINUE READING
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 94 citations. REVIEW CITATIONS
68 Citations
4 References
Similar Papers


Publications citing this paper.

94 Citations

Citations per Year
Semantic Scholar estimates that this publication has 94 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.

Similar Papers

Loading similar papers…