The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Computation of normalized edit distance and applications
Abstract
Given two strings X and Y over a finite alphabet, the normalized edit distance between X and Y, d(X,Y) is defined as the minimum of W(P)/L(P), where P is an editing path between X and Y, W(P) is the sum of the weights of the elementary edit operations of P, and L(P) is the number of these operations (length of P). It is shown that in general, d(X,Y) cannot be computed by first obtaining the conventional (unnormalized) edit distance between X and Y and then normalizing this value by the length of the corresponding editing path. In order to compute normalized edit distances, an algorithm that can be implemented to work in O(m*n/sup 2/) time and O(n/sup 2/) memory space is proposed, where m and n are the lengths of the strings under consideration, and m>or=n. Experiments in hand-written digit recognition are presented, revealing that the normalized edit distance consistently provides better results than both unnormalized or post-normalized classical edit distances.>
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
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
Sankoff, D., & Kruskal, J. B. (1983) · Medical Entomology and Zoology · Cited by 1,915
Syntactic pattern recognition and applications
Fu, K. (1968) · Medical Entomology and Zoology · Cited by 1,015
Syntactic pattern recognition and applications
Firschein, O. (1983) · Proceedings of the IEEE · doi:10.1109/proc.1983.12755 · Cited by 753
A faster algorithm computing string edit distances
Masek, W. J., & Paterson, M. S. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90002-1 · Cited by 651
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
The theory and computation of evolutionary distances: Pattern recognition
Sellers, P. H. (1980) · Journal of Algorithms · doi:10.1016/0196-6774(80)90016-4 · Cited by 372
Isolated and Connected Word Recognition--Theory and Selected Applications
Rabiner, L., & Levinson, S. (1981) · IEEE Transactions on Communications · doi:10.1109/tcom.1981.1095031 · Cited by 229
Optimal correspondence of string subsequences
Wang, Y. P., & Pavlidis, T. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.61707 · Cited by 60
Modelling (Sub)String Length Based Constraints through a Grammatical Inference Method
Rulot, H., & Vidal, E. (1987) · Springer eBooks · doi:10.1007/978-3-642-83069-3_35 · Cited by 44
Self-citation
Cited by
A Normalized Levenshtein Distance Metric
Yujian, L., & Bo, L. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1078 · Cited by 986
A survey of graph edit distance
Gao, X., Xiao, B., Tao, D., & Li, X. (2010) · Pattern Analysis and Applications · doi:10.1007/s10044-008-0141-y · Cited by 704
Performance Evaluation of Deep Neural Networks Applied to Speech Recognition: RNN, LSTM and GRU
Shewalkar, A., Nyavanandi, D., & Ludwig, S. A. (2019) · Journal of Artificial Intelligence and Soft Computing Research · doi:10.2478/jaiscr-2019-0006 · Cited by 576
Sebastian, T. B., Klein, P. N., & Kimia, B. B. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1159951 · Cited by 374
Ofli, F., Chaudhry, R., Kurillo, G., Vidal, R., & Bajcsy, R. (2014) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2013.04.007 · Cited by 318
Metadata
- Authors
- Marzal, A., & Vidal, E.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1993
- Volume
- 15
- Issue
- 9
- Pages
- 926-932
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2111643688
- Cited by
- 340
- References
- 11
- FWCI
- 2.96
- 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: Computation of normalized edit distance and applications. https://app.cochat.ai/papers/10.1109/34.232078
- The paper
- Marzal, A., & Vidal, E. (1993). Computation of normalized edit distance and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/34.232078
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.