Pattern matching method and apparatus

Abstract: In a method for matching an input pattern with a number of reference patterns a pruning threshold (Th), which is used to restrict the number of possible matchings (PACOUNT) which propagate further, is varied to try and ensure that the number of possible matchings propagated at each time point remains bounded within predefined limits, which are dictated by the amount of working memory and processing time available. The method decides whether to increase or decrease the pruning threshold (Th) by comparing the number of possible matchings (PACOUNT), which could be propagated from a current time point to a succeeding time point, with a matching threshold (STATETH).

Description: The present invention relates to a method of and apparatus for pattern matching. The invention has particular, although not exclusive relevance to the adjustment of a pruning threshold used in a dynamic programming pattern matching technique. In an exemplary embodiment, the dynamic programming matching technique is employed in a speech recognition system. Speech recognition is a process by which an unknown speech utterance is identified. There are several different types of speech recognition systems currently available which can be categorised in several ways. For example, some systems are speaker dependent, whereas others are speaker independent. Some systems operate for a large vocabulary of words (>10,000 words) while others only operate with a limited sized vocabulary (<1000 words). Some systems can only recognise isolated words whereas others can recognise phrases comprising a series of connected words. In a limited vocabulary system, speech recognition is performed by comparing features of an unknown utterance with features of known words which are stored in a database. The features of the known words are determined during a training session in which one or more samples of the known words are used to generate reference patterns therefor. To recognise the unknown utterance, the speech recognition apparatus extracts a pattern (or features) from the utterance and compares it against each reference pattern stored in a database. One way of comparing the pattern representative of the input utterance with the reference patterns is to use a dynamic programming matching technique, which provides an optimal time alignment between each of the reference patterns and the pattern extracted from the unknown utterance. This is achieved by locally shrinking or expanding the time axis of one pattern until there is an optimal match between the pairs of patterns. The reference pattern or sequence of reference patterns providing the best match identifies the word or words most likely to correspond to the input utterance. One problem with the dynamic programming matching technique is that it is computationally expensive, since it involves the determination of many possible matchings between the incoming utterance and each reference model. During the matching process, each possible matching is given a score which is dependent upon the closeness of the match. One method used to limit the amount of computations involved in the dynamic programming matching technique is to stop the processing of badly scoring matchings. In the art of speech recognition, this technique is known as pruning. However, a problem with using the pruning technique is that the number of possible matchings varies considerably and if there is only a fixed amount of memory available, then memory overflow may arise. EP 0525640 (Fujitsu Limited) solves this problem by varying the threshold to ensure that the number of possible matchings processed at each time point lies between a given minimum and maximum number. In particular, the pruning threshold is varied in dependence upon a predicted number of possible matchings that will have to be processed at the next time point. The predicted number is derived from a linear extrapolation of the number of possible matchings which were processed at a current time point and the number of possible matchings which were processed at a proceeding time point. The process employed in EP 0525640 ensures that the actual number of possible matchings at each time point lies between the given minimum and maximum number by counting the possible matchings for a given threshold and adjusting the threshold until the condition is satisfied. The present invention according to claims 1 to 38 addresses the same problem but aims to provide a simpler and less computationally expensive solution. According to one aspect, the present invention provides a pattern matching method for matching a sequence of input patterns representative of an input signal with a number of sequences of reference patterns, each sequence being representative of a reference signal, the method comprising the steps of: matching the input signal with each reference signal using a dynamic programming matching process which processes each pattern of said input signal in sequence and which propagates a plurality of dynamic programming paths using predetermined dynamic programming constraints, each path representing a possible matching between a sequence of reference patterns and a sequence of patterns of the input signal ending at the current pattern being processed, and each path having an associated cumulative value representative of the score for that possible matching; controlling said matching step by comparing said cumulative values with a pruning value thereby to restrict the number of dynamic programming paths being propagated; determining, at a current time point when a current input pattern is being processed by said matching step, the number (PACOUNT) of possible dynamic programming paths that will be propagating at the succeeding time point when the succeeding input pattern will be processed by said matching step, prior to restriction by said controlling step; and altering the pruning value to be used in said controlling step at said succeeding time point in dependence upon the number (PACOUNT) of possible dynamic programming paths determined by said determining step at the current time point; characterised in that said matching step comprises the steps of: using said dynamic programming constraints to propagate each dynamic programming path ending at the current input pattern being processed to the succeeding time point; and in the case where a plurality of dynamic programming paths meet at the succeeding time point, maintaining the dynamic programming path having the best cumulative value and discarding the rest; and in that said determining step comprises the step of counting the number of dynamic programming paths which have been propagated to the succeeding time point but which have not been discarded. The input signal may be representative of a speech signal, and each pattern may comprise a number of parameters representative of the acoustic properties of the input speech signal during a corresponding time frame. An upper and lower limit may be placed on the amount that the pruning value can be increased or decreased at each time point. In a preferred embodiment, if the number determined by the determining step is greater than a matching threshold, then the threshold is varied in dependence upon the number of cumulative values determined by the matching step for the current input pattern. Preferably the matching step propagates the possible matchings to the next time point at the current time point, and wherein the determining step determines the number of possible matchings that are propagated in the matching step. Various embodiments of the invention will now be described, by way of example only, with reference to the accompanying drawings in which: Figure 1 is a schematic view of a computer which may be programmed to operate an embodiment of the present invention; Figure 2 is a schematic overview of a speech recognition system; Figure 3 is a block diagram of the preprocessor incorporated as part of the system shown in Figure 2 which illustrates the processing steps that are performed on the input speech signal; Figure 4 is a diagrammatical representation of the division of the input speech signal S(t) into a series of time frames; Figure 5 is a diagrammatical representation of a typical speech signal for a single time frame; Figure 6 is a diagrammatical representation of the magnitude response of the discrete Fourier transform of the speech signal shown in Figure 5; Figure 7 is a diagrammatical representation of the averaged magnitude response output of a mel scale filter bank; Figure 8 is a diagrammatical representation of the log magnitude spectrum of the output from the mel scale filter bank; Figure 9 is a diagrammatical representation of the cepstrum of the logged magnitude spectrum shown in Figure 8; Figure 10 is a schematic diagram of the reference model builder used during a training process; Figure 11 is a flow chart which illustrates the steps taken during the training process for generating word models for use in the speech recognition system; Figure 12 is a schematic diagram which illustrates the manner in which the training phrases and words are stored during the training process; Figure 13 is a schematic representation of a number of input phrases and words, and their corresponding sequences of parameter frames; Figure 14 is a flow chart which illustrates the steps taken in determining the word models from the input utterances, input during the training session; Figure 15 is a schematic representation of training words and their corresponding sequences of parameter frames which have had their ends discarded; Figure 16 is a schematic representation of the alignment between parameter frames of the word shown in Figure 15 and parameter frames corresponding to the input phrases in which that word appears; Figure 17a is a schematic representation of a language model generated during the training process for a number of example input phrases; Figure 17b is a flow chart which illustrates the manner in which the system adds a new phrase to the language model; Figure 18 is a schematic representation of the processing performed when an input word is aligned with a word model using a dynamic processing technique; Figure 19 is a schematic representation of an allowed state transition sequence from one input frame to the next; Figure 20 is an alternate representation of the allowed state transition sequence shown in Figure 19; Figure 21 is a flow chart which illustrates the implementation of the dynamic programming alignment technique used in the first embodiment; Figure 22 is a schematic representation of a word model and a current active list and new active list associated therewith; Figure 23 is a schematic diagram which illustrates a number of example dynamic programming paths propagating within a reference model; Figure 24 is a flow chart which illustrates the steps involved in step S47 shown in Figure 21; Figure 25 is a schematic diagram which illustrates the manner in which two of the dynamic programming paths shown in Figure 23 can propagate from the current input frame to the next; Figure 26a is a schematic diagram illustrating the contents of the new active list shown in Figure 22 after the first state in the current active list for the word model shown in Figure 22 has been processed; Figure 26b is a schematic diagram illustrating the contents of the new active list shown in Figure 22 after the second state in the current active list for the word model shown in Figure 22 has been processed; Figure 27a is a flow chart which illustrates part of the processing performed in step S77 shown in Figure 24; Figure 27b is a flow chart which illustrates the remaining steps involved in step S77 of Figure 24; Figure 28 is a flow chart which illustrates the processing performed in step S51 shown in Figure 21; Figure 29 is a schematic representation of the processing performed to an exemplary node N during the processing illustrated in Figure 28; Figure 30 is a flow chart which illustrates the steps involved in step S57 shown in Figure 21; Figure 31 is a schematic diagram illustrating the entry states of the word model shown in Figure 22; Figure 32 is a flow chart which illustrates the steps performed in step S65 shown in Figure 21; Figure 33 is a schematic representation of the sequence of parameter frames for an input phrase together with the sequences of parameter frames for the words contained within the input phrase when spoken in isolation; Figure 34 is a flow chart which illustrates the steps involved in adapting the word models to a different user using a first substitution technique; Figure 35 is a flow chart which illustrates the steps involved in adapting the word models to a different user using a second substitution technique. Embodiments of the present invention can be implemented in computer hardware, but the embodiment to be described is implemented in software which is run in conjunction with processing hardware such as a personal computer, workstation, photocopier, facsimile machine or the like. Figure 1 shows a personal computer (PC) 1 which may be programmed to operate an embodiment of the present invention. A keyboard 3, a pointing device 5, a microphone 7 and a telephone line 9 are connected to the PC 1 via an interface 11. The keyboard 3 and pointing device 5 enable the system to be controlled by a user. The microphone 7 converts the acoustic speech signal of the user into an equivalent electrical signal and supplies this to the PC 1 for processing. In this embodiment, the beginning and end points of the input speech to be processed, are identified by the user holding the spacebar on the keyboard 3 down for the duration of the input utterance. In this manner, the system only processes the input utterance to be identified. An internal modem and speech receiving circuit (not shown) may be connected to the telephone line 9 so that the PC 1 can communicate with, for example, a remote computer or with a remote user. The programme instructions which make the PC 1 operate in accordance with the present invention may be supplied for use with an existing PC 1 on a storage device such as a magnetic disc 13, or by the internal modem communicating with a remote computer via the telephone line 9. The operation of the limited vocabulary continuous speech recognition system of this embodiment will now be described with reference to Figure 2. Electrical signals representative of the input speech from, for example, the microphone 7 are applied to a preprocessor 15 which converts the input speech signal into a sequence of parameter frames, each representing a corresponding time frame of the input speech signal. The sequence of parameter frames are supplied to a recognition block where the speech is recognised by comparing the input sequence of parameter frames with reference models or word models 19, each model comprising a sequence of parameter frames expressed in the same kind of parameters as those of the input speech to be recognised. A language model 21 and a noise model 23 are also provided as inputs to the recognition block 17 to aid in the recognition process. The noise model is representative of silence or background noise and, in this embodiment, comprises a single parameter frame of the same type as those of the input speech signal to be recognised. The language model 21 is used to constrain the allowed sequence of words output from the recognition block 17 so as to conform with sequences of words known to the system. The word sequence output from the recognition block 17 may then be transcribed for use in, for example, a word processing package or can be used as operator commands to initiate, stop or modify the action of the PC 1. A more detailed explanation will now be given of the apparatus described above. Preprocessor The preprocessor will now be described with the aid of Figures 3 to 10. The functions of the preprocessor 15 are to extract the information required from the speech and to reduce the amount of data that has to be processed. There are many known methods of preprocessing speech in the field of speech analysis and the following method is given by way of example only and should not be construed as limiting in any way. In this embodiment the preprocessor 15 is designed to extract "formant" related information. Formants are defined as being the resonant frequencies of the vocal tract of the user, which change as the shape of the vocal tract changes. Figure 3 shows a block diagram of the preprocessing that is performed on the input speech signal. Input speech S(t) from the microphone 7 or the telephone line 9 is supplied to filter block 61, which removes frequencies within the input speech signal that contain little meaningful information. In speech signals, most of the meaningful information is contained below 4KHz. Therefore, filter block 61 removes all frequencies above 4KHz. The filtered speech signal is then converted into digital samples by the analogue-to-digital converter (ADC) 63. To adhere to the Nyquist sampling criterion, ADC 63 samples the filtered signal at a rate of 8000 times per second. In this embodiment, the whole input speech utterance is converted into digital samples and stored in a buffer (not shown), prior to the subsequent steps in the processing of the speech signals. After the input speech has been sampled it is divided into overlapping equal length frames in block 65. The reason for this division of the input speech into frames will now be described in more detail. As mentioned above, during continuous speech the formant related information changes continuously, the rate of change being directly related to the rate of movement of the speech articulators which is limited by physiological constraints. Therefore, in order to track the changing formant frequencies, the speech signal must be analysed over short time periods or frames, this method being known in the art of speech analysis as a "short time" analysis of speech. There are two considerations that have to be addressed when performing a short time analysis: (i) what rate should the time frames be extracted from the speech signal, and (ii) how large a time frame should be used. The first consideration depends on the rate of movement of the speech articulators i.e. the frames should be sufficiently close to ensure that important events are not missed and to ensure that there is reasonable continuity. In this embodiment, a frame is extracted once every 10 milliseconds. The second consideration is determined by a compromise between the time frame being short enough so that the speech signal's properties during the frame are constant, and the frame being long enough to give sufficient frequency detail so that the formants can be distinguished. In the present embodiment, the frames are 20 milliseconds in length which, with the above sampling rate, corresponds to 160 samples per frame. If these frames are generated by extracting the frames directly from the speech samples, considerable frequency distortion results. Therefore, to reduce such distortions, a smoothed window function should be used. There are many such windows available including Hamming, Hanning, Blackman, Bartlett and Kaiser all of which will be known to those skilled in the art of speech analysis. In the present embodiment, a Hamming window is used, this being represented by the following equation: W ( n ) = 0.54 - 0.46 cos [2π n /( N s -1)] where N s is the number of samples in the window, i.e. 160 samples. Figure 4 shows in more detail the short time analysis operation that is carried out in the present embodiment. The speech signal in frame 1, i.e. between time instant "a" and time instant "b", is multiplied by the window function given in equation (1). Further, due to the choice of the frame rate and the frame length, the next frame, frame 2, starts midway between frame 1 at time instant "c" etc. Once a frame of input speech signal has been extracted, the magnitude of the discrete Fourier transform (DFT) of the frame is calculated in block 67, i.e. |S k (f)| where f is the discrete frequency variable. Only the magnitude information is required, since many aspects of this preprocessor are designed to simulate the operation of the human auditory system, which is relatively insensitive to the phase of the input speech signal. Figure 5 shows a typical speech signal for a single frame S k (r) comprising 160 samples, i.e. r=0,1,...159. To enable an efficient Fast Fourier Transform (FFT) algorithm to be used in the calculation of the DFT, the number of samples within the frame S k (r) needs to be increased to a power of 2. One method of achieving this is by adding 96 zero's at the end of the 160 samples to give 256 samples. This technique is known as "padding with zeros" and is well known in the art of speech analysis, and will not be described further. In computing the DFT of S k (r), only the first 128 samples of the spectrum need to be computed, since speech is a real signal and so the second 128 samples will be a mirror image of the first 128 samples. Figure 6 shows the first 128 samples of the magnitude of the DFT |S k (f)| of the speech signal in frame S k (r) shown in Figure 5, the last sample of which occurs at a frequency of half the sampling frequency, i.e. 4KHz. As mentioned earlier, the purpose of preprocessor 15 is to reduce the data rate and to emphasise particular components of the input speech signal. The data rate has been reduced slightly by the DFT, since there are now only 128 samples per frame. One method of reducing the data rate further is to split the spectrum into a number of equal frequency bands and to average the samples within each band, i.e. pass the samples shown in Figure 6 through a filter bank. Studies on the human auditory system have shown that the ear frequency resolution decreases with increasing frequency. Therefore, a logarithmically spaced filter bank, i.e. one in which there are more frequency bands in the low frequency region compared to the high frequency region, is preferable to a linearly spaced filter bank since a logarithmically spaced filter bank retains more perceptually meaningful information. In the present embodiment, a mel spaced filter bank 69 having nineteen bands is used. The mel scale is well known in the art of speech analysis, and is a logarithmic scale that attempts to map the perceived frequency of a tone onto a linear scale. Figure 7 shows the output | (f')| of the mel spaced filter bank 69, when the samples shown in Figure 6 are passed through the bank 69. The resulting envelope 100 of the magnitude spectrum is considerably smoother due to the averaging effect of the filter bank 69, although less smooth at the lower frequencies due to the logarithmic spacing of the filter bank. The formant related information is then extracted from the speech using blocks 71, 73 and 75 of Figure 3, by a process which will now be explained. It is possible to model the speech signal S(t) of a user in terms of an excitation signal E(t) and a filter V(t), where the excitation signal E(t) represents the airflow entering the vocal tract, and the filter V(t) represents the filtration effect of the vocal tract. Consequently, the magnitude of the frequency spectrum |S(f)| of the speech signal is given by the multiplication of the magnitude of the frequency spectrum |E(f)| of the excitation signal with the magnitude of the spectrum |V(f)| of the vocal tract filter, i.e. | S ( f )|=| E ( f )|·| V ( f )| One method, known as the cepstral method, of extracting the vocal tract information from the input speech will now be described. This method involves separating the vocal tract filter magnitude response |V(f)| from the excitation magnitude response |E(f)| by taking the logarithm of the speech magnitude response |S(f)|, which results in the excitation and vocal tract filter characteristics becoming additive, i.e. log| S ( f )| = log| E ( f )| + log| V ( f )| Figure 8 shows the envelope of the logged output from the mel filter bank 69, i.e. log | k (f')|, which shows graphically the additive nature of two components 101 and 103. Component 101 is representative of the vocal tract characteristics, i.e. log |V(f)|, and component 103 is representative of the excitation characteristics, i.e. log |E(f)|. The peaks in component 101 occur at the formant frequencies of the vocal tract and the equally spaced peaks in component 103 occur at the harmonic frequencies of the pitch of the speaker. The vocal tract characteristics 101 can be extracted from the excitation characteristics 103, by performing a Discrete Cosine Transform (DCT) on the samples output from block 71, and then filtering the result. Figure 9 shows the output of the DCT block 73, which is known as the cepstrum C k (m). The independent variable (x-axis of Figure 9) of the cepstrum has dimensions of time and is given the name "quefrency". The strongly periodic component 103 shown in Figure 8 becomes a peak 105 in the cepstrum at a location equivalent to the pitch period T of the speaker. The slowly varying component 101 shown in Figure 8, is transformed onto a number of small peaks 107 near the origin of the cepstrum, the position and amplitude of which are dependent on the formants. As the vocal tract characteristics and the excitation characteristics of speech appear in separate parts of the quefrency scale, they can be separated from one another by a filtering process, or, in cepstral terminology by a so called "liftering" process. The cepstrum C k (m) shown in Figure 9 is made up of a set of discrete cepstral coefficients (C 0 , C 1 , ... C 18 ), and therefore the liftering could be achieved by means of a simple rectangular window. However, in order to de-emphasise parts of the spectrum that are considered to be less reliable, a more gradual windowing function is preferred. In the present embodiment, the following window function is used in liftering block 75: W lift ( m ) = 1 + N c 2 sin π m N c where N c is the desired number of cepstral coefficients output per frame from the liftering block 75, which in the present embodiment is twelve. In addition to the twelve cepstral coefficients mentioned above, the power of the speech signal within each frame, i.e. the "frame power" is also calculated. This is an important feature since it can be used, among other things, to indicate whether or not the input speech signal during the frame corresponds to a voiced speech signal. The frame power is calculated in frame power block 81 shown in Figure 3 using a conventional method well known in the art of speech analysis. To achieve independence of variable recording conditions, variable loudness etc, the power determined in block 81 is normalised in power normalising block 83 to give a power coefficient p k which is combined with the cepstral coefficients output from the liftering block 75. The power is normalised in block 83 by determining the maximum power (dB) across the utterance stored in the buffer (not shown), subtracting this from the power of each frame and multiplying the result by a normalisation constant. Whereas in the present embodiment, the power of the input speech signal during each frame is determined, other values indicative of the input speech signal during each frame could be used. For example, a measure of the average magnitude of the input speech signal during a frame could be determined and normalised. In summary, the preprocessor 15 outputs, for each time frame, a set of coefficients - twelve cepstral coefficients and one power coefficient. For convenience, the coefficients that represent frame k will be referred to as parameter frame f k , and the coefficients that represent the subsequent frame will be referred to as parameter frame f k+1 etc. Buffer The parameter frames f k output from preprocessor 15 are applied to the buffer 16 shown in Figure 2. In the present embodiment, the buffer 16 is large enough to store all the parameter frames generated for the speech stored in the buffer (not shown) which stores the digital samples output from ADC 63 for the input speech. After the entire input utterance has been processed by the preprocessor 15, the parameter frames stored in buffer 16 are fed to the recognition block 17 in the order that they are received, where the input utterance is recognised. Reference Models As mentioned above, in order to determine which words are represented by the output signals from the preprocessor 15, these signals are compared with stored reference models which model the words already known to the system and the acoustic environment surrounding the system. Each model associated with a particular word comprises a sequence of parameter frames of the same type of parameter frames output from the preprocessor 15 described above. However, to differentiate between the frames in the word models and the frames in the input utterance to be recognised, the frames in the word models will be referred to as states. One feature of the speech recognition system according to this embodiment is that it can be supplied to the end user with no word models, environment (or noise) model or language model pre-stored therein. This allows the user the freedom to train the system to recognise the phrases he wants, without the system being overburdened with pre-stored words which may not be useful for the user's purpose. Further, as will be seen from the following description, the particular training method described is particularly adapted to this situation because it allows for new phrases to be learnt by the system without the need for a time consuming training session. In addition, since the reference models correspond to whole words and not phonemes, the system will work for any language or even any mixture of languages. The training process will now be described in more detail with reference to Figures 10 to 17. Training Figure 10 is a schematic diagram which illustrates the build/update module 91 which is used in the training process. In particular, the build/update module 91 receives sequences of parameter frames f k representative of a word or words to be learnt by the system, and user information, represented by arrow 92, indicative of the text corresponding to the input spoken word or words. If sufficient information has been input into the build/update module 91 then it generates word models corresponding to the input words and updates the language model 21. In this embodiment, both the word models and the language model are stored in a high volume data storage unit, such as a hard disc 93. The manner in which the noise model 23 is determined in this embodiment will now be described. Firstly, the user indicates that he wishes to build a new or change the existing noise model 23. In response, the system prompts the user to input sound representative of silence. This is achieved by the user holding down the spacebar on the keyboard 3 while remaining silent. At the end of the period of silence, the user must then utter a word so that the system can normalise the power coefficient of the generated parameter frames representative of the silence. If the user does not utter a word at the end of the period of silence then the power coefficient for the noise model 23 will be unrealistically high, and misrecognition errors may result. Finally, in order to determine the noise model 23, the system averages the parameter frames generated for the period of silence to produce a single parameter frame which is used as the noise model 23. The speech recognition system of this embodiment is designed to recognise continuously spoken words, i.e. words embedded within phrases. In order to achieve good recognition results, the reference models (or continuous word models) should be derived from example phrases which contain the words of interest. Unfortunately, it is not an easy task to identify the beginning and end points of a word within a continuously spoken phrase. An overview of the way in which the present embodiment generates a continuous word model will now be given. Firstly, the system determines a model for the word from an isolated utterance of that word. This model will be referred to as the "isolated word model" although, as those skilled in the art of speech recognition will realise from the following description, these isolated word models may not correspond to conventional isolated word models well known in the art. The system then uses the isolated word models to generate the continuous word models by comparing the isolated word models with example phrases containing the corresponding words. To generate the isolated word model, the word must be input into the system via the microphone 7 or the telephone line in isolation. As described above, the space bar is used to identify each incoming utterance. Therefore, the sequence of parameter frames representative of the isolated utterance of the word will comprise parameter frames at the beginning and end thereof which correspond to silence. The system then compares the utterance of the isolated word with example phrases which contain that word. This comparison identifies approximate beginning and end points of the word within the isolated utterance. These beginning and end points are then averaged and the isolated word model for the word is determined by extracting the sequence of parameter frames which lies between the averaged beginning and end points. By determining the isolated word model in this way, not only should the silence at the beginning and end of the word be removed, but parts of the word which are not pronounced during continuous speech will also be removed. Therefore, the isolated word model may not correspond to a conventional isolated word model, which is determined by removing the silence from the beginning and ends of the input utterance, and will be more representative of the word when spoken in continuous speech. Once the isolated word model has been determined, it is aligned with the example phrases which contain that word in order to identify the location of the word within the phrase. Finally, the reference or continuous word model is determined by extracting and combining the speech from the locations identified in the phrases. The way in which the system generates the word models will now be described in more detai. When the user wishes to teach the system one or more new phrases, the user initiates the subroutine shown in Figure 11. In step S1 the user enters the text of the new word or phrase into the system via the keyboard 3. The system then checks whether that word or phrase is already known, and if it is not then in step S3, it prompts the user to enter the same word or phrase via the microphone 7, and associates the utterance with the corresponding text input in step S1. Next in step S5 the PC 1 uses all the text which has been previously entered, to check whether any of the words within the phrase have been input (in isolation) already, and prompts the user to input, in isolation via the microphone 7, those words that have not been entered before. After step S5, the user decides whether to enter another new word or phrase in step S7, and returns to step S1 if he does. On the other hand, if the user decides not to input any more phrases, then the processing moves to step S9 where reference models are generated for unknown words which are included in at least two phrases input into the system. For example, if no training phrases have been input, and the system has no pre-stored reference models, and the user decides to input the phrases "get an image" and "get the earth", and then decides in step S7 that he does not wish to enter any more phrases, then the system will only be able to generate a word model for the word "get", since it is the only word that is in both of the input phrases. If on the other hand the user inputs the phrase "get an image" twice, then the system will be able to generate a reference model for each word in the phrase. Taking the first example mentioned above further, if the user decides to input the phrase "get the earth" in a second training session after inputting the first two phrases, then the system will not prompt the user for the words "get" or "the" in step S5 since these words will have been input in isolation already. Further, the system will now be able to generate a reference model for the word "the" since it now appears in two phrases which have been input into the system. In this way, the training is incremental and can be trained at the convenience of the user. Referring to Figure 12, each phrase input in the above manner is given a phrase number P and is stored in a phrase array 115 on the hard disc 93. Similarly, each isolated word that is input is given a word number W and is stored in a word array 117 on the hard disc 93. As shown in Figure 12, each phrase P in the phrase array 115 has an associated sequence of parameter frames 123, the sequence of words 125 that form the phrase and a status flag 127. Each word in the sequence of words 125 has an associated text 129 of the word, the phrase number P, the word number 131 (i.e. the position of the word within the phrase), the time boundaries 133 of the word within the phrase and a word index 135 which points to the corresponding isolated word W in the word array 117. Each isolated word W in the word array 117 has an associated sequence of parameter frames 137, a phrase index 139 which points back to those phrases in which that word can be found and a status flag 141. Initially, when the isolated words and phrases are being entered into the system, the status flags 127 and 141 associated with each word or phrase are labelled FLEXI to indicate that they have not been processed, and the time boundaries 133, associated with each word within the sequence of words in the phrase, are set to UNKNOWN. The generation of the word models for the unknown words performed in step S9 of Figure 11 will now be briefly described with reference to Figures 12 to 16, using as an example the training phrases "get an image" which has been input twice, and "get the earth" which has been input once. Therefore, there will be three elements P1, P2 and P3 in the phrase array 115, one for each utterance of the phrase "get an image" and one for the utterance of the phrase "get the earth". Additionally, there will be five elements W1, W2, W3, W4 and W5 in the words array 117, one for each of the different words that make up the two phrases. As described above, a sequence of parameter frames corresponding to each phrase and corresponding to each of the different words will be stored in the corresponding elements in the phrase array 115 and word array 117. Figure 13 shows speech signals 151 and 153 which represent the two utterances of the phrase "get an image" and speech signal 155 which represents the utterance of the phrase "get the earth". Figure 13 also shows the speech signals 157, 159 and 161 which represent the isolated utterances of the words "get", "an" and "image" respectively. Figure 13 also shows the two sequences of parameter frames 152 and 154 which correspond to the two utterances of the phrase "get an image", the sequence of parameter frames 156 corresponding to the utterance of the phrase "get the earth" and the sequences of parameter frames 158, 160 and 162 corresponding to the utterances of the isolated words "get", "an" and "image" respectively. Representations of the words "the" and "earth" are not shown in Figure 13, since word models for these words cannot be generated as they do not appear in two or more phrases. Figure 14 shows in more detail the steps required to generate a word model for each of the unknown words. In particular, in step S21 the sequences of parameter frames corresponding to the input phrases that contain the unknown words are aligned with the sequences of parameter frames corresponding to the unknown words when spoken in isolation, using a flexible dynamic programming alignment process which accommodates the initial lack of knowledge of the start and end points of the unknown words. In particular, a dynamic programming alignment process is used that does not constrain where the optimum alignment path of each word must begin or end. This flexible dynamic programming alignment process will be described in more detail later after dynamic programming alignment has been discussed. The result of the flexible dynamic programming alignment is the identification of an approximate start and end point of each unknown word within the sequence of parameter frames for that unknown word. For example, when the sequence of parameter frames 152 corresponding to the first utterance of the phrase "get an image" is aligned with the sequence of parameter frames 158 corresponding to the utterance of the unknown word "get", a start and end point of that word within the sequence of parameter frames 158 are identified from the alignment results. As mentioned above, the parameter frames before the start point and after the end point correspond to background noise, or parts of the word which are not pronounced in the example phrases, and can therefore be removed. The alignment performed in step S21 for the example training phrases will identify three sets of start and end points for the word "get" (since the word "get" appears in three phrases) and two sets of start and end points for the words "an" and "image" (since the words "an" and "image" appear in two phrases). In step S23 an average start and end point for each unknown word are determined and the frames before the average start frame and after the average end frame are discarded. For example, if after step S21 for the word "get" the start points identified using the three phrases 151, 153 and 155 are frame f 8 W1 , frame f 9 W1 and frame f 13 W1 , then the average is frame f 10 W1 ([8+9+13]/3) and all frames in the sequence of parameter frames 158 before frame f 10 W1 are discarded. A similar procedure is used for the end points, except that it is the frames beyond the end frame which are discarded. The resulting sequence of parameter frames for each word is the isolated word model mentioned above for that word. Figure 15 shows the speech signals 157', 159' and 161' and the corresponding sequences of parameter frames of the isolated word models 158', 160' and 162' for the words "get", "an" and "image" respectively. At this stage in the processing, the status flag 141, shown in Figure 12, for each word processed is changed from FLEXI to CHOPPED to signify that the unknown words have had the frames from the beginning and ends removed. Next in step S25 shown in Figure 14, the sequences of parameter frames corresponding to the input phrases are aligned with the sequences of parameter frames of the isolated word models for the words in those phrases. For example, the sequences of parameter frames 152, 154 and 156 corresponding to the utterances of phrases in which the word "get" appears are aligned with the sequence of parameter frames of the isolated word model 158' for the word "get". Figure 16 shows the resulting alignment achieved between the sequences 152,154 and 156 and the sequence 158', where the dashed lines represent the alignment between the frames. As shown, it is established that frames f 2 P1 and f 3 P1 are aligned with frame f 10 W1 , and frames f 4 P1 and f 5 P1 are aligned with frame f 11 W1 etc. Next in step S27 shown in Figure 14, a reference model for the unknown word is generated by replacing the individual frames of the isolated word model with the average of the aligned frames from the sequences of parameter frames corresponding to the phrases. For example, for the sequence of parameter frames of the isolated word model 158' shown in Figure 16, frame f 10 W1 is replaced by the average of frames f 2 P1 , f 3 P1 , f 1 P2 and f 2 P3 , whilst frame f 11 W1 is replaced by the average of frames f 4 P1 , f 5 P1 , f 2 P2 , f 3 P2 and f 3 P3 etc. In the event that there are no frames of a phrase aligned with one of the frames of the isolated word model, then that particular frame is replaced by a frame derived by interpolating between or extrapolating from neighbouring replaced frames. Therefore, for the sequence of parameter frames 158' shown in Figure 16, frame f 12 W1 is not aligned with any of the frames in the sequences of parameter frames 152, 154 or 156, and is replaced by a frame derived by interpolating between the substituted frames for f 11 W1 and f 13 W1 . Alternatively, the frames of the isolated word model which are not aligned with any frames of the phrase can be discarded. The reference word models generated in step S27 are ready for use in the speech recognition part of the system, which will be described further below. Therefore, the status flag 141 of each word that has been processed is changed from CHOPPED to IN-USE. Once a reference word model has been created for all the words in a phrase, then that phrase can be added to the language model 21 shown in Figure 2. In this embodiment, the language model 21 is similar to a Bigram model, and comprises a mesh of interconnected nodes, where the interconnections represent the words known to the system. It does not, however, contain any grammatical rules concerning, for example, correct English language usage. It only constrains which words can follow others based on the phrases known to it. Figure 17a illustrates the language model 21 derived when the following phrases have been learnt by the system: get an image - phrase 1 get the earth - phrase 2 get the fjord - phrase 3 get the map - phrase 4 get the coin - phrase 5 save an image - phrase 6 load an image - phrase 7 make it smaller - phrase 8 make it larger - phrase 9 make it brighter - phrase 10 make it more red - phrase 11 make it more yellow - phrase 12 make it more green - phrase 13 make it more cyan - phrase 14 make it more blue - phrase 15 make it more magenta - phrase 16 quit - phrase 17 As shown in Figure 17a there is a start node N 0 , an end node N n and eight intermediate nodes N 1 to N 8 . For an input phrase to be recognised the system must find a path from the start node N 0 to the end node N n . The system is, however, reasonably flexible in that once trained and the user inputs the phrase "make smaller" instead of "make it smaller" the system will still recognise the input phrase. The system will not, however, recognise a phrase that is input if that phrase is not known to the system even if the individual words in the phrase are known, i.e. for the language model given above, if the user says "save the image" the system will not recognise this input even though it knows the words "save", "the" and "image". The language model 21 is created by extracting the necessary word sequence constraints from the text input in step S3 in Figure 11 and is updated after each new phrase has been input provided there is a word model for each of the words in the phrase. The way in which the language model 21 is updated will now be described with reference to Figure 17b. When a new input phrase has been input and a word model for each word in the phrase has been determined, the system identifies in step S30, whether the first word in the phrase is already connected to the output of the start node N 0 . If it is, then the processing proceeds to step S32. If on the other hand, the first word is not already connected to the output of the start node N 0 , then a new output from the start node N 0 is added, in step S31, for the first word. The processing then proceeds to step S32 where the system initialises a word loop counter w, which is used to count through all the words in the phrase. The processing then proceeds to step S33 where the system determines whether or not word w is the last word in the phrase. If it is not, then the processing proceeds to step S34 where the system determines whether or not word w is connected to the input of a node (except the end node N n ). If it is, then the processing proceeds to step S36 where the system checks to see if the next word w+1 is connected to the output of the node that has word w as an input. If on the other hand, at step S34, the system determines that word w is not connected to the input of any node, then the processing proceeds to step S35 where a new node is created and word w is connected to the input of that new node. The processing then proceeds to step S36 described above. If the system determines, in step S36, that the next word w+1 is not connected to the output of the node that has word w as an input, then the processing proceeds to step S37 where the next word w+1 is added as an output of that node. If on the other hand the system determines, in step S36, that the next word w+1 is already connected to the output of the node that has word w as an input, then nothing happens and the processing proceeds to step S38 where the word counter w is incremented. The processing then returns to step S33 and a similar procedure is carried out for the next word in the phrase. If the system determines at step S33 that word w is the last word in the phrase, then the processing proceeds to step S39 where the system determines whether or not the last word is already connected to the input of the end node N n . If it is not connected to the input of the end node N n then the processing proceeds to step S40 where the system connects the last word in the phrase to the input of the end node N n . If the last word is already connected to the last node N n , or once the last word has been connected to the last node N n in step S40, then the processing is complete and the phrase now forms part of the language model 21. One feature of the training process is that the system can be taught the phrases individually or it can be taught a number of phrases at once. Further, if a new phrase is input and the system already has word models for some of the words in that phrase, then it only needs to generate word models for the unknown words before it can update the language model 21. Dynamic Programming (DP) In the processing performed in steps S21 and S25 of Figure 14, an alignment procedure was used to align the parameter frames of the phrases with the parameter frames of the words. In order to align the two sequences of parameter frames in an effective manner, the alignment process must be able to compensate for the different rates at which the word is spoken, for example when the word is spoken in isolation and when the word is embedded within the continuously spoken phrase. The dynamic programming (DP) alignment process mentioned above is one way which can match one word onto another in a way which applies the optimum non-linear time-scale distortion to achieve the best match at all points. An overview of the DP matching process will now be given with reference to Figures 18-20. Figure 18 shows along the abscissa a sequence of parameter frames representative of an input word, and along the ordinate a sequence of parameter frames representative of a word model. Comparing this example with the processing performed in step S25 in Figure 14, the sequence of parameter frames representative of the input word may represent part of the sequence of parameter frames corresponding to one of the input phrases, and the sequence of parameter frames representative of the word model may represent the sequence of frames representing one of the chopped words. To find the total difference between the word model and the input word, it is necessary to find the sum of all distances between the individual pairs of frames along whichever path between the bottom left and top right corners in Figure 18 that gives the smallest cumulative distance. This definition will ensure that corresponding frames of similar words are correctly aligned. One way of calculating this total distance is to consider all possible paths and add the value of d(k,j) (the distance between frame k and frame j) for each point along each one. The distance measured between the two words is then taken to be the lowest value obtained for the cumulative distance. Although this method gives the correct answer, the number of valid paths becomes so large that the computation is impossible for any practical speech recognition system. Dynamic programming is a mathematical technique which finds the cumulative distance along the optimum path without having to calculate the distance along all possible paths. The number of paths along which the cumulative distance is determined can be reduced further by placing certain constraints on the DP process. For example, it can be assumed that the optimum path will always go forward with a non-negative slope, otherwise one of the words will be a time reversed version of the other. Another constraint that can be placed on the DP process is to limit the maximum amount of time compression/expansion of the input word relative to the reference word. In this embodiment, this constraint is realised by limiting the number of frames that can be skipped or repeated in the matching process. For example, in Figure 19 the frame sequence is constrained such that if frame f k is matched to frame f j m then frame f k+1 can be matched with frame f j m , f j+1 m , f j+2 m or f j+3 m . Therefore, if parameter frame f k of the input word and parameter frame f j m of the word model lie on the optimum path then the above constraint necessitates that the immediately preceding point on the optimum path must be either (k-1,j), (k-1,j-1), (k-1,j-2) or (k-1,j-3), as illustrated in Figure 20. Figure 18 shows the "valid paths" which are propagated up to frame f k-1 which represent possible matchings between the input word and the word model. When frame f k is applied to the recognition unit 17 each valid path has the local distance between current frame f k and the frame of the word model that is at the end of that valid path added to its cumulative distance. If a number of valid paths meet at the same point then the valid path with the lowest cumulative distance is continued and the others are discarded. For example, in Figure 18 path SA, B and C meet at point (k,j) and the path (A, B or C) with the lowest cumulative distance is continued whereas the other two are discarded. Therefore, if D(k,j) is the cumulative distance along a valid path from the beginning of the word to the point (k,j), i.e.: Then, with the above constraints it follows that: D ( k,j ) = d ( k,j ) + min[ D ( k- 1, j ), D ( k- 1, j- 1), D ( k- 1, j- 2), D ( k- 1, j- 3)] With the above constraints, the value of D(0,0) must equal d(0,0), d(1,0), d(2,0) or d(3,0), as all possible paths must begin at one of these points. Therefore, starting from one of the starting points, the value of D(k,j) can be determined via a recursive processing routine. When the routine reaches the end of the words to be matched, the minimum cumulative distance calculated by the DP process represents the score for the best way of matching the two words. If the input utterance to be recognised comprises a sequence of words then backpointers must be used to indicate the direction that has been taken, so that after the DP process identifies the end of the optimum path, it is possible to recognise the input utterance by tracing back through the backpointers. Although the DP process described above provides a large computational saving compared with the exhaustive search of all possible paths, the remaining computation can be substantial, particularly if each incoming word has to be compared with a large number of word models for matching. Any possible saving in computation which does not significantly affect the accuracy of the recognition result is therefore desirable. One possible computational saving is to prevent paths that are scoring badly from propagating further. This is sometimes known as pruning because the growing paths are like branches of a tree. By pruning the paths in this way, only a narrow band of possible paths are considered which lie on either side of the best path. It will be appreciated that where such pruning is used it can no longer be guaranteed that the dynamic programming process will find the optimum path. However, with a pruning threshold that reduces the average amount of computation by, for example a factor of 5 to 10, the right path will almost always be obtained where the words are fairly similar. In this embodiment, the recognition block 17 shown in Figure 2 uses a dynamic programming matching process similar to the one described above, for matching the sequence of parameter frames for the utterance to be recognised with the word models 19 and noise model 23. Recognition Search Another feature of the speech recognition system according to this embodiment is the manner in which the dynamic programming process is implemented. In particular, this embodiment makes use of the fact that the minimum calculation performed in equation (6) above, i.e. min[ D ( k -1 ,j ), D ( k -1 ,j -1), D(k -1, j -2), D ( k- 2, j -3)] does not depend upon the current frame f k being processed. Therefore, this part of equation (6) can be calculated when the previous frame f k-1 is being processed. The manner in which the dynamic programming process is implemented will now be explained with reference to Figures 21 to 31. Figure 21 is a flow chart illustrating the processing performed in the recognition block 17 when an input utterance is to be recognised. The system processes the parameter frames of the input utterance in the sequence that they are generated by the preprocessor 15. For this purpose a frame counter variable k is provided which is initialised to zero in step S41 and is subsequently incremented after each frame is processed in step S61. Each frame being processed is used in step S47 to update the cumulative distances of the remaining valid paths within each word model. For this purpose a word counter w is provided and initialised in step S43 and incremented after step S47 in step S49. In step S45 the system checks to see if all the word models have been processed using the current frame, i.e. it checks to see whether the word counter w is less than the number of words known to the system n w . Once each word model has been processed using the current frame f k the processing passes to step S51 where the nodes of the language model 21 shown in Figure 17a are processed using the current frame. The processing performed in step S51 takes care of the situation where the current parameter frame corresponds to silence at the beginning or end of the input speech or between allowed sequences of words in the input speech. This processing also ensures that the valid paths can only propagate through allowed sequences of words. After the nodes have been processed in step S51, the cumulative distances for the valid paths which end at one of the beginning or "entry states" of each word model are updated in step S57. This processing is to cope with the situation where the next parameter frame f k+1 is matched with the beginning of a word model, when the current parameter frame f k is matched with the end of another word model. To achieve this, the word counter w is reinitialised to zero in step S53, and the system checks, in step S55, whether all the word models have been processed. The system then updates, in step S57, the cumulative distances for the entry states of the current word model, and the word count w is incremented in step S59. The processing then returns to step S55. After all the word models have been processed for the current parameter frame f k , the parameter frame counter variable k is incremented in step S61. The system then determines, in step S63, whether there are any more parameter frames of the input utterance to be processed. This is done by comparing k with the system limit (LIMIT) and the end of speech identifier (EOS) in step S63. The system limit is defined by the size of buffer used to store the speech samples output from ADC 63 shown in Figure 3. If all the parameter frames of the incoming utterance have been processed, then the DP process is complete and a backtracking algorithm is used to determine the optimum path, and hence the recognition result. If on the other hand, the system determines, at step S63, that there are further parameter frames to be processed, then the system adjusts the pruning threshold in step S65 and the processing returns to step S43. The pruning threshold Th is adjusted in step S67 to limit the number of valid paths that will be processed in steps S47, S51 and S57 when the next input frame is being processed. The processing performed in step S47 of Figure 21 will now be described in more detail with reference to Figures 22 to 26 for a particular example of a word model. In particular, Figure 22 shows an example word model 201 which comprises a sequence of states S 0 to S 9 derived during a training session, and an exit state S D at the end of the word model 201, the purpose of which will be described below. Each state S of the word model 201 has associated therewith a cumulative distance store D[S] which stores the cumulative distance of a valid path which ends at that state. In this embodiment, the word model 201 also has associated therewith a current active list 203 for the current frame f k which lists, in descending order, the states in the word model that are at the end of a valid path for the current frame f k . Therefore, each state in the current active list 203 will store the cumulative distance of the valid path that ends at that state. In this particular example, the current active list 203 for the current frame f k lists states S 7 , S 5 , S 4 , S 3 , S 2 , S 1 and S 0 . The states on the current active list 203 will be referred to as active states. In this embodiment, the word model 201 also has associated therewith a new active list 205, which is completed during the processing performed in step S47 and which lists the states in the word model 201 that will be at the end of a valid path for the next frame f k+1 . The significance of the current active list 203 and the new active list 205 will now be explained with reference to Figure 23. In particular, Figure 23 shows seven valid paths p1 to p7 which represent seven possible matchings between the incoming word and the word model 201 up to the current frame f k . As shown, the seven valid paths p1 to p7 end at word model 201 states S 7 , S 5 , S 4 , S 3 , S 2 , S 1 and S 0 respectively, and it is these end states of the valid paths that are listed, in descending order, in the current active list 203. To determine the states that are to be in the new active list 205, i.e. to determine the paths remaining for the next input frame f k+1 , consideration has to be given to the state transitions that are allowed from one input parameter frame to the next. The maximum amount of time compression of the reference models relative to the incoming utterance is determined by the maximum number of states that can be skipped between adjacent frames of the incoming utterance. In this embodiment, this is set to two, i.e. the DP process follows the state transition diagram shown in Figure 19. The maximum amount of time expansion of the reference models relative to the incoming utterance is determined by the maximum number of consecutive incoming frames which can be matched to the same state. In this embodiment, only three consecutive frames can be matched to the same state. To monitor for this situation, each state S has associated therewith a self-repetition counter, SELF, which is incremented whenever the same valid path ends at that state from one input frame f k to the next f k+1 . Therefore, for example, path p5 may propagate along one or all of the dashed paths 207 shown in Figure 23. The other paths p1 to p4 and p6 to p7 shown in Figure 23 will propagate in a similar manner. If two or more paths meet at the same point, then the path having the lowest cumulative distance is maintained and the others are discarded. Further, if the cumulative distance of a path is greater than the pruning threshold then this path will also be discarded. In this way, new paths are continuously being created whilst others are discarded. The aim of the pruning threshold is to limit the number of valid paths that are processed for each input parameter frame, thereby placing a limit on the amount of time and memory required for the algorithm. Figure 24 shows in more detail the processing steps performed in step S47 of Figure 21. In particular, in step S71 a pointer LA is initialised and the cumulative distance stored in the exit state, i.e. D[S D ], of word model 201 is set to a very large value, HUGE. The pointer LA is used to point to the last active state that has been placed in the new active list 205. Initially, there are no active states in the new active list 205 and so pointer LA is set to point to the exit state S D . In step S73 the system then checks to see if there are any active states in the current active list 203. In other words, a check is made to see if there are any valid paths ending in the current word for the current frame f k . In the present example there are seven active states in the current active list 203 and the system processes each in turn. A count variable i is provided, which is used to count through the active states on the current active list 203, and which is set to zero in step S75 and incremented in step S79 until all the active states in the current active list 203 have been processed. The system determines whether all the active states have been processed by comparing, in step S81, the value of the count variable i with the number n a of active states in the current active list 203. Once all the active states on the current active list 203 have been processed, the new active list 205 generated during the processing in step S77 is changed, in step S83, to be the current active list 203 for the next frame f k+1 of the input utterance to be processed. In practice this is achieved by swapping the pointers that are used to point to the two active lists. The old current active list then being overwritten during the processing of the next input frame f k+1 . Finally in step S85 the last state that was activated and put on the new active list 205, indicated by pointer LA, is stored for use in step S57 shown in Figure 21. An overview of the processing performed in step S77 will now be given by taking as examples, active states S 7 and S 5 , which are at the ends of paths p1 and p2 respectively, as shown in Figure 23. Figure 25 shows part of the two valid paths p1 and p2 that end at states S 7 and S 5 respectively at the current frame f k . The dashed lines in Figure 25 show the ways in which each of the two paths p1 and p2 may propagate at the next frame f k+1 . As indicated by dashed line 213 it is possible for path p1 to extend into another word at frame f k+1 . Therefore, the cumulative distance of path p1 (which is stored in active state S 7 ) is copied into the exit state S D . As indicated by dashed lines 215, 217 and 219 path p1 can also propagate to state S 9 , state S 8 and state S 7 respectively. Therefore, the cumulative distance of path p1 is also copied into these states. States S 9 , S 8 and S 7 are then added, in descending order, to the new active list 205 (but not the exit state which is never actually compared with the incoming frames, and is only used to store the minimum cumulative distance of all the paths that leave the word) and the last active pointer LA is set to point to the last state added (i.e. state S 7 ). Referring to Figure 26a, the new active list 205 is shown after the first state S 7 on the current active list 203 has been processed. As shown, state S 9 , state S 8 and state S 7 are in the first three elements of the new active list 205 respectively, and the last active pointer LA points to state S 7 . Referring back to Figure 25, as indicated by dashed lines 221, 223, 225 and 227 path p2 can propagate to state S 8 , state S 7 , state S 6 and state S 5 respectively. However, the cumulative distance for path p2 is not simply copied into each of these states, since two of the states S8 and S 7 already have a cumulative distance stored therein for the next frame f k+1 . For these two states, a comparison is made between the cumulative distances already stored therein and the cumulative distances associated with path p2, and the smallest is copied into those two states. In other words the cumulative distance stored in S 8 and S 7 for the paths shown in Figure 23 and after processing active state S 5 is given by min(D[S 7 ],D[S 5 ]). On the other hand, the cumulative distance stored in active state S 5 can be copied directly into state S 6 since a cumulative distance for the next frame f k+1 has not previously been stored therein. The two states S 6 and S 5 (since state S 5 has not repeated twice) are then added to the new active list 205 and the last active pointer LA is set to point to state S 5 . Referring now to Figure 26b, the new active list 205 is shown after the second active state S 5 on the current active list 203 has been processed. As shown, states S 9 , S 8 , S 7 , S 6 and S 5 are in the first five elements of the new active list 205 respectively, and the last active pointer LA points to state S 5 . The remaining active states on the current active list 203 are processed in an identical manner and then the processing proceeds to step S49 shown in Figure 21, where the word count is incremented. The last active pointer LA is provided so that the system does not have to look at the new active list 205 to identify those states which require a comparison and those that do not. If the state is equal to or beyond the state indicated by the last active pointer LA then a comparison is required, otherwise the cumulative distance can simply be copied into the state. The processing performed in step S77 shown in Figure 24 will now be described in more detail with reference to Figures 27a and 27b, for the example of the word model 201 shown in Figure 22. The first active state S to be processed corresponding to i = 0 in step S77 is state S 7 . Therefore, in step S91 of Figure 27a the system checks to see whether the cumulative distance for the valid path ending at state S 7 is less than the pruning threshold Th, i.e. D[S 7 ] is compared with Th. If D[S 7 ] is greater than the pruning threshold Th, then this path is discarded and the processing returns to step S79 shown in Figure 24. If D[S 7 ] is less than the pruning threshold Th then the processing proceeds to step S92 where the variable ACOUNT, which is used to keep count of the total number of active states processed for the current frame f k , is incremented. Then the system calculates, in step S93, the local distance between the current active state S 7 being processed and the current frame f k being processed and adds this to the cumulative distance D[S 7 ]. In the present embodiment, the following Euclidean distance equation is used to derive a measure of the local distance between the current frame f k and the current active state S: d ( S, fk ) = ∥ S-f k ∥ 2 After the cumulative distance D[S 7 ] has been updated in step S93, the system checks to see, in step S95, if the valid path which ends at the current active state S 7 can leave the current word at the next input frame f k+1 . With the above DP constraints this implies determining whether the state three states beyond the current active state S being processed, will be beyond the last state in the word model 201. As the state three states beyond the current active state S 7 is past the last state S 9 , a pointer j is set to point to the exit state S D at the end of word model 201 in step S97. In step S101 the state indicated by pointer j is compared with the state indicated by the last active pointer LA. Since this is the first active state in the current active list 203 to be processed, the last active pointer LA will be pointing to the exit state S D (see step S71 shown in Figure 24). Therefore the processing proceeds to step S103 where the cumulative distance stored in the state pointed to by pointer j, i.e. the exit state S D , is compared with the cumulative distance for the valid path p1 ending at the current active state S 7 being processed. The cumulative distance stored in the exit state, i.e. D[S D ], has just been set to the large value, HUGE, in step S71 shown in Figure 24, and will therefore be larger than the cumulative distance stored in the current active state S 7 being processed. Consequently, the processing proceeds to step S105 where D[S 7 ] is copied into D[S D ]. Next in step S107 the self-repetition count for the state indicated by pointer j, i.e. the exit state S D , is set to zero. Then in step S109 the pointer j is decremented and now points to state S 9 , and the processing returns to step S101. This time the state indicated by pointer j (state S 9 )is before the state indicated by the last active pointer LA (state S D ) and therefore the processing proceeds to step S111 shown in Figure 27b. In step S111 the system checks to see if the state pointed to by pointer j, i.e. state S 9 , is equal to the current active state S 7 being processed. It is not, therefore, the processing proceeds to step S113 where the cumulative distance stored in state S 9 is made equal to the cumulative distance stored in the current active state S 7 . In other words, the cumulative distance of path p1 is copied into state S 9 . Then in step S115 state S 9 is added to the new active list 205 shown in Figure 22. In step S117 the self-repetition counter associated with state S 9 is reset to zero, and in step S119 the pointer j is decremented and now points to state S 8 . The processing then returns to step S111 and state S 8 is processed in a similar manner. After state S 8 has been processed in steps S113, S115 and S117, j is decremented in step S119 and now points to state S 7 which is also the current active state being processed. Therefore at this point, the processing proceeds to step S121 where the self-repetition count associated with state S 7 is checked to see if the valid path ending at state S 7 has ended there for the past two frames of the input utterance. If the self-repetition count associated with state S 7 is equal to two, then state S 7 is not added to the new active list 205 and the processing proceeds to step S123 where the last active pointer LA is set to point to the current active state plus one, i.e. to state S 8 . This routine ensures that if the self-repetition count associated with the current active state is equal to two, then the valid path which ends at the current active state is prevented from propagating to the same state at the next frame f k+1 . In the example of the paths shown in Figure 23, path p1 ending at state S 7 for the current frame f k came from state S 6 and therefore the self-repetition count will be equal to zero. Consequently, state S7 is added to the new active list 205 in step S125. The self-repetition count for state S 7 is then incremented in step S127, and the last active pointer LA is set to point to the current active state, i.e. state S 7 , in step S129. After step S129 or step S123 the processing proceeds to step S131 where the cumulative distance stored in the current active state S 7 is compared with the minimum cumulative distance MINSCORE for all of the valid paths, in all the words, that have been processed for the current frame f k . If the cumulative distance stored in state S 7 is less than MINSCORE then MINSCORE is replaced by the cumulative distance stored in state S 7 in step S133, and the processing returns to step S79 shown in Figure 24. If the cumulative distance stored in MINSCORE is smaller than the cumulative distance associated with the current state S 7 , then the processing returns to step S79 shown in Figure 24. Upon returning to step S79 the count variable i is incremented and the next active state in the current active list 203, i.e. state S 5 , is processed in step S77. Active state S 5 is processed in a similar manner to active state S 7 described above. In particular, provided the cumulative distance of the valid path ending at state S 5 is less than the pruning threshold Th, then in step S93, the system calculates the local distance between the current active state S 5 and the current frame f k being processed and adds this to the cumulative distance stored in the current active state S 5 . Then in step S95 the system determines that the path p2 ending at the current active state S 5 cannot extend into another word at the next frame f k+1 due to the above DP constraints. In other words three states beyond state S 5 is not equal to or beyond state S D , and therefore the processing proceeds to step S99 where the pointer j is set to point to state S 5 plus three, i.e. state S 8 . The state indicated by pointer j is then compared with the state pointed to by the last active pointer LA in step S101. Last active pointer LA points to state S 7 and pointer j points to state S 8 . Therefore, the processing proceeds to step S103 where the cumulative distance already stored in state S 8 (as a result of the processing of active state S 7 ) is compared with the cumulative distance stored in active state S 5 . If the cumulative distance stored in S 8 is greater than the cumulative distance stored in active state S 5 then it is replaced by the cumulative distance stored in active state S 5 . Then the self-repetition counter associated with state S 8 is reset to zero in step S107 and the pointer j is decremented in step S109 so that it now points to state S 7 . The processing then returns to step S101 where a similar processing is performed. This recursive processing routine is performed on all the current active states in all the reference words known to the system. After processing each word in the above manner for the current frame f k , each node in the language model 21 is processed in turn. As described above the language model 21 determines the sequences of words that are allowable. This information is defined by the nodes and in particular by the words that are connected to the input and output thereof. The processing of the nodes in step S51 of Figure 21 ensures that valid paths only propagate through allowed sequences of words. The processing performed in step S51 will now be described in more detail with reference to Figure 28. Initially, prior to processing any of the nodes the local distance between the frame representative of background noise and the current frame f k (i.e. d(noise,f k )) is calculated in step S151. Then in step S153 a node pointer v is initialised to point to the start node N 0 . Then in step S155 the cumulative distance stored in the node pointed to by the node pointer v, i.e. D[v], is compared with the pruning threshold Th. If D[v] is less than the pruning threshold Th then the processing proceeds to step S157 where d(noise, f k ) is added to the cumulative distance stored in the current node v being processed. Then in step S159 the system compares D[v] with the value stored in the minimum value store MINSCORE, and copies it into MINSCORE in step S161 if it is smaller. Then the count ACOUNT (which indicates the number of active states and nodes that have been processed for the current frame) is incremented in step S163 and the processing proceeds to step S165. Returning to step S155, if D[v] is greater than the pruning threshold Th then it is set to the large value HUGE in step S167 and the processing proceeds to step S165. The processing performed in step S165 and step S168 will be explained for the example node N shown in Figure 29, which has the three words "get", "save" and "load" connected to its input and the words "an" and "the" connected to its output. Although the generation of such a node is not possible using the procedure shown in Figure 17b, this example is chosen to illustrate that the dynamic programming process will work for more complex language models. In particular, finite state grammars where nodes like the one shown in Figure 29 are commonplace. In step S165 the system determines the minimum of all the cumulative distances stored in the exit states for the words connected to the input of node N, i.e. the exit states of words "get", "save" and "load". For the general case, this calculation is represented by: where I w [v] represents all the words connected to the input of node v. After the system has determined this minimum cumulative distance for node N, it is copied into the cumulative distance D[N] stored in node N if it is smaller than the cumulative distance already stored there. In effect, this is a determination of whether there is a valid path coming from one of the words connected to the input of the node which has a smaller cumulative distance than the cumulative distance of the path which is still propagating in the node. It is possible for valid paths to propagate within the node because it is possible that there are gaps before, between and at the end of the words in the phrase which match with the background noise frame. This possibility of a valid path remaining within a node from one input frame to the next is represented by the arrow 231 shown in Figure 29, which leaves and returns to node N. Unlike the states of the word models, a path may remain within a node for any number of consecutive input frames. After the system has performed the processing of step S165 the cumulative distance stored in node N is copied, in step S168, into the temporary store INSCORE represented by boxes 233 and 235 for words "an" and "the" respectively, if it is smaller than the value already stored there. A comparison must be made since it is possible that a word may be connected to the output of more than one node, and it is only the path having the minimum cumulative distance that is propagated into the connecting word. The cumulative distance stored in the temporary store INSCORE of a word is used to update the entry states of that word during the processing in step S57 shown in Figure 21. The system then checks, in step S169, whether D[v] equals the large value HUGE. If it does, then this indicates that no valid paths will end or pass through the current node v into a word connected to it at the next frame f k+1 . If D[v] is less than the large value HUGE, then a valid path will either end at the node v or passes through it into a word connected to it, at the next frame f k+1 . Therefore, the counter PACOUNT, which represents the number of potentially active states (and nodes) at the next input frame f k+1 , is incremented in step S171 since the silence state associated with that node may be active at the next input frame f k+1 . The node pointer v is then incremented in step S173 and will now point to the next node in the language model 21. The system then checks to see if all the nodes in the language model 21 have been processed in step S175, by checking to see if the node pointer v indicates a node which is beyond the end node N n in the language model 21. If the system has not finished processing all the nodes, then the processing returns to step S155, whereas if all the nodes have been processed then the processing returns to step S53 shown in Figure 21. The processing performed in step S57 shown in Figure 21 will now be described in more detail with reference to Figures 30 and 31, for the word model 201 shown in Figure 22. Referring to Figure 30, in step S181 the system checks to see if the cumulative distance stored in INSCORE equals the large value HUGE. If it does then this means that no valid paths will be entering this word at the next time point. Therefore, this word does not need to be processed again, so the processing proceeds to step S207 where the number of active states for the next input frame f k+1 (which are now stored in the current active list 203 due to step S83 shown in Figure 24), is added to the count PACOUNT. The processing then returns to step S59 shown in Figure 21 where the word count is incremented so that the next word model can be processed. If on the other hand, INSCORE is not equal to the large value HUGE, then this means that a valid path has left a preceding word and may enter the current word being processed. Therefore, the states of the current word model which can be reached by a path extending from another word model (which will be referred to as the entry states) must be updated using the cumulative distance stored in INSCORE. In the present embodiment with the above DP constraints the entry states are states S 0 , S 1 and S 2 . This updating procedure is achieved in the following manner. Firstly in step S183 the system checks to see if the word model representative of the current word being processed contains more than three states (not including the exit state). If there are more than three states, then the state pointer j is set to point to state S 2 in step S185. If on there other hand there are less than three states in the current word, then the state pointer j is set, in step S187, to point to the exit state S D at the end of the word being processed. After the state pointer j has been set to point to either state S D or state S 2 in steps S187 or S185 respectively, the processing proceeds to step S189 where the state indicated by pointer j is compared with the state indicated by the last active pointer LA. As with the processing performed in the sequence of steps shown in Figures 27a and 27b, if the state indicated by pointer j is beyond the state indicated by the last active pointer LA, then a comparison has to be made between the cumulative distance already stored in that state and the cumulative distance stored in INSCORE. For the example DP paths shown in Figure 23, path p7 can propagate to states S 1 , S 2 and S 3 at the next frame f k+1 but not to state S 0 , since path p7 has ended at state S 0 for the preceding two frames. Therefore, the last active pointer LA will point to state S 1 . Figure 31 shows the entry states (i.e. the first three states) of the word model 201 shown in Figure 22. As shown, the last active pointer LA points to state S 1 . Since there are more than three states in the word model 201 the state pointer j will point to state S 2 . Therefore, the system will determine, in step S189, that the state indicated by pointer j is beyond the state indicated by the last active pointer LA, i.e. state S 1 , and therefore, the processing proceeds to step S191. In step S191 the system compares the cumulative distance stored in state S 2 with the cumulative distance stored in the temporary store INSCORE associated with word model 201. The store INSCORE, for word model 201, is represented by rectangular box 241 shown in Figure 31. If the cumulative distance stored in INSCORE is smaller than the cumulative distance stored in state S 2 , then it is copied into state S 2 in step S193. Then in step S195 the self-repetition count for state S 2 is reset to zero and the processing proceeds to step S197. If the cumulative distance stored in INSCORE is greater than the cumulative distance stored in state S 2 , then the cumulative distance stored in state S 2 is unchanged and the processing proceeds to step S197 where the pointer j is decremented so that it now points to state S 1 . The processing then returns to step S189 and the same processing is performed to state S 1 . After processing state S 1 the pointer j is decremented again in step S197, and will now point to state S 0 . Therefore, the processing will proceed to step S198 after step S189, where the system checks to see if there are any more states to be processed. Since state S 0 is still to be processed, the system proceeds to step S199 where the cumulative distance stored in INSCORE is copied into state S 0 . No comparison of cumulative distances has to be performed for state S 0 as this state is before the last active state pointed to by the last active pointer. The system then adds, in step S201 state S 0 to the current active list (which was the new active list 205 prior to step S83 in Figure 24) and decrements the pointer j so that it now points to state S -1 . The processing then returns to step S198 where the system determines that there are no more entry states in the current word to be processed. The processing then proceeds to step S205 where the cumulative distance stored in the corresponding temporary store INSCORE is reset to the large value HUGE. The number of states on the current active list is then added, in step S207 to the count PACOUNT and the processing returns to step S59 shown in Figure 21. Pruning Referring to Figure 21, if in step S63 the system determines that there are more input frames to be processed, then the processing proceeds to step S65 where the pruning threshold Th is adjusted. The aim of using pruning is to limit the number of DP paths that propagate from one time point to the next. In particular, the present embodiment aims to adjust the pruning threshold so that the number of active states that are actually processed remains essentially bounded within predefined limits, which are dictated by the amount of working memory and processing time available. Furthermore, the present embodiment also aims to achieve this without the need for expensive computational overheads. In this embodiment, the pruning threshold is determined by adding a variable differential value (PRUNING) to the overall minimum cumulative score MINSCORE determined for the input frame just processed, i.e. the pruning threshold is given by: Th = MINSCORE + PRUNING One way of ensuring that only a set number of active states are processed for each input frame is to sort the active states that are on all the active lists for the input frame about to be processed in order of increasing cumulative distances stored therein, and then only processing the desired number beginning with the one with the lowest cumulative distance. However, this technique requires a large amount of computational time to sort out the active states. Rather than performing this computationally expensive sorting, the technique employed in the present embodiment makes use of the information available after processing the last input frame. In particular, in this embodiment a differential value (PRUNING) is varied in dependence upon the number of states that are potentially active (which is stored in PACOUNT) for the next input frame to be processed, in order to maintain the number of states that will actually be processed, to be between two thresholds. The manner in which the pruning threshold Th is adjusted will now be described in more detail with reference to Figure 32. In step S211 the system compares the number of states that are potentially active for the next frame to be processed (which is stored in PACOUNT) with a state threshold (STATETH), which is set to be less than but close to an absolute maximum state threshold determined by the amount of working memory available. If the value stored in PACOUNT is less than STATETH then this means that all the potentially active states can be processed, and therefore, the differential value PRUNING used at the last time point can be increased. Therefore, in step S213 an adjustment constant dp1 is added to the existing differential value, PRUNING. The value of dP1 is set to be larger than any reasonable local distance, so that most, if not all, of the potentially active states will be processed. The value stored in PRUNING is then compared with a high pruning threshold, HIGHPRTH in step S215. An upper limit is placed on the differential value PRUNING as it is assumed that there is a maximum differential value above which there is never any need to go. If the value stored in PRUNING is less than HIGHPRTH then the processing proceeds to step S219. If the value stored in PRUNING is greater than HIGHPRTH then PRUNING is set to equal HIGHPRTH in step S217. After step S215 or step S217 the system sets the pruning threshold Th to equal the minimum cumulative distance of all the remaining valid paths, i.e. MINSCORE, plus the differential value PRUNING. The processing then returns to step S43 shown in Figure 21. If at step S211 the system determines that the number of potentially active states, PACOUNT, for the next frame is greater than STATETH, then the system compares, in step S221, the number of states that were active and processed during the processing of the last input frame (which is stored in ACOUNT) with a low state threshold, LOWSTTH. The value of LOWSTTH is set to try and ensure that if ACOUNT is less than LOWSTTH, then it will be possible to process all the potentially active states for the next input frame without taking too much time or memory. Therefore, if ACOUNT is less than LOWSTTH, then the processing passes from step S221 to step S213 where the differential value PRUNING is adjusted and the processing proceeds as described above. If, on the other hand, ACOUNT is greater than LOWSTTH then there is no guarantee that if all the potentially active states are processed then this will not take too much time or memory to process. Therefore, it may be necessary to reduce the differential value PRUNING. In order to determine whether the differential value PRUNING needs to be reduced, the system compares ACOUNT with STATETH in step S223. If ACOUNT is less than STATETH then the system checks to see if the differential value PRUNING is equal to HIGHPRTH. If it does equal HIGHPRTH then this indicates that the system has been trying to process all the active states, and that therefore, it is unlikely that the number of active states that will be processed for the next input frame will result in the process taking too long or too much memory. Therefore, the differential value PRUNING is not changed and the processing passes to step S219 where the pruning threshold is set to equal MINSCORE plus the differential value PRUNING. If on the other hand, the differential value PRUNING is not equal to HIGHPRTH (in which case it must be less than it), then it is possible that the number of active states that will be processed for the next input frame will take too long or too much memory. Therefore, the actual number of active states that will be processed must be calculated. This is performed in step S233 using the pruning threshold set in step S231 which uses an unchanged differential value PRUNING. Returning to step S223, if the system determines that ACOUNT is greater than STATETH then the differential value PRUNING is reduced by the adjustment constant dp1 in step S225. After the differential value PRUNING has been decreased in step S225, the system determines in step S227 whether the differential value PRUNING is less than a low pruning threshold, LOWPRTH. A low pruning threshold is used to ensure that the number of active states that will be processed for the next input frame, will be greater than a set emergency state threshold, EMGSTTH. The reason for this is that it has been found that the dynamic programming process fails if it is pruned too heavily. If the differential value PRUNING is less than the low pruning threshold LOWPRTH, then it is made equal to LOWPRTH in step S229, and the pruning threshold Th is set, in step S231, to equal MINSCORE plus the adjusted differential value PRUNING. Subsequently, in step S233 the system counts the number of active states that will be processed for the next input frame. This is achieved by comparing the cumulative distances stored in all the active states and the cumulative distances stored in all the nodes with the newly determined pruning threshold Th. This total number (n sa ) represents the total number of active states and nodes that will be processed for the next input frame. If this total number n sa is less than the emergency state threshold, EMGSTTH, then the pruning threshold has been set too low and the processing returns to step S213 where the differential value PRUNING is increased and the pruning threshold Th is reset. If n sa is not less than EMGSTTH then it is compared with LOWSTTH in step S237. If n sa is greater than LOWSTTH then this implies that the pruning threshold Th set in step S231 is acceptable and the processing returns to step S43 shown in Figure 21. If on the other hand, n sa is less than LOWSTTH, then the pruning threshold can be increased, and so a second adjustment constant dp2 is added to the differential value PRUNING in step S239, prior to the pruning threshold Th being reset in step S219. In this embodiment the second adjustment constant dp2 is set to equal half the adjustment constant dp1. As those skilled in the art will realise, the above method of varying the pruning threshold is not computationally expensive, yet it allows the pruning threshold to be adjusted in such a manner that the number of active states that are processed at each time point is bounded, so that the allocated processing time and memory are not exceeded. After all the frames in the input sequence have been processed using the sequence of processing steps illustrated in Figure 21 a backtracking routine is required to determine the exact path taken by the optimum path determined by the dynamic programming process. In this embodiment the backtracking routine traces through backpointers which indicate the sequence of words through which each path propagates. The details of the way in which the backtracking routine is performed, and the way in which the pointers are generated are well known to those skilled in the art of speech processing, and will not be described further. Initialisation Before the system attempts to recognise an input utterance, the system thresholds and variables which are used during the recognition process must be initialised. This is achieved in the following manner. Firstly the cumulative distance stored in the start node N 0 is set to zero and the cumulative distance stored in all the other nodes is set to equal the large value, HUGE. Then the counter which counts the number of potentially active states, PACOUNT, associated with each word model is set to zero; the last active pointer associated with each word model is set to point to the end state S D of that model; and the temporary store INSCORE associated with each word model is set to the large value, HUGE. All the nodes are then processed so that the minimum of the cumulative distances of all the nodes connected to the input of a word is, copied into the temporary store INSCORE associated with that word. This ensures that the temporary store INSCORE of each word connected to the start node N 0 is set to zero. Finally, the value stored in INSCORE of each word is used to activate and initialise the entry states of each word model. The processing steps to initialise the entry states of each word model are identical to the processing steps used to update the entry states described above with reference to Figure 30. The pruning threshold and the differential value PRUNING are also initialised prior to the processing of the first input frame. In particular, the pruning threshold Th is set to the large value, HUGE, and the differential value PRUNING is set to equal the high pruning threshold, HIGHPRTH. Flexible dynamic programming alignment A brief description is given above with reference to Figures 13 to 16, of the way in which the word models are generated in this embodiment. In particular, isolated word models are first generated for the words contained in a phrase by aligning the sequence of parameter frames corresponding to the phrase with the sequences of parameter frames corresponding to the words when spoken in isolation contained within the phrase, using a flexible dynamic programming alignment process. This flexible alignment process will now be described in more detail for the training phrase "get an image", when no word model for the words in the phrase exists yet. Figure 33 shows the sequence of parameter frames 152 which corresponds to the utterance of the phrase "get an image" and the sequences of parameter frames 158,160 and 162 corresponding to the utterances of the isolated words "get", "an" and "image" respectively. Since some of the parameter frames in the sequence of parameter frames 152 will correspond to background noise or silence, nodes 251, 253, 255, 257 are provided between the isolated words and at the beginning of the first word and at the end of the last word contained in the phrase. These nodes act in a similar manner to the nodes in the language model shown in Figure 17a, and take care of the situation where a current parameter frame of the sequence of parameter frames 152 being processed, corresponds to silence or background noise. This possibility is illustrated in Figure 33 by the silence frame f sil (which is the noise model 23 shown in Figure 10) at nodes 251, 253, 255 and 257. Although some of the frames at the beginning and at the end of the sequences of parameters frames 158,160 and 162 will correspond to silence or background noise, the parameter frames in the sequence of parameter frames 152 which correspond to silence or background noise should match better with the silence frame f sil stored in the nodes 251, 252, 255 and 257 than the frames corresponding to silence in sequences 158, 160 and 162. This is because the silence frame f sil represents an average of all silence frames, and therefore on average, the variation between the frames in sequence 152 corresponding to silence and the silence frame f sil should be less than the variation between the frames corresponding to silence in sequence 152 and those corresponding to silence in sequences 158, 160 and 162. The way in which the flexible alignment process is carried out is similar to the way in which the input speech is aligned with the stored reference models, as described above with reference to Figures 18 to 32. In particular, the general processing steps of the flexible alignment process follow those shown in Figure 21, using the sequences of parameter frames 158, 160 and 162 as reference models, the nodes 251, 253, 255 and 257 and the frames of sequence 152 as input frames. In order to avoid confusion, the parameter frames of the sequences 158, 160 and 162 representing the words when spoken in isolation will be referred to as states. Like the states of the reference models used during recognition of an unknown input utterance, these states have an associated cumulative distance store for storing the cumulative distance of the dynamic programming path which ends at that state for the current frame of the sequence 152 being processed. The main difference between the flexible alignment process and the alignment process used during recognition of an unknown input utterance is that with the flexible alignment: (i) each dynamic programming path can enter a word at any position (and not only in one of the entry states); and (ii) each dynamic programming path can exit a word from any state therein. The way in which the flexible alignment process operates for the above example will now be explained by considering the first few parameter frames of the sequence of parameter frames 152. Before processing the first frame, however, the cumulative distance scores associated with the nodes and the states in the word models are initialised. This initialisation procedure is similar to the initialisation procedure performed prior to attempting to recognise an unknown input utterance, as described above. In particular, the cumulative distance stored in the start node, ie. node 151, is set to zero and the cumulative distance stored in all the other nodes is set equal the large value, HUGE. The cumulative distance scores of the states in words W1, W2 and W3 are then updated using the cumulative distance scores stored in the nodes connected to the input of the words. This will ensure that a dynamic programming path can be started at each state of the first word W1 and at the first node 151 when the frame f 0 P1 is processed. After initialisation, the first frame f 0 P1 is processed with respect to each word W1, W2 and W3 in turn. However, since the cumulative distance associated with the states in words W2 and W3 will have the value, HUGE, the first frame will only be processed with respect to the states in the first word W1. When processing the first frame with respect to word W1, the distance between frame f 0 P1 and each state in word W1 is stored in the respective cumulative distance store associated with that state. The flexible alignment process then processes the nodes 251, 253, 255 and 257 in turn, using the processing steps shown in Figure 28. Finally, the processing of the first frame f 0 P1 is completed by updating the cumulative distance scores of the states in words W1, W2 and W3 using the results of the node processing. The updating procedure is similar to that shown in Figure 30 except all the states in the words are updated and not just the entry states (ie. the first three states). Once the first parameter frame of sequence 152 has been processed, the second parameter frame f 1 P1 is processed in order to propagate the dynamic programming paths started by the processing of the first parameter frame f 0 P1 . As with the dynamic programming method used during recognition of an input utterance, the states in each word W1, W2 and W3 are processed in reverse sequential order, using in this embodiment similar propagation constraints as those described with reference to Figures 19 and 20. The only difference is that each dynamic programming path is also allowed to exit a current word from any of its states, and not just from the last three states as is the case during recognition of an unknown input utterance. Once the words W1, W2 and W3 have been processed using the second parameter frame f 1 P1 , the nodes 251, 253, 255 and 257 are processed in order to update the dynamic programming path which is currently propagating within each node. Once this had been done, each of the words W1, W2 and W3 is processed again in order to update the dynamic programming paths in order to take into account the results of the node processing. The remaining parameter frames in the sequence of parameter frames 152 are then processed in turn in a similar manner. Once all the parameter frames in the sequence 152 have been processed, the dynamic programming path with the lowest cumulative score is determined. In order to identify the beginning and end frames within the sequences of parameter frames 158, 160 and 162 which bound those parameter frames which represent the corresponding words (and not silence), a record is made of the progress of each dynamic programming path during the flexible alignment process. In particular, whenever a dynamic programming path enters a word, either from a preceding word or from the node in front of the word, the state into which that dynamic programming path enters is recorded and associated with that path. Similarly, when a dynamic programming path exits a word then the state from which it exits is recorded, provided the score associated with that path is lower than the score associated with all previous dynamic programming paths which have exited from that word. Therefore, once the last parameter frame in the sequence of parameter frames 152 has been processed and the dynamic programming path having the best score is identified, approximate beginning and end points of the words within the sequence of parameter frames 158, 160 and 162 can be identified by looking at the record associated with the identified dynamic programming path. As those skilled in the art will appreciate, the above description of the flexible alignment process is particular to the situation where no word model exists for each word contained in the input phrase. However, since the training of the reference models is designed to be incremental in nature, ie. such that the user can train the system at his convenience, the situation will sometimes arise that a word model for a word in an input phrase will already exist. In this case, during the alignment between the phrase and the individual words, a hybrid type dynamic programming alignment process is employed which uses a standard type dynamic programming alignment process for words that already have a word model, and a flexible dynamic programming alignment process for the other words which do not yet have a word model. As mentioned above with reference to steps S25 and S26 in Figure 14, once the isolated word models for the unknown words in a phrase have been determined, they are aligned with the sequence of parameter frames of the input phrases containing that word, and word models are generated from the result. Word Model Adaptation Another feature of the speech recognition system according to this embodiment is that the word models 19, the noise model 23 and the language model 21 shown in Figure 10 can be updated and even modified by the build/update module 91. Therefore, the stored word models 19 can be modified or adapted by the input speech of a different user. Figure 34 is a flow chart which illustrates one method of how the stored word models 19 can be adapted to a different user. In particular, in step S251 the the new user inputs a known word or phrase into the system via the microphone 7 and the keyboard 3. The build/update module 91 therefore has the sequence of parameter frames corresponding to the utterance from the new user and the corresponding text entered via the keyboard 3. The system then aligns, in step S253, the input utterance with the existing word models of the words which are known to be in the utterance using a dynamic programming routine. The dynamic programming routine aligns the parameter frames of the input utterance with the states of the appropriate word models. The system then directly replaces, in step S255, the states of the word models with the sequence of parameter frames which are aligned therewith. If the new user then decides, in step S257, to input another phrase, then the processing returns to step S251, and the same routine is performed again for the next input utterance. If the new user decides at step S257 that no more phrases are to be adapted then the processing ends. Figure 35 is a flow chart which illustrates a second method of how the stored word models 19 can be adapted for a different user. In particular, in step S261 the new user inputs a known word or phrase into the system, a number of times via the microphone and once via the keyboard. The build/update module 91 therefore has a plurality of sequences of parameter frames, each corresponding to the utterance of the known word or phrase by the new user, and the corresponding text entered via the keyboard 3. The system then aligns, in step S263, each input utterance with the existing word models of the words which are known to be in the utterance, using a dynamic programming routine. The dynamic programming routine aligns the parameter frames of each input utterance with the states of the appropriate word models. The system then replaces, in step S265, the states of the word models with the average of the parameter frames which are aligned therewith. If a state of a word model has not been aligned with any of the parameter frames of the utterances then, in this embodiment, the system interpolates between or extrapolates from neighbouring replaced states. If the new user decides, in step S267, to adapt another phrase, then the processing returns to step S261, and the same routine is performed again for the next phrase. If the new user decides at step S267 that no more phrases are to be input then the processing ends. Therefore, as will be apparent to those skilled in the art, the new user can adapt the existing word models incrementally at his convenience. Additionally, the new user can also add new words or phrases to the system in the manner described above. Alternative Embodiments A number of modifications can be made to the above speech recognition system without departing from the inventive concept of the present invention. A number of these modifications will now be described. Although in the above embodiment, the whole utterance is received before it is processed, the system can run incrementally whereby as the speech is received it is processed. In such an embodiment, an input buffer would still be required, but it would only need to be able to store incoming speech corresponding to one frame, i.e. 20 milliseconds of speech. As those skilled in the art will realise, in order for this system to work, the entire processing of the frame of input speech (by the preprocessor and the recognition block), must be finished before the next frame of input speech is ready to be processed. With the above frame rate and frame duration, this means that the time taken to process a frame of input speech must be less than ten milliseconds. This can be achieved with current state of the art processors. In addition, the power parameter in each frame of the input utterance would have to be normalised in a different manner. One way of normalising the power in such an embodiment would be to use an adaptive normalisation factor which would be adapted based upon the power of the input speech over, for example, the previous twenty input frames. In the first embodiment, the states of the word models which were at the end of a dynamic programming path were listed in an active list associated with that word model. In an alternative embodiment a single global active list could be provided in which all the active states of all the word models would be listed. In such an alternative embodiment, information would have to be stored associated with the global active list, for identifying which word models the particular active states belong to. In the first embodiment, the states of the word models correspond in time duration to the frames of the input speech to be recognised. In an alternative embodiment, each state of a word model could be equivalent in time duration to, for example, three consecutive frames of the input speech. In such an alternative embodiment, the input frames would be averaged in groups of three and then aligned with the states of the word models. In yet another alternative embodiment, the word models could be statistical models, for example Hidden Markov models, well known to those skilled in the art of speech recognition. In such an embodiment, rather than determining the minimum cumulative distance between the input utterance and the sequences of word models, the maximum probability that the input sequence was generated by a particular sequence of Hidden Markov models would be determined. In such an embodiment, the Hidden Markov models would be generated in a similar manner to the continuous reference models generated in the first embodiment. In particular, an isolated reference model for a word would be generated by comparing an utterance of the word with one or more utterances of phrases containing the word. The isolated reference model would then be used with a plurality of example phrases, which contain the word, to generate the mean parameter frames and the covariance matrices of the states of the Hidden Markov Model, and to generate the transition probabilities between the states. The way in which this would be achieved, would be apparent to those skilled in the art of speech recognition. In the first embodiment, the reference models used corresponded to whole words. As those skilled in the art will realise, this is not essential. The reference models could correspond to parts of words, e.g. syllables, to a plurality of words or even to individual phonemes. However, the disadvantage of using reference models which correspond to phonemes is that the system becomes language dependent. Further, reference models which are equivalent to whole words are preferred to those equivalent to whole phrases because there is a potential for time and computational savings. In particular, by modelling the words within phrases and by using a language model, it is possible to teach the system many different phrases using only a handful of words. If on the other hand, the reference models corresponded to the whole phrases, then a reference model would be required for each of the different phrases to be learnt by the system. In addition to this advantage, the use of reference models which correspond to words also increases the system's flexibility to gaps between the words in the phrase. This is possible because of the environment model which can appear at the beginning or end of the phrase and also between the words in the phrase. In yet another alternative embodiment, the reference models could be compressed if consecutive frames of the model are similar. If this situation arises then the consecutive similar frames would be replaced by a single frame. In such an embodiment, the constraint placed on the dynamic programming process, that consecutive frames of the input utterance cannot be aligned with the same state of a word model more than twice, would have to be removed. In the language model shown in Figure 17, if a word can be followed by two different words, then no preference is placed on which of the two words will follow that word. In an alternative embodiment, it would be possible to weigh some sequences of words more favourably than others. For example, for the phrases illustrated in Figure 17a, it may be known that the phrase "make it more ..." (followed by a colour) is more common than the phrases "make it smaller", or "make it larger" or "make it brighter". Therefore, the transition from node N 7 to node N 8 is made stronger compared to the transition from node N 7 to the end node N n . This can be achieved by using weighing factors which weigh the cumulative distances being propagated from node N 7 to the input of words "more", "smaller", "larger" and "brighter". As those skilled in the art will realise, the language model used to define the allowed sequences of words does not have to be a Bigram model, but could be any known type of language model, for example a finite state grammar model. If the type of language model used is changed, then some modifications would have to be made to the dynamic programming matching process described above, but such modifications would be apparent to those skilled in the art of speech recognition. However, the essential features of the matching process would remain unchanged, as these are designed to be suitable for use in any pattern matching process. In the first embodiment, at least two phrases which contain a word had to be input into the system before a reference model for that word could be generated. This is a preferred mode of operation, and word models could be generated for each word from only a single example phrase containing that word. However, in such an embodiment, the reference models will be less representative of that word when used in any given phrase. Additionally, in the training method used in the first embodiment, once a reference word model is determined for a word the word model is not changed regardless of whether subsequent input training phrases contain that word. In an alternative embodiment, it would be possible to update existing word models during the training session, using input phrases which contain examples of the words for which there are already word models. When the user is training the speech recognition system, and inputs a phrase containing a number of words which have already been input in isolation, the system does not prompt the user to input those words in isolation again. In an alternative embodiment, the system could prompt the user for those words again, and could perform a consistency check to ensure that the two utterances of the word do not significantly differ. In the first embodiment, when the reference models are being trained or adapted, the user has to input the text and then input the corresponding voice command. As those skilled in the art of speech recognition will realise, this is not essential. Instead of entering text, the user could simply press a corresponding key/combination of keys on the keyboard, facsimile machine, photocopier etc. For example, when training the system for use in a photocopier, when entering the voice command "copy" the desired machine response can be input by the user simply pressing the copy button. In addition, it will be apparent to those skilled in the art of pattern matching, that the method of implementing the dynamic programming matching process and the reference model generation and adaptation processes described above, could also be used for matching other types of patterns. For example, it is envisaged that the above described pattern matching process could be used in handwriting recognition or other pattern matching techniques. Although a continuous word speech recognition system is described in the first embodiment described above, it will be apparent to those skilled in the art that many features of the system described could equally apply to other kinds of speech recognition systems. For example, the way of determining the isolated word models, and the isolated word models referred to above, could be used in an isolated word speech recognition system. Similarly, many features of the way in which the dynamic programming process is carried out, and the way in which the pruning threshold is adjusted, could be used in any speech recognition system where the reference models correspond to any part of speech, e.g. phonemes, syllables, etc. The speech recognition system described in the first embodiment can be used in conjunction with many different software applications, for example, a spreadsheet package, a graphics package, a word processor package etc. If the speech recognition system is to be used with a plurality of such software applications, then it might be advantageous to have separate word and language models for each application, especially if the phrases used in each application are different. The reason for this is that as the number of word models increases and as the language model increases in size, the time taken for the system to recognise an input utterance increases. Therefore, by having separate word and language models for each application, the speed of the speech recognition system can be maintained. Additionally, several word and language models could be used for each application. Additionally, as those skilled in the art will appreciate, the above speech recognition system can also be used in many different types of hardware. For example, apart from the obvious use in a personal computer or the like, the speech recognition system could be used as a user interface to a facsimile machine, telephone, printer, photocopier or any machine having a human/machine interface. The present invention as defined by the appended claims is not intended to be limited by the exemplary embodiments described above, and various other modifications and embodiments will be apparent to those skilled in the art.

