EP0272723A1 - Procédé et dispositif pour déterminer l'évolution temporelle d'un paramètre de la parole - Google Patents

Procédé et dispositif pour déterminer l'évolution temporelle d'un paramètre de la parole Download PDF

Info

Publication number
EP0272723A1
EP0272723A1 EP87202298A EP87202298A EP0272723A1 EP 0272723 A1 EP0272723 A1 EP 0272723A1 EP 87202298 A EP87202298 A EP 87202298A EP 87202298 A EP87202298 A EP 87202298A EP 0272723 A1 EP0272723 A1 EP 0272723A1
Authority
EP
European Patent Office
Prior art keywords
value
values
speech parameter
speech
memory
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP87202298A
Other languages
German (de)
English (en)
Other versions
EP0272723B1 (fr
Inventor
Hermann Ney
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Koninklijke Philips NV
Original Assignee
Philips Patentverwaltung GmbH
Philips Gloeilampenfabrieken NV
Koninklijke Philips Electronics NV
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Philips Patentverwaltung GmbH, Philips Gloeilampenfabrieken NV, Koninklijke Philips Electronics NV filed Critical Philips Patentverwaltung GmbH
Publication of EP0272723A1 publication Critical patent/EP0272723A1/fr
Application granted granted Critical
Publication of EP0272723B1 publication Critical patent/EP0272723B1/fr
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G10—MUSICAL INSTRUMENTS; ACOUSTICS
    • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
    • G10L25/00—Speech or voice analysis techniques not restricted to a single one of groups G10L15/00 - G10L21/00
    • G10L25/90—Pitch determination of speech signals

Definitions

  • the invention relates to a method for determining the temporal course of a speech parameter of a speech signal, an individual value being available at discrete times for each value of a predetermined value range of the speech parameter and the temporal course representing the sequence of the adjacent, including diagonally adjacent, speech signal parameter values, the individual value of which is at least close the extreme values of the individual values for the individual points in time, the sum of the individual values of this sequence forming an extreme sum value compared to other sequences.
  • a speech parameter can be, for example, the fundamental frequency or a formant of a speech signal to be examined.
  • Other speech parameters are, for example, LPC coefficients (linear prediction coefficient).
  • the individual values of the basic speech frequency can be determined using AMDF (Average Magnitude Difference Function).
  • AMDF Average Magnitude Difference Function
  • the speech signal is sampled, for example, with a sampling period of 10 kHz, and a certain number of successive samples, that is to say represent a speech signal section in total, are gradually shifted by a number of sampling points with respect to the speech signal, and the difference between the samples of the undisplaced and the shifted signal becomes added up for the individual displacement steps.
  • the shift that gives the smallest sum value generally denotes the period of the fundamental speech frequency.
  • these values are not always clear, small sum values can occur in periods of harmonics or formants, and there are other influences that falsify the correct determination of the fundamental speech frequency.
  • the AMDF gives a value for each of the successive speech sections which are shifted against the speech signal, in the case of different shifts, which indicates a certain probability or more precisely unlikely that the shift in question indicates the basic period of the speech signal.
  • the object of the invention is therefore to provide a method of the type mentioned at the outset which approximates this most likely course of a speech parameter as well as possible.
  • This object is achieved in that, based on the minimum, the extreme value of the individual values and as a sum extreme value at each point in time i in a first run in succession for all speech parameter values k which follow one another in one direction, a first directional value D ⁇ (k, i) as the sum of the relevant individual value and the minimum of the following values D (k, i-1) D (l, i-1) + a (d (k, i) + A) D ⁇ (l, i) + b (d (k, i) + A) and a reference value h ⁇ (k, i) on the individual value providing the minimum is formed and stored, where D (k, i-1) or D (l, i-1) a sum value generated and stored at the respectively previous point in time i-1 and the same speech parameter value k or the previous speech parameter value l, D (l, i) the direction value formed at the immediately preceding speech parameter value and a, b, A are predetermined fixed quantities, that a second direction value
  • the method according to the invention determines sequences of speech parameter values which give different values of the sums of the individual values at the end of the speech signal, and the sequence which gives the minimum of the sum value at the end of the speech signal is regarded as the most likely sequence . This sequence can then be traced back by storing the overall reference values for each language parameter at any time.
  • the at least two runs for the separate determination of the two direction values i.e. once in the upward direction and once in the downward direction or vice versa, are necessary, since for each direction value for a possible course in the vertical direction the direction value immediately preceding in the relevant direction must also be taken into account and must therefore be determined beforehand.
  • the various values formed in the method according to the invention must be saved, since they are then used further. However, a precise examination of the course of the method according to the invention shows that different values are only required during a relatively short period of time.
  • An embodiment of the invention is therefore characterized in that the direction values D ⁇ , D ⁇ and the reference values h ⁇ , h ⁇ and the new total values are stored for only one point in time and then overwritten again. For all language parameters at all times, only the total reference values need to be saved, since only these are necessary for retracing the sequence that was determined to be optimal at the end, while the other values are only saved for one point in time since they are then no longer required.
  • the determination of the total value of all speech parameters is only required for the previous point in time, while the determined direction values are only required for the current point in time. This can save a lot of storage space.
  • a further embodiment of the invention is therefore characterized in that the direction values D ⁇ , D ⁇ and the reference values h ⁇ , h ⁇ are only stored for the speech parameter values k which follow one another in one direction and that after the formation of each directional value D ⁇ , D ⁇ for the successive speech parameter values k in the other direction, the new total value D and the overall reference value H are stored. In this way, the required memory requirement can be reduced even further.
  • An arrangement for carrying out the method according to the invention is characterized by a first memory for the individual values d (k, i) of all speech parameter values k at least at one point in time i, a second memory for a sum value D (k, i) for each speech parameter value k of at least one point in time i, a third memory for a first directional value D ⁇ (k, i) and an indication value h ⁇ (k, i) for each speech parameter value k of at least one point in time i, a fourth memory for a second directional value D ⁇ (k, i) and an associated reference value h ⁇ (k, i) of at least one speech parameter value k for the same time i as the values in the third memory, a fifth memory for the total reference values H (k, i) for all speech parameter values k and all times i, -
  • a processing arrangement with inputs which are coupled to a data output of the first, the second and the third or fourth memory, and with an output for outputting
  • Fig. 1 the course of a speech parameter over time is shown schematically in a two-dimensional representation.
  • the speech parameter is the basic voice frequency acts.
  • each speech parameter value k ie for each crossing point of the two coordinates indicated by a small circle.
  • This can be obtained, for example, by sampling the speech signal at a high frequency, for example 10 kHz. In each case a number, for example 100 to 200, samples result in a speech segment which therefore has a duration of 10 to 20 msec.
  • the samples of the speech signal are then designated s (i, j), the index i indicating the speech segments and the index j indicating the samples in a speech segment.
  • d (k, i):
  • Each shift k thus corresponds to a certain frequency. In this way, a value arises for each value of k within a predetermined value range that corresponds to the practically occurring basic speech frequencies Individual value d (k, i).
  • These individual values can be understood as a kind of probability or improbability that the frequency indicated by the speech parameter value k is actually the basic frequency of the speech signal in this speech segment, so that the individual value for the speech parameter value k is a minimum corresponding to the actual basic frequency.
  • FIG. 1 certain crossing points of the two coordinates k and i, each corresponding to an individual value, are connected to one another by a line in order to show an example of a possible temporal course of the basic voice frequency.
  • the line connects such a sequence of individual values, so that the sum of these individual values connected in this way results in a minimum compared to any other connection, whereby this connection can only run horizontally, diagonally or vertically.
  • a vertical course of the basic speech frequency cannot occur in practice, but these are time-discrete values, so that a rapid change in the basic speech frequency between two successive points in time i in the discrete model of FIG. 1 must be approximated by a vertical course.
  • the direction value D+ (k, i) is determined for the ascending direction, for which the sum value or direction value formed for each of the three neighboring points is used and increased by the individual value d (k, i) at the relevant point. Since a horizontal course is more likely than an oblique course or in particular a vertical course, the values D (k-1, i-1) of the diagonally adjacent point and D+ (k-1, i) of the point perpendicularly below are not used directly , but increased by a certain value, as will be explained in detail later. The value D+ (k-1, i) of the vertically underlying point must have been determined beforehand, and for this in turn the value of the underlying point must be determined, etc.
  • the direction values D administraten and the direction values D ⁇ of both directions are therefore determined for all speech parameter values at a time i, and the minimum is determined and stored as a new sum value D therefrom.
  • the speech parameter value k at which this sum value D is the smallest of all other sum values at this point in time indicates the end of the sequence. So that the course of the sequence can be traced back from this end, it must be saved for each direction value and then for the sum value from which previous point this direction value or sum value has been reached.
  • the horizontal direction is contained in each of the two direction values D+ and D ⁇ , so that if this direction gives the smallest direction value, both direction values are the same. The horizontal direction could therefore be omitted for the one direction value.
  • D+ (k) d (k, i) + min ⁇ D (k, i-1), D (k-1, i-1) + a [d (k, i) + A], D+ (k-1, i) + b [d (k, i) + A] ⁇ (1)
  • this equation means that the individual value d (k, i) is added to the minimum of the sum values of the three neighboring points, whereby for the horizontal direction the sum value D (k, i-1) is used directly, while for the other values a term is added which is from depends on the individual value of the point under consideration and on fixed quantities a or b and A.
  • the size A corresponds to the individual values in unvoiced speech signal segments and in pause segments and leads to the fact that in these areas the course is practically always horizontal.
  • the sizes a and b influence the smoothness of the course, ie the larger a and b, the more the diagonal and the vertical direction are disadvantaged. It is therefore empirically obtained quantities that are generally between 0.5 and 2.0 for speech signals.
  • the indication value h+ (k, i) is also determined, which indicates from which previous point the current point was reached, ie which of the three terms, of which the minimum at the direction value D+ (k, i) is determined, this minimum has resulted.
  • a counter for the speech parameter value k is increased by 1 to k + 1.
  • Block 103 is therefore carried out in succession for all speech parameter values k of a specific point in time i.
  • D ⁇ (k, i) d (k, i) + min ⁇ D (k, i-1), D (k + 1, i-1) + a [d (k, i) + A,], D ⁇ (k + 1, i) + a [d (k, i) + A] (2) ⁇ (2)
  • the processes specified separately in blocks 104 and 105 can also be carried out together, ie after each determination of a direction value D ⁇ (k, i) for a speech parameter value k, it can be determined immediately afterwards whether this or the direction value D+ determined in the previous run (k, i) is smaller, and the smaller of the two is stored as the new sum value D (k, i).
  • the previous total value D (k, i-1) must be temporarily stored, since it is still required for the following directional value D ⁇ (k-1, i).
  • a larger number of steps must then be carried out for each speech parameter value k.
  • the processes according to block 106 are triggered.
  • the sum value D (m, I) is then first determined, which represents the minimum of all the sum values D (k, I) at the last point in time I. Thereafter, the overall reference value H (m, I) belonging to this minimum sum value D (m, I) is read out and from this the point m 1, preceding point k 1, i 1 is determined.
  • the reference value H (k 1, i 1) stored at this point is then read out and the point preceding this in turn is determined, etc., until the beginning of the course of the speech parameter determined in this way is reached.
  • the resulting sequence of points in the form of their coordinates, i.e. the time i and the speech parameter k represents the sequence sought.
  • FIG. 4 shows the block diagram of an arrangement which carries out the processing steps indicated in FIG. 3.
  • the block 10 preferably designates a memory which contains all individual values d (k, i) and which is addressed by the speech parameter values k and the values corresponding to the times i.
  • Block 10 must contain at least the individual values for all speech parameters k of a point in time i, since these are required twice, namely for both directional values D+ and D ⁇ .
  • Block 10 can also include the arrangement for generating the individual values, which, however, is not part of the invention and is therefore not detailed.
  • Block 20 represents a memory which contains the sum values D (k, i-1) of the respectively previous point in time i-1 at the beginning of a new point in time i and which contains the new sum values D (k, i) at the end of this new point in time .
  • the generation and writing of these total values will be explained later.
  • the memory 20 is addressed by the speech parameter values k and, via an input which receives a signal d, it is switched over to writing in the values supplied via the connection 35.
  • the data output 21 of the memory 20 is connected to the series connection of two registers 22 and 24, of which the register 22 takes the value from the output 21 and simultaneously transfers its previous content to the other register 24.
  • the register 22 thus contains the total value D (k, i-1) and the register 24 the previous total value D (k-1, i-1) or D (k + 1, i-1), depending on which direction values are currently being calculated.
  • a further register 26 is provided which records the direction value D+ (k-1, i) or D ⁇ (k + 1, i) present on the connection 13, which has just been determined, and during the determination of the respectively following direction value at the output 27 provides.
  • the outputs 11 of the memory 10 and 23, 25 and 27 of the registers 22, 24 and 26 lead to a processing arrangement 12 which carries out the calculations specified in blocks 103 and 104 in FIG. 3 and at output 13, as mentioned, the respective new direction value D+ (k, i) or D ⁇ (k, i) and at output 19 the associated reference value h ⁇ (k, i) or h+ (k, i).
  • a memory 30 which is also addressed by the speech parameter values k and which in a first pass at the beginning of each new point in time, in which, for example, the one direction values D+ (k, i) and the associated reference values h+ (k, i) are generated for all speech parameter values k, switched to write by a signal c at an additional input and thus records all direction values and reference values in this run.
  • the direction values D ⁇ (k, i) generated by the processing arrangement 12 on the connection 13 and the reference values h stii (k, i) generated on the connection 19 during this second pass are fed to a further memory 40, which is also addressed by the speech parameter values k is and is set to write by a signal d at another input.
  • comparator 14 If the direction value on connection 29 is smaller than the direction value on connection 39, comparator 14 generates on line 15 a signal which switches the two changeover switches 32 and 34 to the left position, so that the smaller of the two direction values over the changeover switch 34 and the line 35 are supplied to the memory 20 as a new total value and are written there, and at the same time the associated reference value output on the connection 31 is supplied as a total reference value via the switch 32 to a memory 50 and stored there.
  • the memory address for memory 50 becomes supplied via the changeover switch 36, which is initially held in the lower position by a signal e, so that the address is formed from the speech parameter value k and the value i for the respective point in time.
  • the comparator 14 If the direction value on the connection 39 is smaller than the direction value on the connection 29, the comparator 14 generates a signal at the output 15 which switches the two changeover switches 32 and 34 into the opposite position, so that the smaller direction value then again over the connection 35 is fed to the memory 20 and the associated overall reference value, which is output on the connection 41, is transferred to the memory 50 via the changeover switch 32.
  • the corresponding previously stored total values of the same speech parameter value k are overwritten by the minimum direction values, which represent the new total value D (k, i), so that the memory 20 only has to have a capacity of K words .
  • the comparator 38 again generates a signal on the output line 37 so that this smaller sum value is written into the register 48 and the corresponding values k and I into the register 42 be registered. This continues until the total value appearing at the output of the switch 34 is no longer less than the previous total value, so that the register 48 always contains the smallest total value and the register 42 contains the associated values k and i. This continues until the last total value at time I, so that memory 50 then contains all the total reference values H (k, i) and register 48 contains the smallest of all total values at time I and register 42 contains the corresponding values k and I. The end of the searched sequence is thus identified.
  • the switch 36 is switched by the signal e, so that the memory 50 is addressed by the output 45 of an address computer 44.
  • This receives from register 42 via connection 43 those contained therein Values m and I corresponding to the minimum total value, and the total reference value H (m, I) contained in this address in the memory 50 is read out and fed to the address computer 44 via the connection 51.
  • this modifies the values supplied via the connection 43, so that the values k 1 and i 1 of the previous point appear at the output 45. These are written into the register 42 and simultaneously address the memory 50, so that the associated reference value H (k 1, i 1) is read out and fed to the address computer 44 via the connection 51.
  • connection 13 is coupled directly to the connection 39 and the connection 19 is connected directly to the connection 41, as explained in FIG. 3, when the blocks 104 and 105 are combined.
  • the direction values for one direction for example the direction values D+ (k, i) and the associated reference values h+ (k, i) for all speech parameter values k are generated and stored in the memory 30
  • each is opened by the processing arrangement 12
  • Direction value D ⁇ (k, i) generated by connection 13 is fed directly to comparator 14, which then simultaneously receives the other direction value D+ (k, i) from memory 30 via connection 29, and the smaller of these two direction values is then immediately transmitted via the changeover switch 34 and the connection 35 to the memory 20 fed and registered in it.
  • the associated hint value is written into the memory 50 via the switch 32 as the total hint value H (k, i). In this case, only two runs of all speech parameter values k are required for each time i.
  • a control arrangement which generates the values k and i required for this and the control signals c, d and e is shown in the dashed block 16.
  • a clock generator 52 is present therein, which controls a counter 54, of which each possible position represents a different value of the speech parameter k.
  • the counting direction of the counter 54 is reversed, which now counts down again, so that the values k at its output run from K to 1. This is the second run, in which the other direction values and the new total values and the overall reference values are generated and saved.
  • the counter 58 finally all Has passed through positions and has reached the last point in time I, it then generates, for example at a carry output, the signal e which switches the changeover switch 36, as described above, so that the tracing back of the determined sequence can begin.
  • the clock control that may be required for the memories 20, 30 etc. and for the registers 22, 24 etc. and the processing arrangement 12, which is not shown in FIG. 4 for the sake of clarity, can also be derived from the clock generator 52.
  • FIG. 5 shows a possible embodiment of the processing arrangement 12 in FIG. 4.
  • the individual value d (k, i) supplied via the connection 11 is fed to one input of an adder 60, the other input of which receives the constant value A, which is predetermined, for example, by hard wiring.
  • the sum formed therein, which appears on the connection 61, is fed to a multiplier 62, where this sum is multiplied by the fixed value a. Since the exact value of the quantity a is not very critical, it can be formed from a small number of individual summands, each of which is a whole negative power of 2, so that the multiplier 62 can be constructed from a small number of cascaded adders.
  • connection 63 The product resulting on connection 63 is fed to an adder 64 where it is added to the value on connection 25 of register 24, and this is the sum value D (k-1, i-1) when the speech parameter values k increase with each other consequences.
  • the formed in the adder 64, on the connection 65 ge The delivered value is fed to the one input of a comparator 66, where it is compared with the value fed from the register 22 via the connection 23, ie with the total value D (k, i-1). Depending on the comparison result, the comparator 66 controls a changeover switch 68, which feeds the smaller value supplied to the comparator 66 via the connection 69 to the one input of a further comparator 76.
  • the other input of the comparator 76 is connected to the output connection 75 of a further adder 74, which adds the value supplied on the connection 27 by the register 26 to the sum multiplied by the quantity b in the multiplier 72 on the connection 61.
  • the comparator 76 again controls a changeover switch 78 in such a way that the smaller of the values supplied to the comparator 76 is forwarded and fed to the one input of a further adder 70 which receives the individual value d (k, i) supplied via the connection 11 at the other input.
  • the sum that arises at the output 13 of the adder 70 is the directional value D+ (k, i). In a corresponding manner, the direction values D) (k, i) for the opposite direction arise at the output 13 when the speech parameters k run from large to small values.
  • a changeover switch 82 In parallel to the changeover switch 68, the output signal of the comparator 66 actuates a changeover switch 82, which supplies either a logic value "0" or "1" to a line 83, the latter value meaning that the preceding point is at least obliquely below it, i.e. In the address computer 44 in FIG. 1, a unit must be subtracted for the addressing of the next value in the speech parameter k.
  • the line 83 forms the connection of another Switch 84, which is controlled by the output signal of the comparator 76 in parallel to the switch 78 and the other input of which has the logical value "1".
  • a further changeover switch 86 is controlled, which in the left position permanently supplies the logic value "1" to the output line 87 and the logic value "0" in the right position, the latter value indicating that the previous point is at the same time belongs, ie lies vertically below it, so that in this case the address computer 44 in FIG. 1 supplies the same address part i for addressing the memory 50 as for the previous address.
  • the two output lines 85 and 87 of the changeover switch 84 and 86 together form the connection 19, which leads to the memory 30 and 40 or the changeover switch 32 in FIG. 4.
  • This toggle switch can, for example, use a third bit, the value of which is toggled, to indicate whether the previous point lies above or below the point under consideration and whether a unit must be added to the current value k or a unit must be subtracted from it in the address computer 44.
  • FIGS. 4 and 5 The arrangement shown in FIGS. 4 and 5 is only to be considered as an example, in particular some or all of the parts can be implemented by an appropriately programmed microprocessor.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Signal Processing (AREA)
  • Health & Medical Sciences (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • Acoustics & Sound (AREA)
  • Multimedia (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Measurement Of Mechanical Vibrations Or Ultrasonic Waves (AREA)
  • Television Systems (AREA)
EP87202298A 1986-11-26 1987-11-24 Procédé et dispositif pour déterminer l'évolution temporelle d'un paramètre de la parole Expired - Lifetime EP0272723B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE3640355 1986-11-26
DE19863640355 DE3640355A1 (de) 1986-11-26 1986-11-26 Verfahren zur bestimmung des zeitlichen verlaufs eines sprachparameters und anordnung zur durchfuehrung des verfahrens

Publications (2)

Publication Number Publication Date
EP0272723A1 true EP0272723A1 (fr) 1988-06-29
EP0272723B1 EP0272723B1 (fr) 1992-10-21

Family

ID=6314791

Family Applications (1)

Application Number Title Priority Date Filing Date
EP87202298A Expired - Lifetime EP0272723B1 (fr) 1986-11-26 1987-11-24 Procédé et dispositif pour déterminer l'évolution temporelle d'un paramètre de la parole

Country Status (4)

Country Link
US (1) US4813075A (fr)
EP (1) EP0272723B1 (fr)
JP (1) JP2747292B2 (fr)
DE (2) DE3640355A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0549699A1 (fr) * 1990-09-20 1993-07-07 Digital Voice Systems, Inc. Procedes d'analyse et de synthese de la parole
WO1996010248A1 (fr) * 1994-09-29 1996-04-04 Apple Computer, Inc. Systeme et procede permettant de determiner l'intonation d'une syllabe d'un enonce en chinois mandarin

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
NL8701798A (nl) * 1987-07-30 1989-02-16 Philips Nv Werkwijze en inrichting voor het bepalen van het verloop van een spraakparameter, bijvoorbeeld de toonhoogte, in een spraaksignaal.
EP0703569B1 (fr) * 1994-09-20 2000-03-01 Philips Patentverwaltung GmbH Dispositif de détection de mots à partir d'un signal vocal
AU696092B2 (en) * 1995-01-12 1998-09-03 Digital Voice Systems, Inc. Estimation of excitation parameters
US5701390A (en) * 1995-02-22 1997-12-23 Digital Voice Systems, Inc. Synthesis of MBE-based coded speech using regenerated phase information
US5754974A (en) * 1995-02-22 1998-05-19 Digital Voice Systems, Inc Spectral magnitude representation for multi-band excitation speech coders
US6505152B1 (en) * 1999-09-03 2003-01-07 Microsoft Corporation Method and apparatus for using formant models in speech systems

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5885499A (ja) * 1981-11-18 1983-05-21 株式会社デンソー 連続音声認識装置
JPS58100195A (ja) * 1981-12-10 1983-06-14 日本電気株式会社 連続音声認識装置
JPH0731504B2 (ja) * 1985-05-28 1995-04-10 日本電気株式会社 ピツチ抽出装置
US4751737A (en) * 1985-11-06 1988-06-14 Motorola Inc. Template generation method in a speech recognition system
JPH0731504A (ja) * 1993-07-19 1995-02-03 Naito Seisakusho:Kk 盲人用杖

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, Band SMC-12, Nr. 3, Mai/Juni 1982, Seiten 383-388, IEEE, New York, US; H. NEY: "A time warping approach to fundamental period estimation" *
PROCEEDINGS OF THE 6th INTERNATIONAL CONFERENCE - PATTERN RECOGNITION, München, 19.-20. Oktober 1982, Seiten 1119-1124, IEEE, New York, US; H. NEY: "Dynamic programming as a technique for pattern recognition" *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0549699A1 (fr) * 1990-09-20 1993-07-07 Digital Voice Systems, Inc. Procedes d'analyse et de synthese de la parole
EP0549699A4 (fr) * 1990-09-20 1995-04-26 Digital Voice Systems Inc
US5581656A (en) * 1990-09-20 1996-12-03 Digital Voice Systems, Inc. Methods for generating the voiced portion of speech signals
WO1996010248A1 (fr) * 1994-09-29 1996-04-04 Apple Computer, Inc. Systeme et procede permettant de determiner l'intonation d'une syllabe d'un enonce en chinois mandarin
GB2308002A (en) * 1994-09-29 1997-06-11 Apple Computer A system and method for determining the tone of a syllable of mandarin chinese speech
GB2308002B (en) * 1994-09-29 1998-08-19 Apple Computer A system and method for determining the tone of a syllable of mandarin chinese speech

Also Published As

Publication number Publication date
EP0272723B1 (fr) 1992-10-21
US4813075A (en) 1989-03-14
JP2747292B2 (ja) 1998-05-06
DE3782324D1 (de) 1992-11-26
JPS63144400A (ja) 1988-06-16
DE3640355A1 (de) 1988-06-09

Similar Documents

Publication Publication Date Title
DE2758830A1 (de) Rechenvorrichtung
EP0285221B1 (fr) Procédé pour la reconnaissance de la parole continue
DE2045114A1 (de) Verfahren zur Herstellung von Datensätzen fur numerische Steuerungen
DE2853560A1 (de) Vorrichtung zur berechnung mehrerer interpolationsgroessen und eine solche vorrichtung verwendende tomographievorrichtung
DE2133638C3 (de) Verfahren zum Betrieb eines lernfähigen Systems aus in Kaskade geschalteten, zur nicht linearen Datenverarbeitung geeigneten lernfähigen Datenverarbeitungseinheiten
EP0272723B1 (fr) Procédé et dispositif pour déterminer l'évolution temporelle d'un paramètre de la parole
DE3507584C2 (fr)
DE2828919C2 (de) Schaltungsanordnung für ein polyphones elektronisches Musikinstrument
EP0285211B1 (fr) Procédé pour la reconnaissance de la parole continue
DE2064383B2 (de) Datenverarbeitungsanlage mit mehreren zentralen Verarbeitungseinrichtungen
DE2617485C3 (de) Schaltungsanordnung für Datenverarbeitungsanlagen zur Abarbeitung von Mikrobefehlsfolgen
DE3882062T2 (de) System zum Vergleichen von Mustern.
DE2920041C2 (de) Verfahren zum Verifizieren von Signalen, und Anordnung zum Durchführen des Verfahrens
DE2720666A1 (de) Verfahren und anordnung zur geraeuschanalyse
DE3215868C2 (fr)
DE2939077C2 (de) Verfahren und Anordnung zum Bestimmen charakteristischer Werte aus einem zeitbegrenzten Geräuschsignal
EP0677835B1 (fr) Procédé pour rechercher une suite de mots
DE3037276C2 (de) Tonsynthesizer
DE3887717T2 (de) Prozessor für programmierbaren logischen regler und programmierbarer logischer regler.
EP0417854B1 (fr) Procédé pour la reconnaissance de N suites différentes de mots dans un signal de parole
EP0757811B1 (fr) Procede de mise en logique floue de signaux d'entree se trouvant aux entrees d'un processeur a logique floue, a l'aide de fonctions d'appartenance d'entree
DE2419522A1 (de) Verfahren und anordnung zur unterteilung eines oder mehrerer nicht benutzter bereiche eines mit einem rechner verbundenen speichers
DE3417816A1 (de) Programmierbares schaltnetz
DE69029030T2 (de) Schallsynthesizer
DE2223257A1 (de) Sichtanzeigegeraet

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): DE FR GB IT SE

17P Request for examination filed

Effective date: 19881212

17Q First examination report despatched

Effective date: 19910208

RTI1 Title (correction)
GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): DE FR GB IT SE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Effective date: 19921021

REF Corresponds to:

Ref document number: 3782324

Country of ref document: DE

Date of ref document: 19921126

ITF It: translation for a ep patent filed

Owner name: ING. C. GREGORJ S.P.A.

GBT Gb: translation of ep patent filed (gb section 77(6)(a)/1977)

Effective date: 19930106

ET Fr: translation filed
PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
ITPR It: changes in ownership of a european patent

Owner name: CAMBIO RAGIONE SOCIALE;PHILIPS ELECTRONICS N.V.

REG Reference to a national code

Ref country code: FR

Ref legal event code: CD

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 19971103

Year of fee payment: 11

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 19971118

Year of fee payment: 11

REG Reference to a national code

Ref country code: FR

Ref legal event code: CD

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19981124

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 19981124

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 19990730

REG Reference to a national code

Ref country code: FR

Ref legal event code: ST

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20010118

Year of fee payment: 14

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20020702

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED.

Effective date: 20051124