Continuous speech recognition system
First Claim
1. In a speech recognition system, wherein input frames are processed against prestored templates representing speech, and templates which are under consideration as potentially recognized templates are individually recorded in a linked network as link records, said link records generally having ancestor and descendant link records, an arrangement for recognizing speech patterns, comprising:
- means for providing temporary pointers for said link records;
means for tracing back through said network while labeling selected ones of said link records with said temporary pointers to connect potentially recognized templates corresponding to said ones of link records;
means for determining link records which may have two or more potentially recognized descendant link records;
means for deleting said temporary pointers corresponding to said determined link records; and
means for outputting data corresponding to said link records still labeled with said temporary pointers.
1 Assignment
0 Petitions
Accused Products
Abstract
A continuous speech recognition system employs a grammar tree of alternative potentially recognized word paths. A technique of tracing back through the grammar tree is utilized in determining which partial word path is common to all potential word paths. The common partial word path is deleted and words corresponding to the deleted partial word path are output as recognized words.
34 Citations
56 Claims
-
1. In a speech recognition system, wherein input frames are processed against prestored templates representing speech, and templates which are under consideration as potentially recognized templates are individually recorded in a linked network as link records, said link records generally having ancestor and descendant link records, an arrangement for recognizing speech patterns, comprising:
-
means for providing temporary pointers for said link records; means for tracing back through said network while labeling selected ones of said link records with said temporary pointers to connect potentially recognized templates corresponding to said ones of link records; means for determining link records which may have two or more potentially recognized descendant link records; means for deleting said temporary pointers corresponding to said determined link records; and means for outputting data corresponding to said link records still labeled with said temporary pointers. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. In speech recognition system, wherein input frames are processed against prestored templates representing speech, and templates which are under consideration as potentially recognized templates are individually recorded in a linked network as link records, said link records generally having ancestor and descendant link records, an arrangement for recognizing speech patterns, comprising:
-
means for storing said link records as indexed data sets, each data set including a symbol representing the template, a sequence indicator representing the relative time the link record was stored, a first pointer indicating a link record in the network from which each descends, and a second temporary pointer; means for tracing back through the network using said indexed data sets, including said second temporary pointer, to identify at least one link record which is unambiguously recognized; and means for outputting said unambiguously recognized link records. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20, 47)
-
-
21. In speech recognition system, wherein input frames are processed against prestored templates representing speech, and templates which are under consideration as potentially recognized templates are individually recorded in a linked network as link records, said link records generally said network having ancestor and descendant link records, an arrangement for recognizing speech patterns, comprising:
-
means for storing said link records as indexed data sets in a table, each data set including a symbol representing the template, a sequence indicator representing the relative time the link record was stored and a pointer indicating a link record in the network from which each descends; said table composed of free record space and established record space, wherein said link records are stored in said established record space; means for tracing back through the network using said indexed data sets to identify one or more link records whose corresponding templates are unambiguously recognized; means for outputting data representing said unambiguously recognized link records, and removing said link records from said established record space, whereby said removed link records becomes free record space for subsequently storing link records. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28)
-
-
29. In speech recognition system, wherein input frames are processed against prestored templates representing speech, and templates which are under consideration as potentially recognized templates are individually recorded in a linked network as link records, said link records generally having ancestor and descendant link records, a method for recognizing speech patterns, comprising the steps of:
-
providing temporary pointers for said link records; tracing back through said network while labeling selected ones of said link records with said temporary pointers to connect potentially recognized templates corresponding to said ones of link records; determining link records which may have two or more potentially recognized descendant link records; deleting said temporary pointers corresponding to said determined link records; and outputting data corresponding to said link records still labeled with said temporary pointers. - View Dependent Claims (30, 31, 32, 33, 34, 35, 36, 37, 38)
-
-
39. In speech recognition system, wherein input frames are processed against prestored templates representing speech, and templates which are under consideration as potentially recognized templates are individually recorded in a linked network as link records, said link records generally having ancestor and descendant link records, a method for recognizing speech patterns, comprising the steps of:
-
storing said link records as indexed data sets, each data set including a symbol representing the template, a sequence indicator representing the relative time the link record was stored, a first pointer indicating a link record in the network from which each descends, and a second temporary pointer; tracing back through the network using said indexed data sets, including said second temporary pointer, to identify at least one link record which is unambiguously recognized; and outputting said unambiguously recognized link records. - View Dependent Claims (40, 41, 42, 43, 44, 45, 46, 48)
-
-
49. In speech recognition system, wherein input frames are processed against prestored templates representing speech, and templates which are under consideration as potentially recognized templates are individually recorded in a linked network as link records, said link records generally said network having ancestor and descendant link records, a method for recognizing speech patterns, comprising the steps of:
-
storing said link records as indexed data sets in a table, each data set including a symbol representing the template, a sequence indicator representing the relative time the link record was stored and a pointer indicating a link record in the network from which each descends, said table composed of free record space and established record space, wherein said link records are stored in said established record space; tracing back through the network using said indexed data sets to identify one or more link records whose corresponding templates are unambiguously recognized; outputting data representing said unambiguously recognized link records, and removing said link records from said established record space, whereby said removed link records becomes free record space for subsequently storing link records. - View Dependent Claims (50, 51, 52, 53, 54, 55, 56)
-
Specification