Recognition system using lexical trees

Details Recognition system using lexical trees Recognition system using lexical trees

2006-04-25

2006-04-25

Knepper, David D. (Department: 2654)

Data processing: speech signal processing, linguistics, language

Speech signal processing

Recognition

C704S242000, C704S252000, C704S243000

Reexamination Certificate

active

07035802

ABSTRACT:
The dynamic programming technique employs a lexical tree that is encoded in computer memory as a flat representation in which the nodes of each generation occupy contiguous memory locations. The traversal algorithm employs a set of traversal rules whereby nodes of a given generation are processed before the parent nodes of that generation. The deepest child generation is processed first and traversal among nodes of each generation proceeds in the same topological direction.

REFERENCES:
patent: 5884259 (1999-03-01), Bahl et al.
patent: 5983180 (1999-11-01), Robinson
patent: 6240389 (2001-05-01), Keiller et al.
patent: 6374222 (2002-04-01), Kao
patent: 6389416 (2002-05-01), Agarwal et al.
patent: 6574595 (2003-06-01), Mitchell et al.
Ney, Hermann; Ortmanns, Stefan; “Progress in Dynamic Programming Search for LVCSR”, Automatic speech Recognition and Understanding, 1997. Proceedings., 1997 IEEE Workshop on Santa Barbara, CA., pp. 287-294.
Hermann Ney and Stefan Ortmanns, “Dynamic Programming Search for Continuous Speech Recognition,” IEEE Signal Processing Magazine, 1053-5888/99, Sep. 1999, pp. 64-83.
Julian James Odell, “The Use of Context in Large Vocabulary Speech Recognition,” Queens' College, Mar. 1995, pp. II-136.
Kris Demuynck, Jacques Duchateau, Dirk Van Compernolle, Patrick Wambacq, “An Efficient Search Space Representation for Large Vocabulary Continuous Speech Recognition,” Elsevier, Speech Communication 30 (2000) 37-53, pp. 37-53.
Mosur K. Ravishankar, “Efficient Algorithms for Speech Recognition,” May 15, 1996, CMU-CS-96-143, pp. i-132.
Neeraj Deshmukh, Aravind Ganapathiraju, and Joseph Picone, “Hierarchical Search for Large-Vocabulary Conversational Speech Recognition,” IEEE Signal Processing Magazine, 1053-5888/99, Sep. 1999, pp. 84-107.
Stefan Ortmanns, Andreas Eiden, Hermann Ney and Norbert Coenen, “Look-Ahead Techniques for Fast Beam Search,” Copyright 1997 IEEE, pp. 1783-1786.

Affiliated with

Also associated with

Rating

Recognition system using lexical trees does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Recognition system using lexical trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recognition system using lexical trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3575543