--- title: "Who cites Statistical Properties of Probabilistic…" description: "31 papers of the Elamur Research library cite «Statistical Properties of Probabilistic Context-Free Grammars», found in their bibliographies; the most…" canonical: "https://research.elamur.ai/free/en/papers/chi-1999-statistical-properties-probabilistic-context-free/cited-by/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/chi-1999-statistical-properties-probabilistic-context-free/cited-by/) [home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [Statistical Properties of Probabilistic…](https://md.research.elamur.ai/free/en/papers/chi-1999-statistical-properties-probabilistic-context-free/) / cited by # Who cites «Statistical Properties of Probabilistic Context-Free Grammars» 31 papers of our library cite it (of the 140,884 whose bibliographies we read) · 3 with a page here, the most cited first · [← the paper](https://md.research.elamur.ai/free/en/papers/chi-1999-statistical-properties-probabilistic-context-free/) 1. [**Improved Inference for Unlexicalized Parsing**Slav Petrov, Dan Klein*2007 · 941 citations*](https://md.research.elamur.ai/free/en/papers/petrov-2007-improved-inference-unlexicalized-parsing/) 2. [**Globally Normalized Transition-Based Neural Networks**Daniel Andor, Chris Alberti, David Weiss, et al.*2016 · 676 citations*](https://md.research.elamur.ai/free/en/papers/andor-2016-globally-normalized-transition-based-neural/) 3. [**Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinement**Alireza Mohammadshahi, James Henderson*2021 · 26 citations*](https://md.research.elamur.ai/free/en/papers/mohammadshahi-2021-recursive-non-autoregressive-graph-graph/) 28 more papers of our library cite it; they have no page here yet. - [← back to](https://md.research.elamur.ai/free/en/papers/chi-1999-statistical-properties-probabilistic-context-free/) — Statistical Properties of Probabilistic Context-Free Grammars