Referenced Items are not available for this document.
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.
Published in:
Pattern Analysis and Machine Intelligence, IEEE Transactions on
(Volume:PAMI-1
,
Issue:
1
)
Date of Publication: Jan. 1979
- Page(s):
- 86 - 88
- ISSN :
- 0162-8828
- Digital Object Identifier :
- 10.1109/TPAMI.1979.4766879
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 27 January 2009
- Issue Date :
- Jan. 1979
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
