The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
A Novel Word Spotting Method Based on Recurrent Neural Networks
Abstract
Keyword spotting refers to the process of retrieving all instances of a given keyword from a document. In the present paper, a novel keyword spotting method for handwritten documents is described. It is derived from a neural network-based system for unconstrained handwriting recognition. As such it performs template-free spotting, i.e., it is not necessary for a keyword to appear in the training set. The keyword spotting is done using a modification of the CTC Token Passing algorithm in conjunction with a recurrent neural network. We demonstrate that the proposed systems outperform not only a classical dynamic time warping-based approach but also a modern keyword spotting system, based on hidden Markov models. Furthermore, we analyze the performance of the underlying neural networks when using them in a recognition task followed by keyword spotting on the produced transcription. We point out the advantages of keyword spotting when compared to classic text line recognition.
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
Dynamic Programming Algorithm Optimization for Spoken Word Recognition
Sakoe, H., & Chiba, S. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163055 · Cited by 6,727
SRILM - an extensible language modeling toolkit
Stolcke, A. (2002) · 7th International Conference on Spoken Language Processing (ICSLP 2002) · doi:10.21437/icslp.2002-303 · Cited by 4,326
Online and off-line handwriting recognition: a comprehensive survey
Plamondon, R., & Srihari, S. N. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.824821 · Cited by 2,498
The SMART Retrieval System—Experiments in Automatic Document Processing
Salton, G. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,252
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16
Storkey, A. (2004) · neural information processing systems · Cited by 2,085
A Novel Connectionist System for Unconstrained Handwriting Recognition
Graves, A., Liwicki, M., Fernandez, S., Bertolami, R., Bunke, H., & Schmidhuber, J. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.137 · Cited by 1,983
Self-citationThe IAM-database: an English sentence database for offline handwriting recognition
Marti, U.-V., & Bunke, H. (2002) · International Journal on Document Analysis and Recognition · doi:10.1007/s100320200071 · Cited by 1,478
Self-citationA Markov random field model for term dependencies
Metzler, D., & Croft, W. B. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076115 · Cited by 843
Word image matching using dynamic time warping
Rath, T. M., & Manmatha, R. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211511 · Cited by 574
Self-citationMarti, U.-V., & Bunke, H. (2001) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001401000848 · Cited by 408
Self-citation
Cited by
Reading text in the wild with convolutional neural networks
Jaderberg, M., Simonyan, K., Vedaldi, A., & Zisserman, A. (2016) · International Journal of Computer Vision · doi:10.1007/s11263-015-0823-z · Cited by 1,191
Word Spotting and Recognition with Embedded Attributes
Almazan, J., Gordo, A., Fornes, A., & Valveny, E. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2339814 · Cited by 517
Metadata
- Authors
- Frinken, V., Fischer, A., Manmatha, R., & Bunke, H.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2012-02
- Volume
- 34
- Issue
- 2
- Pages
- 211-224
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2062755747
- Cited by
- 263
- References
- 40
- FWCI
- 23.12
- 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
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.