The DOI matches its Crossref record.
Constraint grammar as a framework for parsing running text
Open accessAbstract
idea is to maximize the use of morphological information for parsing purposes. All relevant structure is assigned directly via lexicon, morphology, and simple mappings from morphology to syntax. The task of the constraints is basically to discard as many alternatives as possible, the optimum being a fully disambiguated sentence with one syntactic reading only. The second central idea is to treat morphological disambiguation and syntactic labelling by the same mechanism of discarding improper alternatives. 168 A good parsing formalism should satisfy many requirements: the constraints should be declarative rather than procedural, they should be able to cope with any real-world text-sentence (i.e. with running text, not just with linguists' laboratory sentences), they should be clearly separated from the program code by which they are executed, the formalism should be language-independent, it should be reasonably easy to implement (optimally as finite-state automata), and it should als
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
Robust part-of-speech tagging using a hidden Markov model
Kupiec, J. (1992) · Computer Speech & Language · doi:10.1016/0885-2308(92)90019-z · Cited by 416
A non-projective dependency parser
Tapanainen, P., & Järvinen, T. (1997) · Proceedings of the fifth conference on Applied natural language processing - · doi:10.3115/974557.974568 · Cited by 369
Bootstrapping parsers via syntactic projection across parallel texts
HWA, R., RESNIK, P., WEINBERG, A., CABEZAS, C., & KOLAK, O. (2005) · Natural Language Engineering · doi:10.1017/s1351324905003840 · Cited by 340
Improving SMT quality with morpho-syntactic analysis
Nießen, S., & Ney, H. (2000) · Proceedings of the 18th conference on Computational linguistics - · doi:10.3115/992730.992809 · Cited by 80
Metadata
- Authors
- Karlsson, F.
- Venue
- Proceedings of the 13th conference on Computational linguistics -
- Published
- 1990
- Volume
- 3
- Pages
- 168-173
- ISSN
- 1525-2477 (ISSN-L)
- OpenAlex
- W2046592963
- Cited by
- 206
- References
- 0
- FWCI
- 3.78
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: Constraint grammar as a framework for parsing running text. https://app.cochat.ai/papers/10.3115/991146.991176
- The paper
- Karlsson, F. (1990). Constraint grammar as a framework for parsing running text. Proceedings of the 13th conference on Computational linguistics -. https://doi.org/10.3115/991146.991176
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.