Claims: A pattern matching method for matching a sequence of input patterns representative of an input signal with a number of sequences of reference patterns, each sequence being representative of a reference signal, the method comprising the steps of: matching (s45, s47, s49) the input signal with each reference signal using a dynamic programming matching process which processes each pattern of said input signal in sequence and which propagates a plurality of dynamic programming paths using predetermined dynamic programming constraints, each path representing a possible matching between a sequence of reference patterns and a sequence of patterns of the input signal ending at the current pattern being processed, and each path having an associated cumulative value representative of the score for that possible matching; controlling (s91) said matching step by comparing said cumulative values with a pruning value thereby to restrict the number of dynamic programming paths being propagated; determining (s92), at a current time point when a current input pattern is being processed by said matching step, the number (PACOUNT) of possible dynamic programming paths that will be propagating at the succeeding time point when the succeeding input pattern will be processed by said matching step, prior to restriction by said controlling step; and altering (s65) the pruning value to be used in said controlling step at said succeeding time point in dependence upon the number (PACOUNT) of possible dynamic programming paths determined by said determining step at the current time point; characterised in that said matching step comprises the steps of: using said dynamic programming constraints to propagate each dynamic programming path ending at the current input pattern being processed to the succeeding time point; and in the case where a plurality of dynamic programming paths meet at the succeeding time point, maintaining the dynamic programming path having the best cumulative value and discarding the rest; and in that said determining step comprises the step of counting (s92) the number of dynamic programming paths which have been propagated to the succeeding time point but which have not been discarded. A method according to claim 1, wherein said input signal is a speech signal (s(t)), and wherein each pattern comprises a number of parameters representative of the acoustic properties of the input speech signal during a corresponding time frame. A method according to claim 1 or 2, wherein said altering step (s65) is arranged to alter the pruning value for the succeeding time point to equal the sum of the minimum cumulative value (MINSCORE) for the dynamic programming paths ending at the current input pattern and a variable (PRUNING) which is varied in dependence upon said number of possible matchings determined in said determining step. A method according to claim 3, wherein the variable (PRUNING) is increased by a first adjustment constant (dpi) if said number (PACOUNT) of possible dynamic programming paths determined in said determining step is less than a first matching threshold (STATETH). A method according to claim 4, wherein if said number (PACOUNT) of possible dynamic programming paths determined in said determining step is greater than said first matching threshold (STATETH), then the variable (PRUNING) is varied in dependence upon the number (ACOUNT) of cumulative values determined in said matching step at the current time point. A method according to claim 5, wherein the variable (PRUNING) is decreased by said first adjustment constant (dp1) if said number (ACOUNT) of cumulative values determined in said matching step at the current time point, is greater than said first matching threshold (STATETH). A method according to claim 5 or 6, wherein if said number (ACOUNT) of cumulative values determined in said matching step at the current time point exceeds said first matching threshold (STATETH), then said altering step (s65) checks whether the number (n sa ) of possible dynamic programming paths which have a cumulative value less than a determined pruning value exceeds an emergency threshold (EMGSTTH), and wherein said altering step redetermines the pruning value for the succeeding time point using an increased value of the variable (PRUNING) if said number is less than said emergency threshold. A method according to claim 7, wherein the variable (PRUNING) is increased by a second smaller adjustment constant (dp2), if said number (n sa ) determined in said altering step is greater than said emergency threshold (EMGSTTH) but less than a second matching threshold (LOWSTTH), which is less than the first matching threshold (STATETH) but greater than said emergency threshold (EMGSTTH). A method according to claim 8, wherein said second adjustment constant (dp2) is half the value of said first adjustment constant (dp1). A method according to any of claims 3 to 9, wherein said altering step adjusts the value of the variable (PRUNING) to be equal to a set maximum value (HIGHPRTH) if the variable has been adjusted to be greater than that maximum. A method according to any of claims 3 to 10, wherein said altering step adjusts the value of the variable (PRUNING) to be equal to a set minimum value (LOWPRTH) if the variable is adjusted to be less than that minimum value. A method according to any preceding claim, wherein said matching step further comprises the step of defining as active patterns the reference patterns of a current reference signal (201) which are at the end of a dynamic programming path for a current input pattern being processed and listing the active patterns for the current input pattern in a current active list (203). A method according to claim 12, wherein the cumulative value associated with each dynamic programming path is stored in a store (D[]) associated with the corresponding active pattern. A method according to claim 12 or 13, wherein said matching step propagates the dynamic programming paths by processing each active pattern in turn and listing a reference pattern of the current reference signal which may be located at the end of that dynamic programming path for the succeeding input pattern in a new active list (205). A method according to claim 14, wherein said counting step (s92) increments a count each time a reference pattern is added to the new active list (205). A method according to claim 15, wherein once all the active patterns have been processed for the current input pattern, said count represents the number of dynamic programming paths which have been propagated to the succeeding input pattern and which have not been discarded. A method according to any preceding claim, wherein the method further comprises the steps of receiving the input signal and obtaining the sequence of input patterns representative of the input signal during the receiving step and wherein said matching step performs said matching whilst said receiving step is still receiving said input signal. A method according to any preceding claim, wherein said matching step updates (s93) the cumulative value associated with each dynamic programming path which is not restricted by said controlling step using the current input pattern, prior to propagating those dynamic programming paths to the succeeding input pattern. A pattern matching apparatus for matching a sequence of input patterns representative of an input signal with a number of sequences of reference patterns, each sequence being representative of a reference signal, the apparatus comprising: means (s45, s47, s49) for matching the input signal with each reference signal using a dynamic programming matching process which processes each pattern of said input signal in sequence and which propagates a plurality of dynamic programming paths using predetermined dynamic programming constraints, each path representing a possible matching between a sequence of reference patterns and a sequence of patterns of the input signal ending at the current pattern being processed, and each path having an associated cumulative value representative of the score for that possible matching; means (s91) for controlling said matching means by comparing said cumulative values with a pruning value thereby to restrict the number of dynamic programming paths being propagated; means (s92) for determining, at a current time point when a current input pattern is being processed by said matching means, the number (PACOUNT) of possible dynamic programming paths that will be propagating at the succeeding time point when the succeeding input pattern will be processed by said matching means, prior to restriction by said controlling means; and means (s65) for altering the pruning value to be used by said controlling means at said succeeding time point in dependence upon the number of possible dynamic programming paths determined by said determining means at the current time point; characterised in that said matching means comprises: means for propagating each dynamic programming path ending at the current input pattern being processed to the succeeding time point using said dynamic programming constraints; and means for maintaining the dynamic programming path having the best cumulative value and discarding the rest in the case where a plurality of dynamic programming paths meet at the succeeding time point; and in that said determining means comprises means (s92) for counting the number of dynamic programming paths which have been propagated to the succeeding input pattern but which have not been discarded. An apparatus according to claim 19, wherein said input signal is a speech signal (s(t)), and wherein each pattern comprises a number of parameters representative of the acoustic properties of the input speech signal during a corresponding time frame. An apparatus according to claim 19 or 20, wherein said altering means (s65) is arranged to alter the pruning value for the succeeding time point to equal the sum of the minimum cumulative value (MINSCORE) for the dynamic programming paths ending at the current input pattern and a variable (PRUNING) which is varied in dependence upon said number of possible matchings determined by said determining means. An apparatus according to claim 21, wherein said altering means is operable to increase said variable (PRUNING) by a first adjustment constant (dp1) if said number (PACOUNT) of possible dynamic programming paths determined by said determining means is less than a first matching threshold (STATETH). An apparatus according to claim 22, wherein if said number (PACOUNT) of possible dynamic programming paths determined by said determining means is greater than said first matching threshold (STATETH), then said altering means is operable to vary the value of the variable (PRUNING) in dependence upon the number (ACOUNT) of cumulative values determined by said matching means at the current time point. An apparatus according to claim 23, wherein said altering means is operable to decrease the value of said variable (PRUNING) by said first adjustment constant (dp1) if said number (ACOUNT) of cumulative values determined by said matching means at the current time point, is greater than said first matching threshold (STATETH). An apparatus according to claim 23 or 24, wherein if said number (ACOUNT) of cumulative values determined by said matching means at the current time point exceeds said first matching threshold (STATETH), then said altering means is operable to check whether the number (n sa ) of possible dynamic programming paths which have a cumulative value less than a determined pruning value exceeds an emergency threshold (EMGSTTH), and wherein said altering means is operable to redetermine the pruning value for the succeeding time point using an increased value of the variable (PRUNING) if said number is less than said emergency threshold. An apparatus according to claim 25, wherein said altering means is operable to increase the variable (PRUNING) by a second smaller adjustment constant (dp2), if said number (n sa ) determined by said altering means is greater than said emergency threshold (EMGSTTH) but less than a second matching threshold (LOWSTTH), which is less than the first matching threshold (STATETH) but greater than said emergency threshold (EMGSTTH). An apparatus according to claim 28, wherein said second adjustment constant (dp2) is half the value of said first adjustment constant (dp1). An apparatus according to any of claims 21 to 27, wherein said altering means is operable to adjust the value of the variable (PRUNING) to be equal to a set maximum value (HIGHPRTH) if the variable has been adjusted to be greater than that maximum. An apparatus according to any of claims 21 to 28, wherein said altering means is operable to adjust the value of the variable (PRUNING) to be equal to a set minimum value (LOWPRTH) if the variable is adjusted to be less than that minimum value. An apparatus according to any of claims 19 to 29, wherein said matching means further comprises means for defining as active patterns the reference patterns of a current reference signal (201) which are at the end of a dynamic programming path for a current input pattern being processed and means for listing the active patterns for the current input pattern in a current active list (203). An apparatus according to claim 30, wherein the cumulative value associated with each dynamic programming path is stored in a store (D[]) associated with the corresponding active pattern. An apparatus according to claim 30 or 31, wherein said matching means is operable to propagate the dynamic programming paths by processing each active pattern in turn and listing a reference pattern of the current reference signal which may be located at the end of that dynamic programming path for the succeeding input pattern in a new active list (205). An apparatus according to claim 32, wherein said counting means is operable to increment a count each time a reference pattern is added to the new active list (205). An apparatus according to claim 33, wherein once all the active patterns have been processed for the current input pattern, said count represents the number of dynamic programming paths which have been propagated to the succeeding input pattern and which have not been discarded. An apparatus according to any of claims 19 to 34, further comprising means for receiving the input signal and means for obtaining the sequence of input patterns representative of the input signal, and wherein said matching means is operable to perform said matching whilst said receiving means is still receiving said input signal. An apparatus according to any of claims 19 to 35, wherein said matching means is operable to update (s93) the cumulative value associated with each dynamic programming path which is not restricted by said controlling means using the current input pattern, prior to propagating those dynamic programming paths to the succeeding input pattern. A storage medium storing processor implementable instructions for controlling a processor to implement the method of any one of claims 1 to 18 when said instructions are loaded into said processor. Processor implementable instructions product for controlling a processor to implement the method of any one of claims 1 to 18 when said instructions product is run on said processor.

Inventors: TZIRKEL-HANCOCK ELI, TZIRKEL-HANCOCK, ELI, Tzirkel-Hancock, Eli, Canon Res. Centre Eur. Ltd.
Applicants: CANON KK, CANON KABUSHIKI KAISHA
Application year: 1997
Main classification: G10L15
IPC codes: G10L15