Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 158

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Efficient parsing for bilexical context-free grammars and head automaton grammars

Open access
Eisner, Jason, Satta, Giorgio · 1999 · Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics -

Abstract

Several recent stochastic parsers use bilexical grammars, where each word type idiosyncratically prefers particular complements with particular head words. We present O(n4) parsing algorithms for two bilexical formalisms, improving the prior upper bounds of O(n5). For a common special case that was known to allow O(n3) parsing (Eisner, 1997), we present an O(n3) algorithm with an improved grammar constant.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3115/1034678.1034748

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 158

Metadata

Authors
Eisner, J., & Satta, G.
Venue
Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics -
Published
1999
Pages
457-464
OpenAlex
W2096466920
Cited by
158
References
3
FWCI
4.24
Type
conference paper
Language
en
Open access
gold

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Efficient parsing for bilexical context-free grammars and head automaton grammars. https://app.cochat.ai/papers/10.3115/1034678.1034748
The paper
Eisner, J., & Satta, G. (1999). Efficient parsing for bilexical context-free grammars and head automaton grammars. Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics -. https://doi.org/10.3115/1034678.1034748

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.