The DOI matches its Crossref record.
Partial parsing via finite-state cascades
Abstract
Finite state cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified by finite state cascades are fast and reliable. They can be extended at modest cost to construct parse trees with finite feature structures. Finally, such deterministic parsers do not necessarily involve trading off accuracy against speed — they may in fact be more accurate than exhaustive search stochastic context free parsers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Learning with compositional semantics as structural inference for subsentential sentiment analysis
Choi, Y., & Cardie, C. (2008) · Proceedings of the Conference on Empirical Methods in Natural Language Processing - EMNLP '08 · doi:10.3115/1613715.1613816 · Cited by 332
Turn-taking cues in task-oriented dialogue
Gravano, A., & Hirschberg, J. (2011) · Computer Speech & Language · doi:10.1016/j.csl.2010.10.003 · Cited by 254
Generating robust parsers using island grammars
Moonen, L. (2002) · Proceedings Eighth Working Conference on Reverse Engineering · doi:10.1109/wcre.2001.957806 · Cited by 252
Bigrams of Syntactic Labels for Authorship Discrimination of Short Texts
Hirst, G., & Feiguina, O. (2007) · Literary and Linguistic Computing · doi:10.1093/llc/fqm023 · Cited by 227
Online perceptual learning and natural language acquisition for autonomous robots
Alomari, M., Li, F., Hogg, D. C., & Cohn, A. G. (2022) · Artificial Intelligence · doi:10.1016/j.artint.2021.103637 · Cited by 17
Metadata
- Authors
- ABNEY, S.
- Venue
- Natural Language Engineering
- Publisher
- Cambridge University Press (CUP)
- Published
- 1996-12
- Volume
- 2
- Issue
- 4
- Pages
- 337-344
- ISSN
- 1351-3249 (ISSN-L)
- 1469-8110
- OpenAlex
- W2035967403
- Cited by
- 478
- References
- 0
- FWCI
- 15.38
- Type
- journal article
- Language
- en
- Open access
- closed
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: Partial parsing via finite-state cascades. https://app.cochat.ai/papers/10.1017/s1351324997001599
- The paper
- ABNEY, S. (1996). Partial parsing via finite-state cascades. Natural Language Engineering. https://doi.org/10.1017/s1351324997001599
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.