NDLI: The use of a one-stage dynamic programming algorithm for connected word recognition

Content Provider	IEEE Xplore Digital Library
Author	Ney, H.
Copyright Year	1974
Abstract	This paper is of tutorial nature and describes a one-stage dynamic programming algorithm for file problem of connected word recognition. The algorithm to be developed is essentially identical to one presented by Vintsyuk [1] and later by Bridle and Brown [2] ; but the notation and the presentation have been clarified. The derivation used for optimally time synchronizing a test pattern, consisting of a sequence of connected words, is straightforward and simple in comparison with other approaches decomposing the pattern matching problem into several levels. The approach presented relies basically on parameterizing the time warping path by a single index and on exploiting certain path constraints both in the word interior and at the word boundaries. The resulting algorithm turns out to be significantly more efficient than those proposed by Sakoe [3] as well as Myers and Rabiner [4], while providing the same accuracy in estimating the best possible matching string. Its most important feature is that the computational expenditure per word is independent of the number of words in the input string. Thus, it is well suited for recognizing comparatively long word sequences and for real-time operation. Furthermore, there is no need to specify the maximum number of words in the input string. The practical implementation of the algorithm is discussed; it requires no heuristic rules and no overhead. The algorithm can be modified to deal with syntactic constraints in terms of a finite state syntax.
Starting Page	263
Ending Page	271
Page Count	9
File Size	1003593
File Format	PDF
ISSN	00963518
Volume Number	32
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1984-04-01
Publisher Place	U.S.A.
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Dynamic programming Heuristic algorithms Pattern matching Pattern recognition Testing Speech recognition Vocabulary Acoustics
Content Type	Text
Resource Type	Article
Subject	Signal Processing

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An algorithm for connected word recognition

Dynamic programming algorithm optimization for spoken word recognition

Two-level DP-matching--A dynamic programming-based pattern matching algorithm for connected word recognition

An investigation of the use of dynamic time warping for word spotting and connected speech recognition

Recognition of isolated-word sentences from a large vocabulary using dynamic time warping methods

Memory and time improvements in a dynamic programming algorithm for matching speech patterns

A level building dynamic time warping algorithm for connected word recognition

Connected word recognition using a level building dynamic time warping algorithm

A frame-synchronous network search algorithm for connected word recognition

The use of a one-stage dynamic programming algorithm for connected word recognition

Similar Documents

An algorithm for connected word recognition

Dynamic programming algorithm optimization for spoken word recognition

Two-level DP-matching--A dynamic programming-based pattern matching algorithm for connected word recognition

An investigation of the use of dynamic time warping for word spotting and connected speech recognition

Recognition of isolated-word sentences from a large vocabulary using dynamic time warping methods

Memory and time improvements in a dynamic programming algorithm for matching speech patterns

A level building dynamic time warping algorithm for connected word recognition

Connected word recognition using a level building dynamic time warping algorithm

A frame-synchronous network search algorithm for connected word recognition

The use of a one-stage dynamic programming algorithm for connected word recognition