First unified benchmark finds GLR family has only 3x median slowdown over LR(1) on deterministic grammars and is the fastest among generalized parsers.
An efficient context-free parsing algorithm , url =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 3roles
method 1polarities
use method 1representative citing papers
Varying the number of simultaneous parses in RNNGs increases predicted garden-path effects but does not fully reconcile LM surprisal with human reading times.
Prefix parsing is solved by a grammar transformation that turns it into standard parsing on a slightly larger grammar.
citing papers explorer
-
An Empirical Comparison of General Context-Free Parsers
First unified benchmark finds GLR family has only 3x median slowdown over LR(1) on deterministic grammars and is the fastest among generalized parsers.
-
Why are language models less surprised than humans? Testing the Parse Multiplicity Mismatch Hypothesis
Varying the number of simultaneous parses in RNNGs increases predicted garden-path effects but does not fully reconcile LM surprisal with human reading times.
-
Prefix Parsing is Just Parsing
Prefix parsing is solved by a grammar transformation that turns it into standard parsing on a slightly larger grammar.