Continuous speech recognition system

Claim 2

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.

Claim 3

An arrangement for recognizing speech patterns, according to claim 1, including means for periodically alerting the system after a predetermined number of input frames are processed.

Claim 4

An arrangement for recognizing speech patterns, according to claim 1, including means for building the network according to a predetermined grammar model topology.

Claim 5

An arrangement for recognizing speech patterns, according to claim 1, including means for adding a link record to the network after a potential word end for at least one of said templates is recognized.

Claim 6

An arrangement for recognizing speech patterns, according to claim 1, including means for indicating the most recently appended link record in the network.

Claim 7

An arrangement for recognizing speech patterns, according to claim 1, including means for indicating a link record has no ancestor link records.

Claim 8

An arrangement for recognizing speech patterns, according to claim 1, including means for storing said link records in a table composed of free link records and established link records.

Claim 9

An arrangement for recognizing speech patterns, according to claim 7, including means for indicating the beginning of the established link records and the beginning of the free link records.

Claim 10

An arrangement for recognizing speech patterns, according to claim 7, including means for indicating the end of the established link records and the end of the free link records.

Claim 11

An arrangement for recognizing speech patterns, according to claim 1, including means for deleting temporary pointers for link records descending from said determined link records.

Claim 12

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.

Claim 13

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.

Claim 14

An arrangement for recognizing speech patterns, according to claim 11, including means for periodically alerting the system after a predetermined number of input frames are processed.

Claim 15

An arrangement for recognizing speech patterns, according to claim 11, including means for building the network according to a predetermined grammar model topology.

Claim 16

An arrangement for recognizing speech patterns, according to claim 11, including means for adding a link record to the network after a potential word end for at least one of said templates is recognized.

Claim 17

An arrangement for recognizing speech patterns, according to claim 11, including means for indicating the most recently appended link record in the network.

Claim 18

An arrangement for recognizing speech patterns, according to claim 11, including means for indicating a link record has no ancestor link records.

Claim 19

An arrangement for recognizing speech patterns, according to claim 11, including means for storing said link records in a table composed of free link records and established link records.

Claim 20

An arrangement for recognizing speech patterns, according to claim 17, including means for indicating the beginning of the established link records and the beginning of the free link records.

Claim 21

An arrangement for recognizing speech patterns, according to claim 17, including means for indicating the end of the established link records and the end of the free link records.

Claim 22

An arrangement for recognizing speech patterns, according to claim 11, including means for deleting temporary pointers for link records descending from said determined link records.

Claim 23

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.

Claim 24

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.

Claim 25

An arrangement for recognizing speech patterns, according to claim 21, including means for periodically alerting the system after a predetermined number of input frames are processed.

Claim 26

An arrangement for recognizing speech patterns, according to claim 21, including means for building the network according to a predetermined grammar model topology.

Claim 27

An arrangement for recognizing speech patterns, according to claim 21, including means for adding a link record to the network after a potential word end for at least one of said templates is recognized.

Claim 28

An arrangement for recognizing speech patterns, according to claim 21, including means for indicating the most recently appended link record in the network.

Claim 29

An arrangement for recognizing speech patterns, according to claim 21, including means for indicating a link record has no ancestor link records.

Claim 30

An arrangement for recognizing speech patterns, according to claim 21, including means for determining link records which have may have two or more potentially recognized descendant link records.

Claim 31

An arrangement for recognizing speech patterns, according to claim 21, including means for selecting particular link records in said established record space, whose corresponding templates have not been unambiguously recognized, and returning said particular link records to said free record space.

Claim 32

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.

Claim 33

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.

Claim 34

A method for recognizing speech patterns, according to claim 29, including the step of periodically alerting the system after a predetermined number of input frames are processed.

Claim 35

A method for recognizing speech patterns, according to claim 29, including the step of building the network according to a predetermined grammar model topology.

Claim 36

A method for recognizing speech patterns, according to claim 29, including the step of adding a link record to the network after a potential word end for at least one of said templates is recognized.

Claim 37

A method for recognizing speech patterns, according to claim 29, including the step of indicating the most recently appended link record in the network.

Claim 38

A method for recognizing speech patterns, according to claim 29, including the step of indicating a link record has no ancestor link records.

Claim 39

A method for recognizing speech patterns, according to claim 29, including the step of storing said link records in a table composed of free link records and established link records.

Claim 40

A method for recognizing speech patterns, according to claim 35, including the step of indicating the beginning of the established link records and the beginning of the free link records.

Claim 41

A method for recognizing speech patterns, according to claim 35, including the step of indicating the end of the established link records and the end of the free link records.

Claim 42

A method for recognizing speech patterns, according to claim 29, including the step of deleting temporary pointers for link records descending from said determined link records.

Claim 43

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.

Claim 44

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.

Claim 45

A method for recognizing speech patterns, according to claim 39, including the step of periodically alerting the system after a predetermined number of input frames are processed.

Claim 46

A method for recognizing speech patterns, according to claim 39, including the step of building the network according to a predetermined grammar model topology.

Claim 47

A method for recognizing speech patterns, according to claim 39, including the step of adding a link record to the network after a potential word end for at least one of said templates is recognized.

Claim 48

A method for recognizing speech patterns, according to claim 39, including the step of indicating the most recently appended link record in the network.

Claim 49

A method for recognizing speech patterns, according to claim 39, including the step of indicating a link record has no ancestor link records.

Claim 50

A method for recognizing speech patterns, according to claim 39, including the step of storing said link records in a table composed of free link records and established link records.

Claim 51

A method for recognizing speech patterns, according to claim 45, including the step of indicating the beginning of the established link records and the beginning of the free link records.

Claim 52

A method for recognizing speech patterns, according to claim 17, including the step of indicating the end of the established link records and the end of the free link records.

Claim 53

A method for recognizing speech patterns, according to claim 39, including the step of deleting temporary pointers for link records descending from said determined link records.

Claim 54

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.

Claim 55

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.

Claim 56

A method for recognizing speech patterns, according to claim 49, including the step of periodically alerting the system after a predetermined number of input frames are processed.

Claim 57

A method for recognizing speech patterns, according to claim 49, including the step of building the network according to a predetermined grammar model topology.

Claim 58

A method for recognizing speech patterns, according to claim 49, including the step of adding a link record to the network after a potential word end for at least one of said templates is recognized.

Claim 59

A method for recognizing speech patterns, according to claim 49, including the step of indicating the most recently appended link record in the network.

Claim 60

A method for recognizing speech patterns, according to claim 49, including the step of indicating a link record has no ancestor link records.

Claim 61

A method for recognizing speech patterns, according to claim 49, including the step of determining link records which may have two or more potentially recognized descendant link records.

Claim 62

A method for recognizing speech patterns, according to claim 49, including the step of selecting particular link records in said established record space, whose corresponding templates have not been output, and returning said particular link records to said free record space.