A Dynamic Programming Algorithm for the Distance Between Two Finite Areas

Key Points

Key points are not available for this paper at this time.

Abstract

The problems of speech recognition and orthographic word correction have been greatly mitigated by the use of dynamic programming techniques for finding the distance between two finite sequences. This paper extends the technique into two dimensions, and presents an algorithm for finding the distance between two finite areas. Applications of the algorithm are suggested.

Mark Helpful

Bookmark

Relay

Cite This Study

Roger K. Moore (Mon,) studied this question.

synapsesocial.com/papers/6a16dd1166334ab13b056989 https://doi.org/https://doi.org/10.1109/tpami.1979.4766879

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1An algorithm for the distance between two finite sequences1974 · 131 citations
2Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition1975 · 195 citations
3The String-to-String Correction Problem1974 · 3,061 citations
4Minimum prediction residual principle applied to speech recognition1975 · 1,609 citations
5A Method for the Correction of Garbled Words Based on the Levenshtein Metric1976 · 204 citations

Mark Helpful

Bookmark

Relay