The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Off-line cursive script word recognition
Abstract
Cursive script word recognition is the problem of transforming a word from the iconic form of cursive writing to its symbolic form. Several component processes of a recognition system for isolated offline cursive script words are described. A word image is transformed through a hierarchy of representation levels: points, contours, features, letters, and words. A unique feature representation is generated bottom-up from the image using statistical dependences between letters and features. Ratings for partially formed words are computed using a stack algorithm and a lexicon represented as a trie. Several novel techniques for low- and intermediate-level processing for cursive script are described, including heuristics for reference line finding, letter segmentation based on detecting local minima along the lower contour and areas with low vertical profiles, simultaneous encoding of contours and their topological relationships, extracting features, and finding shape-oriented events. Experiments demonstrating the performance of the system are also described.>
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
Cites
(1967) · Medical Entomology and Zoology · Cited by 7,532
Fast Sequential Decoding Algorithm Using a Stack
Jelinek, F. (1969) · IBM Journal of Research and Development · doi:10.1147/rd.136.0675 · Cited by 541
Visual recognition of isolated lower-case letters
Bouma, H. (1971) · Vision Research · doi:10.1016/0042-6989(71)90087-3 · Cited by 236
Machine recognition of handwritten words: A project report
Sayre, K. M. (1973) · Pattern Recognition · doi:10.1016/0031-3203(73)90044-7 · Cited by 230
Bahl, L., & Jelinek, F. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055419 · Cited by 196
Cursive Script Recognition by Elastic Matching
Tappert, C. C. (1982) · IBM Journal of Research and Development · doi:10.1147/rd.266.0765 · Cited by 161
Taylor, I. K., & Taylor, M. M. (1983) · Cited by 149
Experiments on computer recognition of connected handwritten words
Mermelstein, P., & Eden, M. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90142-1 · Cited by 77
Word-Level Recognition of Cursive Script
Farag (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675310 · Cited by 67
Kock, W. E. (1961) · Physics Today · doi:10.1063/1.3057269 · Cited by 61
Cited by
The state of the art in online handwriting recognition
Tappert, C. C., Suen, C. Y., & Wakahara, T. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.57669 · Cited by 857
Metadata
- Authors
- Bozinovic, R. M., & Srihari, S. N.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1989
- Volume
- 11
- Issue
- 1
- Pages
- 68-83
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2172248551
- Cited by
- 455
- References
- 14
- FWCI
- 5.46
- 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: Off-line cursive script word recognition. https://app.cochat.ai/papers/10.1109/34.23114
- The paper
- Bozinovic, R. M., & Srihari, S. N. (1989). Off-line cursive script word recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/34.23114
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.