A pattern recognition apparatus and method for doing the same

Abstract: A learning pattern is classified into a plurality of patterns by a classifying means (102). The result of the classification, as well as the representative features quantity calculated by a representative feature quantity operating unit (103), are stored in a dictionary storing unit (104) in respective regions. Upon recognition, after feature quantities of unknown input patterns are extracted from a feature quantity extracting unit (101), a similarity operating unit (105) arithmetically operates the similarity between the input pattern and respective learning patterns for respective regions. The point accumulating means (106) searches a dictionary storing unit (104) and accumulates points corresponding to a rank for respective learning patterns included in class having the upper rank from the highest to a lower similarity for respective regions. The recognition result candidate outputting unit (107) outputs the recognition result candidate in accordance with the order of the higher accumulated point for the learning pattern. Therefore, the present pattern recognition can decrease the memory capacity of the dictionary and the number of the calculations.

Description: Background of the Invention Field of the Invention The present invention relates to a pattern recognition apparatus according to the preamble of claim 1 and to a pattern recognition method according to the preamble of claim 15. Description of the Related Art A feature quantity is extracted from an unknown image pattern (such as a type or hand-written pattern) and a speech signal pattern (such as a time variable pattern of a frequency envelope of an unknown word) and a recognition of these unknown input patterns is conducted. A method for matching this feature quantity with a feature quantity of a previously-stored learning dictionary pattern and thus determining the dictionary pattern with the highest similarity to the input pattern as the recognition result, is generally known. A prior art method for performing a matching of one unknown input pattern with a plurality of learning dictionary patterns is as follows. A set of feature quantities extracted from an unknown input pattern and a set of feature quantities representing the whole feature of a pattern are stored as a dictionary pattern. Respective sets of feature quantities of the dictionary pattern are matched with a set of feature quantities of the unknown input pattern so that all the sets of feature quantities of the dictionary patterns are matched with a set of feature quantities of the unknown input pattern. The dictionary pattern is arranged in the order of the highest to lowest similarity of the feature quantity to provide recognition candidates. This is the "usual pattern matching method". In the above prior art, when a lot of image data are to be recognized, a lot of data are required to enable feature quantities to be extracted from one pattern. Thus, the quantity of data required to express a pattern is very large. About 3000 Japanese image data are required to recognize Japanese type. Thus, a great amount of memory capacity is required to store feature quantities of all Japanese type image data, resulting in high cost. As feature quantities of unknown input patterns are matched with all the feature quantities of respective dictionary patterns of 3000 types, the prior art has the problem that it can merely realize a recognition apparatus. This requires an extremely long recognition time and has a bad response capability. On the other hand, where a single unknown input pattern is matched with a learning dictionary pattern to recognize a word it is important to compare appropriate feature quantities of the unknown input pattern and learning dictionary pattern, because the respective patterns comprise a plurality of feature quantities. The first prior art for the matching method is as follows. Time sequence patterns of feature quantities of unknown input words are made corresponding to the time sequence patterns of the feature quantities of the learning word, starting from the beginning of respective words, and similarities (distances) between respective feature quantities are calculated. The sum of the similarities between respective feature quantities of the whole time sequence pattern is obtained and the similarity between the words is calculated. This calculation is performed for all the learning words and the one having the highest similarity (i.e. the smallest distance) is provided as the recognition result. Generally, words have different lengths as the times taken to pronounce words are not constant. Therefore, as the above first prior art does not consider differences in word length, it cannot achieve a high recognition ratio. A DP matching method is provided as the second prior art. This method expands or compresses, non-linearly in the time direction, respective time sequence patterns of feature quantities of the unknown input words and respective time sequence patterns of the feature quantity of the learning word. It then repeats the calculation of distance between respective feature quantities and calculates the accumulated distance for respective words. This calculation is applied to all the learning words and the one having the smallest accumulated distance is determined to be the recognition result. The above second prior art considers differences in length and can achieve a high recognition ratio. It requires a lot of calculation as it needs to expand and compress the time axis non-linearly for respective words. In particular, when this calculation is repeated for all the learning words, the total amount of calculation is extremely large, making it difficult to perform a realtime processing. Both first and second prior arts, which require a matching for all the learning words recited above, have the basic problem that a large amount of calculation is required. To solve this problem, there is proposed a method of roughly classifying the unknown input words to focus the word candidate, and performing a fine recognition on a limited number of word candidates. In this case, the prior art cannot provide a recognition method which focusses the word candidate sufficiently quickly and accurately. As a result, it cannot easily realize a quick word recognition method with a high recognition ratio. Extraction of a feature quantity constitutes the basis of pattern matching. A feature quantity expressing the feature of the pattern must be extracted efficiently from a type image pattern or word signal pattern (which is obtained by expressing a time variable pattern of the frequency envelop in a form of an image) to enable recognition of the pattern. In the first prior art for extracting a feature quantity, the density or direction of strokes in many directions is extracted. However, this prior art has the problem that it cannot easily reflect the structure of a complex pattern (such as a complex Chinese character in Japanese) by the density of strokes. For example, it cannot express a pattern having a structure of many short strokes by the density of strokes. The second prior art is a so-called structure segmentation method, in which the pattern is recognized by separating local structure segments. For example, the Chinese characters, "hen" and "tsukuri" constitute parts of a composite Chinese character, and these parts are separated from each other for recognition. However, the above second prior art needs to examine all the structure segments and it takes a time to extract the feature quantity. It also needs to separate and recognize respective structure segments and thus it is weak against noise. It cannot be applied to patterns which have single structure segments, namely, patterns such as the ┌ ┘, ┌ ┘, ┌ ┘ in Chinese characters in Japanese. Further, in some characters the structure segments have the same shape but different size, for example, ┌ ┘ in ┌ ┘ and ┌ ┘. This makes it difficult to form a pattern with a standard feature quantity. Therefore, the second prior art cannot provide a pattern recognition system with high capability. "Rough Classification of Hand-written Characters by Divide-and-Unify Method", Systems and Computers in Japan, Vol. 19, No. 2, 1988 by Toshiaki Ejima, Yutaka Katsuyama and Masayuki Kimura describes a method for the rough classification of hand-written characters by dividing and unifying the characteristic vectors of hand-written characters according to a method in which a characteristic vector is decomposed into sub-vectors and then similar patterns are used for matching to each sub-vector independently. Summary of the Invention The present invention is made in consideration of the above situation and an object is to realize a pattern recognition system whose dictionary memory capacity is small, whose recognition candidate can be accurately extracted to provide a high recognition capability, and whose time is greatly improved. Another object of the present invention is to provide a pattern recognition system in which a feature quantity accurately reflects the pattern structure can be extracted without requiring recognition of the structure segment, thereby providing a better pattern-recognition capability. Thus in one aspect, the present invention provides a pattern recognition apparatus as defined by claim 1. According to a first embodiment of the present invention a pattern recognition apparatus for extracting a feature quantity from the input pattern and recognizing the pattern has the following structures. The feature quantity extracting unit extracts feature quantity from so many regions of an input pattern that may reflect the partial structure of the pattern. For example, the type image data is divided into a plurality of regions and a feature quantity such as the direction components of the line element of the type pattern is extracted from respective regions. Next, the classifying unit classifies a plurality of learning patterns for these regions. The learning patterns are based on the feature quantities of respective regions extracted from the feature quantity extracting unit. The feature quantities of respective regions are subjected to a clustering. A representative feature quantity operating unit arithmetically operates the representative feature quantities of respective classes and, for example, the average of the feature quantities of the respective classes. The dictionary storing unit stores the representative feature quantities of respective classes and the learning patterns included in respective classes, as a dictionary for respective regions and, for example, comprises a ROM. A similarity operating unit arithmetically operates a similarity between a feature quantity extracted from the feature quantity extracting unit for respective regions for the unknown input pattern and a representative feature quantity of respective classes corresponding to the dictionary memory unit. It then, for example, determines the euclidean distance between the feature quantity of the unknown input pattern and the representative feature quantity. A point accumulating unit searches a dictionary memory unit and accumulates points corresponding to the order of classes up to the upper predetermined order from the highest to a lower similarity for respective regions. A recognition-result candidate-outputting unit outputs recognition result candidates of the learning pattern in the order of the highest to a lower point after the accumulation operation by the point accumulating unit is completed for all the regions. According to the first embodiment of the present invention, the learning pattern is divided into a plurality of regions. Respective classified regions greatly decrease the memory capacity of the dictionary in which only the representative feature quantities of respective classes are stored. On the other hand, a calculation of the similarity between an unknown input pattern and the learning pattern may be conducted upon recognition for representative feature quantities of respective classes for respective regions. The quantity of data for the feature quantity for respective regions decreases in accordance with the number of divisions. The amount of calculation is much less than for the case where the similarity between the feature quantities of the unknown input pattern and all the learning patterns are calculated. Further, where a total similarity within the unknown input pattern and respective learning patterns is obtained after the similarity between respective classes with regard to respective regions is calculated. An accumulation of points is applied only to the learning patterns included in the classes of the upper orders of similarity. Thus, the amount of calculation may be smaller than where the sum of the similarities is obtained for respective learning patterns. Next, according to a second embodiment of the present invention, the pattern recognition apparatus for extracting the feature quantity from the input word pattern and for performing the recognition of the input word has the following structure. First, the feature quantity extracting unit extracts the feature quantity from respective parts of a plurality of parts of the input word pattern. Cepstrum coefficients obtained for respective frames of a plurality of frames are collected and grouped, and are extracted as feature quantities of respective parts of the input word pattern. The classifying unit, the representative feature quantity operating unit, the dictionary storing unit and the similarity operating unit of the second embodiment are the same as those of the first embodiment. The classifying unit classifies a plurality of word learning patterns based on the feature quantities of respective parts extracted from the feature quantity extracting unit for a plurality of learning word patterns. The representative feature quantity operating unit arithmetically operates the representative feature quantities of respective classes. The dictionary storing unit stores the representative feature quantities of respective classes and the kind of learning word patterns included in respective classes for respective portions. The similarity operating unit arithmetically operates the similarity between the feature quantities of respective parts extracted by the feature quantity extracting unit from the unknown input word pattern and the representative feature quantity of corresponding respective classes in the dictionary storing unit. Next, the rough classification unit arithmetically operates the similarity between respective learning word patterns stored in the dictionary storing means based on the above similarity and unknown input word patterns. It then outputs rough classification word candidates with a rank in accordance with the order of the highest to a lower similarity of the learning word pattern. This rough classification unit may comprise a point accumulating unit and a recognition result candidate output unit as shown in the first embodiment. A vowel sequence recognition unit recognizes the vowel sequence of the unknown input word pattern. The feature quantity of the unknown input word pattern, for example, is matched with respective feature quantities of the five Japanese vowels. A vowel sequence dictionary storing unit stores the vowel sequences of respective learning word patterns as a dictionary. The fine classification unit performs respective DP matchings of the vowel sequences of respective learning word patterns corresponding to the rough word candidates extracted from the vowel sequence dictionary storing unit, and the vowel sequence of the unknown input word pattern from the vowel sequence unit. It then outputs the fine classification word candidate with a rank in the order of the highest to a lower degree of matching from the rough word candidates. The required memory capacity of the dictionary in the second feature can be greatly decreased for the same reason as it is in the first embodiment. When the word recognition is conducted based on the word candidate according to the second feature, the rough classification candidate is obtained from the rough classifiaction process. The rough classification is selected by the fine classification process to provide a fine classification word candidate. This two-stage method enables calculation of the word candidate to be conducted at high speed and accuracy. The final recognition, such as DP matching, is again applied to the fine classification word candidates whose numbers are limited by the above process. Thus, this process can realize a word recognition system in which the amount of calcualtion is greatly reduced and the recognition ratio is equal to or higher than the recognition method in which DP matching, for example, is employed from the beginning. In a second aspect, the present invention provides a pattern recognition method as defined by claim 15. Brief Description of the Drawings The other object and the features of the present invention will be easily understood by a person skilled in the art from the description of the preferred embodiment together with the attached drawings. Fig. 1A is a block diagram showing the first principle structure of the present invention, Fig. 1B is a flowchart showing the operation of the dictionary forming process of the first principle, Fib. 1C is a flowchart showing the operation of the recognition process according to the first principle, Fig. 2A is a block diagram showing the second principle structure of the present invention, Fig. 2B is a diagram showing the operation of the second principle, Fig. 3 is a block diagram showing the third principle structure of the present invention, Fig. 4 shows the structure of the first embodiment of the present invention, Fig. 5 is a flowchart showing the operation of the first embodiment, Fig. 6 shows an example of a pattern of type image data, Fig. 7 shows an example of a pattern of type image data after noise reduction and smoothing, Fig. 8 shows an example of type image data after normalizaing, Fig. 9 shows an example of type image data after thin-line processing, Figs 10A to 10D show masks for extracting the direction component , Fig. 11 shows an example of thin-line type image data, Fig. 12 shows an operational flowchart of the operation for extracting the type direction line element feature quantity, Fig. 13A shows a relationship between the line element processing type image data and the small regions, Fig. 13B explains the weighting of the small regions, Fig. 14 shows an example of a calculation of the type direction line element feature quantity, Fig. 15 is an operational flowchart showing the associative matching standard pattern forming process, Fig. 16 explains the clustering operation, Fig. 17 shows the operation of the distance calculation according to the associative matching method, Fig. 18 shows an example of the recognition operation according to the associative matching method, Fig. 19 is an example of a fine classification table, Fig. 20 is a block diagram showing the whole structure of the second embodiment, Fig. 21 is an operational flowchart showing the operation of the preprocessing unit, Fig. 22 explains the process of automatically cutting out the word period, Fig. 23 shows the time sequence pattern of the feature vector of the word, Fig. 24 explains the process of extracting partial patterns, Fig. 25 illustrates a classification of learning words into T classes based on partial patterns specified by mask ψ and a formation of standard partial patterns as representatives of respective classes, Fig. 26 is a diagram of the word dictionary, Fig. 27 is a diagram showing an example of a calculation of distance between the unknown input word and the dictionary word, Fig. 28 explains the formation of the table of distance between partial patterns with respect to an unknown input word W, and Fig. 29 explains the operation for obtaining the accumulated distance between vowel sequences based on DP-matching. Description of the preferred embodiments Explanation of the first principle Figs. 1A to 1C show views which illustrate the first principle of the present invention. Fig. 1A is a block diagram. Feature quantity extracting unit 101 extracts feature quantities from respective regions of a plurality of regions of an input pattern. For example, the type image data is divided into a plurality of regions and a feature (for example, direction) of a line of a type pattern is extracted from respective regions. Classifying unit 102 is used with a dictionary. Feature quantities are extracted from feature quantity extracting unit 101 for respective regions for a plurality of learning patterns 108. Thereafter, a plurality of learning patterns are classified into some classes at respecive regions. For example, feature quantities of respective regions are subjected to a clustering operation. Representative feature quantity arithmetic operation unit 103 is used with a dictionary. Representative feature quantities of respective classes classified into respective regions by the classifying unit 102 are arithmetically operated. For example, the average of the feature quantities of a region corresponding to learning pattern 108 included in respective classes is calculated to provide a representative feature quantity. Dictionary storing unit 104 stores the representative feature quantity of respective classes and the kinds of learning patterns included in respective classes, as a dictionary for respectively defined regions. This unit comprises, for example, a ROM (read only memory) or a disk memory apparatus. Similarity arithmetic operating unit 105 is used upon recognition of unknown input pattern 109. Feature quantity extracting unit 101 extracts feature quantity from a particular region. Thereafter, the similarity between the unknown input pattern and the representative feature quantities of respective classes corresponding to the regions of dictionary storing unit 104 are arithmetically operated. For example, the euclidean distance between the feature quantities are arithmetically operated. Similarly, point accumulating unit 106 is used upon recognition of unknown input pattern 109 and similarity operating unit 105 is considered so that dictionary storing unit 104 searches learning patterns included in classes located in the upper sequence of the similarity in respective regions and the point corresponding to the rank within the class is calculated. For example, the learning patterns included in the classes of the upper five ranks of a small euclidean distance accumulate points. The first rank is 5 points, the second rank is 4 points .... fifth rank is 1 point. Recognition result candidate output unit 107 is used upon recognizing unknown input pattern 109. After an accumulation operation in respective regions is completed by point accumulating unit 106, recognition result candidate 110, whose order is sequentially outputted from the learning pattern in which the number of accumulated points is high, is sequentially outputted as recognition result candidate 110. The operation of the first principle structure is explained by referring to Figs. 1B and 1C. First a dictionary-forming process, which should be performed before a recognition process, is explained by referring to Fig. 1B. Feature quantity extracting unit 101 (Fig. 1A) sequentially inputs a plurality of learning patterns 108 (Fig. 1B, S1) and extracts feature quantities of the whole learning pattern 108 from respective regions by dividing the respective patterns into a plurality of regions of the same type (Fig. 1B, S2). Classifying unit 102 sequentially selects a region from the prespecified regions (S3) and carries out a classification of a plurality of learning patterns into a prespecified number of classes based on feature quantities of learning patterns corresponding to the region (S4). Thereafter, representative feature quantity calculation unit 103 arithmetically operates the representative feature quantity of respective classes classified by the above process (S5). Dictionary storing means 104 stores these representative feature quantities and the classified learning patterns (labels or codes) at the region (S6). Processes S3 to S6 are carried out independently for a plurality of regions (S7 → S3). Then, when all the processes are completed, the dictionary is completed. The above process classifies the whole learning patterns into a prespecified number of classes, thereby greatly decreasing the capacity of the dictionary because it only needs to store the representative feature quantities of respective classes. A feature quantity is stored for each class of the respective regions but the amount of data necessary for an expression of the feature quantity for a region is decreased according to the number of divisions in the region. Thus, the total required memory capacity is less than that where the feature quantities of all the learning patterns are stored. The memory capacity required to store the label of the learning pattern included in respective classes is small compared with the memory capacity of the feature quantity. Thus, the memory capacity of the dictionary as a whole can be decreased. Next, the recognition process is explained by referring to Fig. 1C. Feature quantity extracting unit 101 inputs unknown input pattern 109 (Fig. 1C, S8) and divides it into the same number of regions as the learning pattern, thereby enabling a feature quantity to be extracted from each region (S9). Next, similarity calculating unit 105 sequentially selects a region (S10) and the similarity calculation between the feature quantity of unknown input pattern 109 corresponding to the region in the dictionary storing unit 104 and the representative feature quantity of respective classes in the region is arithmetically operated (S11). Each region includes a plurality of classes and each class has a representative feature quantity. Thereafter, point accumulating unit 106 searches the learning patterns included in classes up to the upper predetermined rank in similarity, in dictionary storing unit 104 and accumulates the points for each learning pattern, which correspond to the order of respective classes (S12). Processes S10 to S12 are carried out independently with regard to a plurality of regions (S13 →S10) and this is called associative matching recognition. After the accumulation operation for all the regions is completed, recognition result candidate output unit 107 outputs the recognition result candidate 110 in accordance with the rank of the candidate, beginning with the learning pattern with the largest number of accumulated points, and then the recognition process is completed (S13 → S14). The above recognition process executes the similarity calculation between the unknown input pattern and the learning pattern only with regard to the representative feature quantity of respective classes for each respective region. The feature data quantities of respective regions decrease according to the number of divisions and the calculation amount is much less than for the case where the similarity is calculated for the feature quantities of all the learning patterns. Further, where the similarities of respective classes in respective regions are calculated and the total similarity of the respective learning patterns is obtained, the accumulation is applied in the form of points only to the learning pattern included in the class of the predetermined high ranks in which the similarity is high. Thus, the number of calculations may be smaller than where the sum of the similarities is obtained for each learning pattern. Explanation of the second principle Figs. 2A and 2B show the second principle of the present invention. The principle is related to the invention in which the feature quantity extracting unit 101 of Fig. 2A extracts the feature quantity of the input pattern. Fig. 2A shows a block structure. Direction component extracting unit 201, for respective dots of a two dimensional input pattern, extracts a direction component of the dot surrounded by adjacent dots, the dot representing the pattern. A plurality of windows for extracting the direction component having a constant direction are prepared and respective dots of the input pattern 204 are scanned. Region dividing unit 202 divides input pattern 204 into a plurality of overlapping regions. For example, on input pattern 204, the region of M times M dots is sequentially designated by overlapping M/2 dots of one region with M/2 dots of the adjacent region. Partial feature vector operating unit 203 totals direction components obtained from direction component extracting unit 201 for respective dots in respective regions divided by the region dividing unit 202, by applying a smaller weight from the center of the region to the periphery in different directions. Partial feature vector 205 is arithmetically operated by enabling the result of the totaling in each direction to be an element of the partial feature vector. For example, when a certain direction component is extracted from respective dots in a region, the numeral value corresponding to the weight of the portion is accumulated in a register for accumulating the direction components. The partial feature vector 205 of the whole region obtained by the above means is finally extracted as pattern direction line element feature quantity 206. The operation of the second principle structure will be explained by referring to the operational drawing of Fig. 1B. Suppose that the input pattern 204 is a pattern represented by "*" for respective dots in Fig. 1B and is the Roman letter "k". This input pattern 204 is input to direction component extracting unit 201 and an arithmetic operation is executed to determine which direction component respective dots designated by "*" have. For example, dots having a horizontal pattern have the direction component A, the vertical pattern has the direction component B, the 45-degree pattern has the direction component C and the 135-degree pattern has the direction component D (as shown in Fig. 1B), thereby enabling the direction component to be extracted for respective dots. When the "*" pattern does not exist, the direction component is not applied. The region dividing unit 202 sequentially designates a plurality of overlapping regions 207 as shown in Fig. 2B, on the input pattern 204. The direction component of respective dots in the input pattern 204 included in the respective region 207 designated as recited above are totaled in respective directions. In this case, as shown in Fig. 2B, a weight is determined at respective positions of region 207. This weight decreases from the center to the periphery of the region. When the direction component A, for example, is extracted from a dot in a region 207 currently designated on the input pattern 204, the numeral values corresponding to the weights determined for the portion in the register for the direction component A are accumulated. Namely, larger values are accumulated in the registers corresponding to the direction component extracted near the center of the region 207. When this operation is completed for a region 207, partial feature vector 205 having an accumulation result of respective direction components as an element is output. Namely, in the example in Fig. 2B, the partial feature vector 205 having the accumulation result in the direction component A as an element is output. Similarly, the partial feature vector 205 has the accumulation results in the direction components B, C and D as the elements. The above operation is repeated for all the regions on the input pattern 204 designated by the region dividing unit 202 and a collection of the partial feature vector 205 thus obtained is finally output as pattern direction line element feature quantity 206. In the above operation, partial feature vector 205 corresponding to respective region 207 represents the features of the partial information corresponding to respective regions 207 of the input pattern 204 of Fig. 2B. Accordingly, in the Chinese character pattern in Japanese, the information corresponding to the partial pattern such as "hen" or "tsukuri" of the Chinese character can be obtained without requiring the recognition of their partial patterns and without going through a complex algorithm. In this case, by providing regions 207 with a weight, the partial feature vector 205 and pattern direction line element feature quantity 206 can clearly reflect the position and direction of the pattern and the weight may be made small for a pattern near the boundary of the region 207. Furthermore, the contribution ratio of the boundary of region 207 to the extraction of the portion feature vector may be made lower, thereby enabling an appropriate process to be conducted for an unstable pattern which may be entered into the adjacent region. Further, by applying a weight to the designation position of region 207, the region may be evaluated based on the same weight even if the position of the pattern is slightly shifted, thereby enabling stable extraction of the pattern direction line element feature quantity 206 to be carried out. The above principle may be applied to the feature quantity extraction unit 101 of the pattern recognition method based on the first embodiment shown in Fig. 1A, thereby increasing pattern recognition accuracy. Explanation of the third principle Fig. 3 illustrates the third principle of the present invention. This is to apply the pattern recognition apparatus of the present invention to word recognition. Feature quantities extraction unit 301 extracts feature quantity from respective input words. Feature vectors such as cepstrum coefficients are calculated for each frame obtained by cutting out the input word in units of a predetermined calculated time period and thereafter the input word is divided into a plurality of parts (partial pattern). The average of the feature vectors is obtained for respective parts and the feature quantity for respective parts is thereby calculated. Classifying unit 302 is used upon preparing a dictionary. It classifies a plurality of learning words 310 for respective pattern portions after the feature quantity extracting unit 301 extracts the feature quantity from a plurality of learning words 310 for respective partial patterns. For example, a clustering of the feature quantity for respective parts can be carried out. An operating unit 303 is used to prepare a dictionary and arithmetically operate the representative feature quantity (standard partial pattern) for respective classes classified into respective parts by the classifying unit 302. The average of the feature quantities of the part corresponding to the learning word 310 included in the respective classes, for example, is calculated to provide the representative feature quantity. Dictionary storing unit 304 stores the representative feature quantity for respective classes and the learning word included in respective classes as a dictionary for respective parts. They are stored, for example, in a ROM (read only memory) or a disk storing unit. Next, similarity operating unit 305 is used to recognize unknown input word 311. After feature quantity extracting unit 301 extracts the feature quantity for respective portions of the unknown input word 311, the similarity operating unit 305 arithmetically operates the similarity between the feature quantity for respective portions of the unknown input word and the representative feature quantities of respective classes corresponding to the parts in the dictionary storing unit 304 for respective parts. For example, the euclidean distance between feature quantities is arithmetically operated. Rough classification unit 306 is also used to recognize the unknown input word 311. It arithmetically operates the similarity between respective learning words 310 stored in the dictionary storing unit 304 and unknown input word 311, based on the similarity arithmetically operated by the similarity operating unit 305. It thereby outputs the learning word which has the higher similarity, in accordance with the order of similarity. The classes in which the respective parts of the learning word 310 are included are obtained by referring to dictionary unit 304. Similarity operating unit 305 refers to and extracts the similarity arithmetically operated by the similarity operating unit 305. The sum of the similarities extracted from all the portions is calculated, thereby determining the similarity of the learning word 310. This process is repeated for all the learning words 310. The rough classification unit 306 produces a learning word in accordance with the degree of similarity selected from among the similarities of respective learning words 310. On the other hand, vowel sequence recognition unit 307 is used for fine classification processing after the rough classification process is completed by rough classification recognition unit 306. The vowel sequence of the unknown input word 311 is recognized independently of the above process. For example, the feature quantity of the previously-stored five Japanese vowels is matched with the feature quantity for respective frames of unknown input word 311. Thus, the vowel sequence is recognized and extracted from respective frames. Vowel sequence dictionary storing unit 308 stores the intra-word vowel sequence of respective learning words 310 as a dictionary. The fine classification unit 309 is used after the rough classification process by the rough classification unit 306. It extracts the vowel sequence of the respective rough classification word candidate 312 output from the rough classification unit 306 from vowel sequence dictionary storing unit 308. Respective DP matchings are conducted between the vowel sequence of respective rough classification word candidates 312 and the vowel sequence of the unknown input word 311 output from the vowel sequence recognition unit 307, thereby producing a rough classification word candidate having a high degree of matching as the fine classification word candidate 313 which has the sequence order. The operation of the third principle is explained hereinafter. First the process of preparing the dictionary is explained as this process should be proceeded with before the rough classification process. 1. Feature quantity extracting unit 301 sequentially inputs a plurality of learning words 310. It then divides respective learning word 310 into a plurality of equal-sized parts and extracts feature quantities of the whole learning word 310 for respective parts. 2. A classifying unit 302 sequentially determines respective parts of a plurality of learning words 310 and classifies them based on the feature quantities of respective learning words. 3. Thereafter representative feature operating unit 303 operates the representative feature quantity of respective classes. This quantity is obtained by classification using the above process. 4. The representative feature quantity of respective classes and the kind of the learning word included in respective classes are stored in dictionary storing unit 304. The above processes 2 to 4 are carried out independently of a plurality of respective parts. When all the processes are completed, the process of forming a dictionary is ended. With regard to the process recited above, the learning word is divided into a plurality of parts and classified into the prespecified number of classes for respective parts. In the dictionary only the representative feature quantity is memorized for each class so that the capacity of the memory is decreased corrersponding to the number of classifications compared with the case where the whole feature quantities of learning word 310 are stored. The memory capacity for the label of the learning patterns included in the respective classes is small compared with that of the feature quantity, and the memory capacity of the dictionary can be decreased. The rough classification process will be explained. 5. Feature quantity extracting unit 301 inputs unknown input word 311 and divides it into a plurality of parts in the same manner as the learning word 310 is divided into a plurality of parts, thereby extracting the feature quantity for respective portions. 6. Similarity operating unit 305 sequentially determines the similarity of a plurality of respective parts and arithmetically operates the similarity between the feature quantity of the unknown input word 311 corresponding to the part and the representative feature quantity of respective classes corresponding to the above part in dictionary memory unit 304. 7. Process 6 is repeated for all the parts. 8. Thereafter, rough classification unit 306 arithmetically operates the similarity from the similarity of the classes for respective parts, in which the learning word is included, for the learning word 110 stored in the dictionary storing unit 304. 9. Process 8 is repeated for all the learning words. 10. As a result of process 9, the similarities of the learning words are ranked in the order of highest to lowest and are output as a rough classification word candidate 312. Calculation of the similarity between the unknown input word 311 and learning word 310 by the rough classification may be conducted only for a feature quantity of a part of the unknown input word and a representative feature quantity of respective classes for the corresponding parts of the learning word. Thus, the number of calculations may be greatly decreased compared with that required to determine the similarity between the partial feature quantity of the unknown input word and the corresponding partial feature quantity of all the learning words 310 without classifying the feature quantities. Next, the fine classification process is explained. 11. The vowel sequence of unknown input words 311 are recognized by vowel sequence recognition unit 307 independently of the above rough classification process. 12. The rough classification word candidate 312 output from the rough classification unit 306 by the above rough classification process is input to the fine classification unit 309. The vowel sequences of rough classification word candidates 312 are then extracted by referring to the vowel sequence dictionary storing unit 308. 13. DP matching is performed between the vowel sequence corresponding to the respective rough classification word candidate 312 and the vowel sequence of unknown input word 311 outputted from vowel sequence recognition unit 307, the vowel sequence being selected from the extracted vowel sequence. 14. The process of 13 is repeated for all the rough classification word candidates 312. 15. As a result of the above 14 processs, the learning word is ranked in the order of highest to lowest matching degree and is output as a fine classification word candidate 313. The order of the rough classification word candidate 312 selected by the rough classification process is selected by the fine classification process, thereby providing the fine classification word candidate 313, which is finally accurately ordered. In this case, the rough classification word candidates 312 are originally selected or limited to about ten candidates. The number of vowel sequences per word candidate is not so large (i.e. several). Therefore, DP matching between the vowel sequence of the rough classification word candidate 312 and the vowel sequence of the unknown word speech 311 can be carried out at a high speed. As described above, where the word is recognized based on the word candidate determined by the third principle, rough classification word candidate 312 is obtained to the rough classification process. Further, the rough classification word candidate 312 is selected or limited by the fine classification process to provide the fine classification word candidate 313. Such a two-stage method enables calculation of the word candidate to be conducted accurately at high speed. The fine classification word candidate 313 for limiting or selecting the number of candidates as described above, is again subjected to DP matching and so on to provide a final recognition. Therefore, compared with the recognition method in which DP matching is conducted from the beginning, the word speech recognition system in which a large number of calculations is required and the recognition ratio equal to or higher than that of the previous prior art method can be realized. A plurality of vowel sequence candidates is produced as a vowel sequence of unknown input word 311 outputted from the vowel sequence recognition unit 307. DP matching with the vowel sequence of respective rough classification word candidates 312 by the fine classification recognition means 309 can be conducted for a plurality of vowel sequence candidates, thereby minimizing the adverse effects of the vowel recognition in the vowel sequence recognition unit 307. In this case, the rank is attached to a plurality of vowel sequence candidates of unknown input 311 and a weight is added in accordance with the order upon DP matching, thereby providing a more appropriate matching. By replacing rough classification unit 306 of Fig. 3 by point accumulating unit 106 and recognition result candidate output unit 107 as shown in Fig. 1 of the first principle of this invention, a still higher-speed recognition process can be executed. The explanation of the first embodiment The concrete explanation of the first embodiment based on the first and second principles described before is explained. The whole structure of the first embodiment Fig. 4 shows the whole structure of the first embodiment of the present invention. Manuscript 401 on which a type document is printed is read out by image input portion 403 within image scanner 402 (the solution is eight lines per millimeter) and thereafter is converted to binary image data expressed by a logic "1" or "0" in binary coding portion 404. Next, the binary image data is input to cutting-out portion 405. Respective types are cut out from the binary image data in units of 64 dots horizontally by 64 dots vertically, per character. The logic "1" or "0" of one-bit data expresses whether or not a pattern is represented by respective dots. Type image data 413 cut out in such a manner is input to preprocessing unit 406. A noise removing and smoothing process is applied to type image data 413 and then the size of the type image data is subjected to a normalization. Thereafter, the pattern is subjected to a thin-line process for obtaining the directional component of respective dots. This process is conducted for the data subjected to a thin-line process, thereby outputting thin-line character image data 414. Thin-line type image data 414 outputted from preprocessing unit 416 in accordance with the above processing is input to feature quantity extracting unit 407. Based on thin-line type image data 414, a type direction thin-line feature quantity 415 is calculated as a feature quantity of the type. Type direction original line feature quantity 415 is input sequentially to an associative matching recognition unit 409 within a recognition unit 408. A pattern matching is carried out in recognition unit 408 between a type direction line element feature quantity and a standard pattern for an associative matching stored in associative matching standard pattern dictionary unit 411, using an associative matching method. A type candidate of the original type image data 413 is recognized and output as a rough classification result 416. Further, the rough classification result 416 thus recognized is input to fine classification unit 410, in which fine classification dictionary unit 412 is referred to, based on the type candidate obtained as rough classification result 416. By using the fine classification dictionary unit 412 and the original type direction line element feature quantity 415, a fine classification is carried out and the final type recognition result is output as fine classification result 417. Explanation of an operation of the first embodiment The operation of the embodiment of the above structure is explained sequentially hereinafter. The following explanation will be made based on a flowchart of the whole operation of the first embodiment, shown in Fig. 5. Image input process The process for obtaining type image data 413 image input processing will be explained. In Fig. 4, manuscript 401 on which a type document is printed is read by image input unit 403. It is converted to binary image data in binary unit 404 (Fig. 5, S15). Further, in cutting out unit 405, the respective types are cut out from the binary image data in units of 64 dots horizontally by 64 dots vertically per character and is output as type image data 413 (Fig. 3 S16). An example of the type image data 413 is shown in Fig. 6, using a Chinese character ┌ ┘. In Fig. 6, the dots represented by "*" are expressed by logic "1" as a pattern portion. Noise removal, symbol classification judgement, and smoothing processing Type image data 413 cut out in the above process are input to preprocessing unit 406 in Fig.4 and subjected to a noise removal. Type image data 413 sometimes include a noise due to manuscript 401 itself and to poor reading accuracy of image scanner 402. The noise appears as a point of 1 to 2 dots which are isolated on the image. This adversely affects the following recognition process. Such noise can be removed by a logical process, such as a noise removing process (Fig. 5, S17). The type image data from which noise is removed is subjected to a judgement to determine the symbol they represent in preprocessing unit 406. As described later, the size of the type image data is normalized and is made to be a thin-line. When some character is subjected to a normalization or thin-line processing, the data of the original character is lost. A concrete example is shown in the following, Case 1 ○: A type which is not suitable for normalization and thin-line processing Example If a symbol as recited above is normalized and subjected to a thin-line processing, the original shape is lost. Case 2 ○: A character which is not suitable for a normalization Example If a type as stated above is normalized, the whole region becomes black. Case 3 ○: A type which is not suitable for thin-line processing. Example If a type as recited above is subjected to a thin-line processing, it will become a point or a short line. For the characters described above, ordinary normalization and thin-line processing described later is not conducted and other processing may be applied to them, resulting in a correct recognition and enabling the symbol to be judged after the noise removing process is conducted (Fig. 5,S-18). The judgment algorithm is described as follows. The character corresponding to case 1 ○ is several times smaller than the ordinary character and is determined based on the width of the smaller character. The horizontal and vertical dimensions of the type corresponding to case 2 ○ differ, and the type is judged based on the ratio of these dimensions. Finally, the types corresponding to case 3 ○ have the repetition frequency of the thin-lining processing (described hereinafter), which is several times more than the repetition frequency of the thin-line processing of the ordinary type, although the repetition frequency of the thin-line processing of an ordinary character corresponds to about one half the width of the line. It is determined in the later-described thin-line processing by providing an appropriate threshold value. After judgement of the above symbols, characters, etc., a smoothing process is applied to types which are not judged to be these symbols and characters. Irregular portions often occur on lines of type in addition to the noise with regard to the type image data 413. When manuscript 401 of Fig. 4 is printed by a dot printer, irregular portions appear on the manuscript 401 itself and the reading accuracy of image scanner 402 also constitutes one of the reasons. Such portion of the line adversely effects the following recognition practices and the smoothing is conducted in the processing unit 406 in Fig. 4. (Fig. 5, S19). More particularly, local masked processing (about 8 adjacent dots) detects a recess or projection of about 1 dot, and performs a process of filling the recessed portion or deleting the projecting portion. The process is a digital image processing and thus a detailed explanation is omitted. The result obtained after the above smoothing process is applied to type image data 413 in Fig. 6, is shown in Fig. 7. As shown in Fig. 7, a local recess and projection of the line, which is observed in Fig. 6, is smoothed. Normalization Process The type image data subjected to noise removal and smoothing is again subjected to normalization in preprocessing unit 406 in Fig. 4. The printed character (the character of the Japanese word processor) generally consists of a whole angular, double angular, of half-angular character, and the size of the character varies. Characters of the same angle differ in size depending on the design of the maker. The first embodiment performs a normalization of the input image data to remove the influence of the size of the type (Fig. 5, S20). A linear expansion and compression method is used for performing a normalization process. A linear expansion and compression is conducted to provide a size of 64 x 64 dots. The type is judged to be a case 1 ○ by the "previously recited process of judging a symbol, "and the type image data is linearly enlarged to provide a size of 20 x 20 dots. Then, the later-described thin-line process is not carried out, but is directly transmitted to the later-described line-element-forming unit. The vertical and horizontal dimensions of the character judged to be case 2 ○ is expanded in proportion to the respective dimensions of the characters. Fig. 8 shows an example in which a normalization process is applied to the type image data after the noise removal and smoothing shown in Fig. 7. Thin-line forming process The thin-line-forming process is applied to the type image data normalized as recited above, in preprocessing unit 406 of Fig. 4 (Fig. 5, S21). Thin-line-forming process means that the width of the line (pattern portion) is condensed to one dot to enable the pattern portion to be expressed by a single line. There are various prior arts of the method for forming a thin-line. In this embodiment, a logic mask of 3 x 3 dots is enabled to scan on the character image data and the dots on which the pattern exist are deleted with an interconnection relation of 8 adjacent dots surrounding a central dot of the observed mask. The symbols belonging to case 3 ○ of said "symbol judging process" are judged here as recited above. For the symbols judged to be case 3 ○ the process of forming a thin-line is immediately stopped and the later-described line-element-forming process is carried out in the status before the thin-line-forming is carried out. The example in which the thin-line-forming process is applied to the type image data after the normalization of Fig. 8, is shown in Fig. 9. Line-element forming process The line-element-forming process to be conducted before the later-described feature-quantity extraction is applied to the type image data which has been subjected to the thin-line formation, as shown in the first embodiment (Fig. 5, S22). Line-element-forming processing means that respecive dots of the thin-line forming pattern is expressed by a component in one direction selected from four direction components comprising 1 ○ horizontal component, 2 ○ vertical component, 3 ○ 45 degree component and 4 ○ 135 degree component. In order to extract a direction component, four logical masks of 2 x 1 dots corresponding to four directions are used as shown in Figs. 10A to 10D and are used corresponding to four directions. The mask scans every dot on the screen and it is determined whether two dots of respective masks are totally buried by the pattern (a bit of logic "1"). If the whole mask is buried by the pattern, the direction of the mask at this time is memorized as the direction component of the dot. The above algorithm is not useful for dots of an isolated point or multi-directional points, and the direction of the dots in these cases is determined by using a logic mask of 3 x 3 dots, and is based on which is the majority. For symbols judged to be case 1 ○ or case 3 ○ by said "symbol judgement process", the direction component of 135° is uniformly applied to all the pattern dot portions of type to be distinguished from the other types. The line element formed from one character of the type and obtained by the above process is output as line element character image data 414. Fig. 11 shows the embodiment for expressing, as an image, respective dots to which the direction component is assigned with regard to line element character image data 414. The dots are obtained by applying the above line-element-forming-process to the character image data after a thin-line-processing. Extraction process of a feature quantity of the character direction line element Line element character image data 414 output from preprocessing unit 406 of Fig. 4 is input to feature quantity extracting portion 407. Character direction line element feature quantity 415, constituting a fundamental of a recognition operation in this embodiment, is extracted. The operation in this embodiment corresponds to S23 of Fig. 5 and this portion is shown in more detail in the operation flowchart of Fig. 12. Line element character image data 414 of 64 x 64 dots output from the preprocessing unit 406 of Fig. 4 is input (Fig. 12, S32). Next, a location of a small region of 16 x 16 dots is determined on the data (Fig. 12, S33). First, line element character image data 414 of 64 x 64 dots is divided vertically and horizontally at intervals of 8 dots, as shown in Fig. 13A. A small region W, namely, a unit region comprising 16 x 16 dots, is considered. The small region W is moved vertically and horizontally at intervals of 8 dots, namely, by overlapping the small region by half a mask, thereby producing seven vertical or horizontal small regions, as shown in Fig.13A. Finally, for line element character image data 414 of 64 x 64 dots, 7 x 7 =49 position designations of the small regions W can be designated. The designation of the position of these 49 small regions is shifted rightward at intervals of 8 dots starting from the upper left portion of Fig. 13A, and is returned leftward when it reaches the right side. The 8 dots are then moved downward, thereby designating a location of the small region W. This process is repeated from S35 to S33, as shown in Fig. 12. When the location of the small region W is determined by the above process, the direction component of the dots subjected to a line element formation in the above recited line element forming process is accumulated by providing a weight for respective direction components (Fig. 12 , S34). As shown in Fig. 13B, in a small region W of 16 x 16 dots, a weight 4 is assigned to a region I surrounded by a frame of 4 x 4 dots at the center, a weight 3 is assigned to a region II surrounded by the region I and a frame of 8 x 8 dots around the region I, a weight 2 is assigned to the region III surrounded by the region II and a frame of 12 x 12 dots around the region II, and a weight 1 is assigned to the uppermost outside circle and provided outside the region III. In the process S 33 in Fig. 12, the number of dots to which the direction component is assigend in a small region W comprising 16 x 16 dots and the position of 64 x 64 dots which is determined in line element image data 414 is accumulated for respective directional components. The corresponding weight is multiplied for an accumulation depending on the region in which respective dots are located. Namely, the value of the dot to which a direction component is assigned is determined to be "1" with regard to a direct region in which the dot exists, thereby providing the product which is accumulated for respective dots. As an example of a calculation of the above process, line element (dots) A to D having four direction components, vertical, horizontal, 45-degree and 135-degree, are provided in the small region W as shown in Fig. 14. In the drawing, line element A, which has a vertical direction component, includes four dots in regions I, II, III and IV. Thus, the accumulative weight is 4 × 4 + 3 × 4 + 2 × 4 + 1 × 4 = 4 0 A line element B, which has a horizontal direction component, comprises three dots in region II (weight 3) and a dot in region III (weight 2). Thus, the accumulative weight is 3 × 3 + 1 × 2 = 1 1 Further, a line element C, which has a 45-degree direction component, has one dot in region II (weight 3), four dots in region III (weight 2) and three dots in region IV (weight 1). Therefore, the accumulative weight is 3 × 1 + 2 × 4 + 1 × 3 = 1 4 Line element D, which has a 135-degree direction component, has one dot in region III (weight 2) and two dots in region IV (weight 1). Therefore, the accumulative weight is 2 × 1 + 1 × 2 = 4 The accumulative weights in the four direction components: vertical, horizontal, 45-degree and 135-degree, are assigned to four valuable numbers V1,V2, V3 and V4 and the vector shown by (V1, V2, V3, V4) is defined as a partial feature vector in the present small region position. Namely, a partial feature vector in the above embodiment (Fig. 14) are (40, 11, 14, 4) according to equations (1) to (4). Therefore, a partial feature vector of four dimensions can be obtained for a single small region position. The process of obtaining partial feature vectors of four dimensions is carried out for respective positions determined by shifting a small region W of 16 x 16 dots at intervals of 8 dots (Fig. 12, S35 S33). A possible number of positions of a small region can be designated in line element type image data 414 of 64 x 64 dots. When a process of 49 small regions is completed, a feature vector of 4 x 49 = 196 dimensions can be obtained. A partial feature vector of four successive dimensions precisely corresponds to a position of 49 small regions. A feature vector of 196 dimensions is outputted from feature quantity extraction unit 407 in Fig. 4 as type directional line element feature quantity 415 corresponding to type image data 413 of Fig. 4, and a process of extracting a type direction line element feature quantity is completed (Fig. 12, S35 → S36). Feature of a method for extracting the type direction line element feature quantity An advantage of a method of extracting a feature quantity of the type direction line element, shown as the processes from S15 to S23 in Fig. 5, is briefly summarized. A normalization and a thin-line formation in the preprocessing step avoids the influence of the size of the type pattern and the thickness of the line. As the type pattern is treated as a line, it is not limited to characters. Next, a line element of the type image data subjected to a thin-line formation is prepared in four directions. This enables the structure of the pattern to be normalized, thus facilitating stable extraction of the feature quantity in the following stage. 49 pairs of partial feature vectors each comprising four dimensions expresses a partial feature, namely, partial information about 49 parts corresponding to respective positions of small regions in the type pattern represented by type image data 413 of Fig. 4. The 49 pairs of partial feature vectors are formed from the feature vectors of 196 dimensions obtained as type direction line element feature quantity 415. Therefore, in the Chinese character pattern, data corresponding to a partial pattern comprising a component of the Chinese character can be obtained without requiring a recognition of these patterns and without using a complicated algorithm. In this case, by using a weighted small region W, the position and direction of a line is clearly reflected by the type direction line element feature quantity 415. The weight is made light for a line near a boundary of the small region W and the contribution ratio of the boundary of the small region in extracting the partial feature vector at the position of the small region is made lower. Thus, an appropriate process for a stable line having a high possibility of entering into an adjacent small region position can be conducted. Namely, a line positioned near the boundary of the small region W is possibly not included in the small region W even if its position is shifted slightly in accordance with the status of the image input. Therefore, if the partial feature vector is calculated by adding the same weight to the line near the boundary as that of the line at the center of the small region, the partial feature vector changes greatly depending on whether or not the line near the boundary is included in the small region W. Therefore, by adding a smaller weight to the line near the boundary, the feature vector cannot be changed greatly whether or not the line near the boundary is included in the small region W when the input image is shifted to some extent. Thus, it becomes possible to extract the partial feature vector in a stable manner. By overlapping a half portion of a small region with a half portion of its adjacent small region the line located near the boundary of the adjacent small region can be moved to the center of the present small region. Therefore, the line provided at the center of the small region can produce an appropriate partial feature vector. As described above, type direction line element feature quantity 215 can be stably extracted by using a weight which is similar to that of any type pattern. For example, a complicated Japanese pattern having many short strokes can be adequately processed. By paying attention to a partial feature vector at an appropriate small region position, partial information of only a portion of the type can be extracted, thereby facilitating a fine classification recognition processing. This is recited later. Associative matching standard pattern forming process A process for recognizing type image data 413 (Fig. 4) using an associative matching method based on the type direction line element feature quantity 415 obtained as recited above will be explained as follows. When a recognition process is conducted using the later-described associative-matching method, it is necessary to register the associative-matching standard pattern in associative-matching standard-pattern dictionary 411 shown in Fig. 4. Before the process for recognizing type image data 413 (Fig. 4) this method is explained, the process of forming the standard pattern is explained. This process is shown in the operation flowchart in Fig. 15. For all the characters, namely, about 3003 characters of type image data 413 of Japanese, the type direction line element feature quantity is obtained by a process similar to that of the type direction line element feature quantity extraction (Fig. 15, S37). Suppose that the number of the kinds of character is N and the type direction line element feature quantities of various characters, namely, the feature vectors of 196 dimensions, is expressed as X i (i=1 to N), and respective X i are composed of 49 pairs of partial feature vectors X (m) / i (m=1 to 49), each pair corresponding to 49 positions of respective small regions and comprising four dimensions as explained in Fig. 13A. The meaning of respective dimensions has been explained already. The process of forming a standard pattern which should be conducted later is as follows. The feature vectors X i (i=1 to N) of all the characters are subjected to a clustering process with regard to respective positions of the small region, and are classified into the following L classes (normally, about 20). C (m) 1 , C (m) 2 , · · · , C (m) L ( m=1∼49 ) With regard to the positions of respective small regions, the representative vectors, X (m) / i of four dimensions are calculated from the respective classes, as follows. x (m) i = E ( x (m) ) , x (m) ∈ C (m) i ( i=1∼L , m=1 ∼49 ) Representative vectors X (m) / i obtained by calculating (the process shown by E(X (m) ) in the above) the average vector of the partial feature vectors X (m) corresponding to the characters included in the resepective classes of the respective small region positions and the representative vetors X (m) / i is deemed a standard pattern. The algorithm for conducting the above process is described as follows. (a) First, a position m of a small region of 16 x 16 dots as explained in Fig. 13A is determined (Fig. 15 S38). (b) The partial feature vectors X (m) / i (i=1 to N) of four dimensions of all the characters corresponding to the small region position m are clustered and classified into L classes C (m) / i (i=1 to L) by using a clustering algorithm of the furthest neighbour algorithm shown in the following 1 ○ to 3 ○. 1 C (m) i = { x (m) i } , ( i=1 ∼N) count=N These are classified into N classes as initial values and each class is composed of a partial feature vector X (m) / i The count means a variable number representing the number of divided classes and clustering is completed when a count equal to L is achieved, as described later. 2 ○ Find C (m) / i', C (m) / i' satisfying the following equqtion. Where d ( C (m) i , C (m) j ) = m a x { ∥ x (m) p - x (m) q ∥ } ( x (m) p ∈ C (m) i , x (m) q ∈ C (m) j ) Here,∥X (m) / p - X (m) / q ∥ represents the distance between two vectors X (m) / p and X (m) / q and is calculated as the sum of the euclidean distance of the four-dimensional feature vector. Namely, where X (m) / p,k and X (m) / q,k represent an element of respective dimensions of the respective partial feature vectors X (m) / p and X (m) / q. 3 ○. C (m)' / i, C (m)' / j is combined. Namely, C (m)' i = C (m)' i + C (m)' j where "+" denots to take a union of two sets C (m) / i' and C (m) / j'. 4 ○. count = count -1 5 ○. If the count is not equal to L, 2 ○ to 4 ○ is repeated and if the count is equal to L, the clustering process is completed. The partial feature vector X (m) / i (i=1 to N) of four dimensions of the N characters corresponding to the present small region position m is classified into L classes (Fig. 15, S 39) by the above recited clustering algorithm. (c) The representative vector X (m) / i of L classes corresponding to the position m of the small region as described above is calculated (Fig. 15 S40). This is calculated as an average of the partial feature vector X (m) of four dimensions corresponding to the characters included in respective classes C (m) / i (i=1 to L) as shown by equation (5), and the number of dimensions is naturally four. (d) When the above process is completed, a dictionary is formed by forming a table for codes or labels which represent the kinds of respective characters included in respective classes C (m) / i ( i=1 to L), (Fig. 15, S41). The above process comprising steps (a) to (d) is applied to respective positions m (m=1 to 49) of 49 small regions (Fig. 15 S42 → S38). Fig. 16 shows an example in which the character of N=3003 is subjected to a clustering comprising classes of L=20 for respective small region positions (the number of small regions) by the associative matching standard-pattern forming process and the example of the representative vector of the respective classes. The embodiment is briefly shown with regard to the small region number 1. As has been explained, in the present embodiment, the feature vector of 196 dimensions obtained as the type direction line element feature quantity is divided into partial feature vectors of four dimensions corresponding to the respective positions of 49 small regions. The respective partial feature vectors are independently classified in the same class. One representative vector represents one respective class. As explained in the paragraph of "feature of type direction line element feature quantity extraction method", 49 pairs of partial feature vectors of four dimensions represent 49 partial features corresponding to respective small region positions of the type pattern represented by the character image data 413 of Fig. 4, namely, the partial information. Therefore, in the Chinese character pattern, for the small region number 1 in Fig. 16, characters in which the partial patterns such as "hen" and "tsukuri" comprising a Chinese character in the upper left corner of 3003 type image data are similar, are classified into the same class. In respective positions of the small region, one character is always classified into one class and the class in which one kind of character is entered may differ depending on the respective small regions. The above method finally corresponding to the method of extracting partial patterns such as "hen" and "tsukuri" in Chinese characters in Japanese, necessiates various kinds of algorithm depending on the form of "hen" and "tsukuri". In contrast, the present method is characterized in that it does not depend on the kind of the character and does not require a complex algorithm. The feature of the partial pattern can be formed into a dictionary without recognizing the partial pattern, namely, without recognizing the name of "hen" or "tsukuri" and in an extremely simple and mechanical manner. Associative matching recognition process The type-direction line-element feature quantity 415 corresponding to the characteristic image data 413 of Fig. 4 obtained by processes S15 to S23 in Fig. 5 is pattern-matched with the associative matching standard pattern previously stored in the associative matching standard-pattern dictionary unit 411 by the above-recited associative-matching standard pattern forming process. This enables a recognition of the type image data 413. In this case, the first embodiment is characterized by the recognition process by the associative matching method as explained later. The algorithm is realized by processes S24 to S27 in Fig. 5. These processes are explained hereinafter. (e) A position m of a small region of 16 x 16 dots explained in Fig. 13A is determined. The partial feature vector of four dimensions is determined as y (m) corresponding to said position m of a small region, and selected from among the feature vectors of 196 dimensions which are type direction line element feature quantity 415 corresponding to the unknown input and obtained by the process S23 in Fig. 5. The distance D (m) / i between the partial feature vector y (m) and each one of L representative vectors X (m) / i in each class of the associative matching standard pattern registered with corresponding to the position m of the small region associative matching standard pattern dictionary 411 in Fig. 4 are calculated and the matching is obtained (Fig. 5, S24), namely, D (m) i = ∥ y (m) - x (m) i ∥ ( i=1∼L ) where ∥ y (m) - x (m) i ∥ represents the distance between the partial feature vector y (m) of the unknown input and the representative vector X (m) / i, and is caluculated as the sum of the euclidean distance between y (m) and X (m) / i. Namely, where y (m) / k and X (m) / i,k represent elements of y (m) and X (m) / q respectively. (f) The classes in which the smaller upper α distances D (m) / i become D (m) i1 ≦ D (m) i2 ≦ · · · ≦ D (m) i α are extracted. At this stage, D (m) / i1 is the smallest distance among D (m) / i (i=1 to L), D (m) / i2 is the second smallest distance and D (m) / 1α is the α th smallest distance. The points are given only to the characters of the upper α classes C (m) / in (n=1 to α) (Fig. 5, S25) namely, the point P(X (m) ) corresponding to the character whose partial feature vector X (m) belongs to C (m) / in is calculated as P ( x (m) ) = α - n + 1 ( n=1∼ α) and is accumulated on the memory area for accumulating the point of the character. The memory region is provided within the associative matching recognition unit 409 in Fig. 4, the point is not given to the character belonging to classes less than the αth. (g) Processes described in (e) and (f) are conducted for the position m (m=1 to 49) of 49 respective small regions (in Fig. 5, S26 → S24). (h) When the processes described in (e) and (f) for the position of the 49 small regions are completed, the character code is output as the candidates of the recognition result are arranged in order, starting with a character with a high number of points thereby providing the rough classification result 416 in Fig. 4 (Fig. 5, S27). Fig. 17 shows a method of calculating the distance when the dictionary is subjected to L = 20 classes as a clustering with regard to each of the 49 positions of the small region (the number of the small region) in the associative matching standard pattern dictionary. As is clear from the drawing, the first embodiment method need not calculate the distance of the respective character kinds and may have only to calculate the distance of the representative vector X (m) / i of respective classes at every position of the respective small regions. As shown in Fig. 18, a point is given to the class having a small distance in every small region based on equations (8) and (9) when the unknown input is a ┌ ┘ of a Chinese character in Japanese. In this case, at every position of the small region, the point is given to the upper five classes, namely, α =5. Therefore, for the point P(X (m) ) given by equation (9), five points are given to a class of n equal to the first grade, namely n=1, four points are given to a class of the second grade, namely n=2, and three, two and one points are respectively given to the lower classes. The high points (5 or 4 points) are generally given to numbers 1 to 49 of the small regions included in the class in which the Chinese character ┌ ┘ is included. Therefore, as the final point of the accumulation result, the point of the Chinese character ┌ ┘ becomes the highest and is output as the first candidate of the rough classification result 416 from associative matching recognition unit 409 in Fig. 4. Review of the calculation amount of the associative matching recognition process The amount of calculation in the prior art recognition method is compared with that in the associative matching recognition method in the first embodiment. The prior art is stated in the background technology, namely, all checking methods for performing a recognition based on the distance obtained by calculating the distance between the standard pattern of the feature vector X i (i=1 to 3003) of 196 dimensions regarding 3003 characters and the feature vector y of the unknown input of 196 dimensions. The distance calculation equation of this instance is y k and X i,k represents an element of respective dimensions of the feature vector y and X i . The number of calculations required for an arithmetic operation of equation (9) for a feature vector is 196 in both subtraction and multiplication operations, and it is 195 in the addition operation. Supposing that the number of calculations required for the addition operation is the same as that required for the subtraction operation and that one multiplication operation is equivalent to two addition operations and the total number of calculations required to perform a calculation of the 3003 characters is converted to the equivalent number of addition operations, as follows. (196 + 196 × 2 + 195) × 3003 = 2351349 The number of calculations required to perform an associative recognition in the first embodiment may be calculated based on equations (6) to (8). Namely, in equations (6) and (7), the number of calculations required to calculate the distance between the feature vector y (m) of the unknown input and one representative vector X (m) / i is four times that required for the subtraction and the multiplication, and three times that required for the addition in equations (6) and (7). As in the previous case the number of calculations required for the addition is the same as that required for the subtraction, and the number of calculations required for one multiplication corresponds to that required for two additions when the above calculation is conducted for a single position of the small region, and supposing the class number L=20, (4 + 4 × 2 + 3) × 20 = 300 is established. To form the calculation sequence of the upper α digits of equation (8) in respective small region position, supposing α = 5 and L=20 classes, 5 × 20 = 100 subtractions (amplitude comparison calculation ) are necessary. Further, the number of calculations in which the points previously calculated according to equation (9) are accumulated on the character belonging to respective classes C (m) / in (n=1-α) of the upper number is as shown in the following equation. 1 × 110 × 5 = 550 Supposing that the addition is conducted once per character, the class number α=5 and the average number of characters per class is 110. The amount of calculation necessary to determine the position of one small region is 950 from the equations (12), (13) and (14). Therefore, the number of calculations of the whole position of the 49 small region is (15). 950 × 49 = 46550 Next, the second prior art recognition method which is intermediate between the first prior art recognition method and the recognition method of the present invention is explained. This method is similar to the present recognition method in that the distance calculation between the representative vector X (m) / i of respective classes and the feature vector y (m) of the unknown input with regard to the position of the small regions is conducted. Thereafter, the distance between the representative vectors of the classes in which one character kind is included and the feature vector y (m) of the unknown input is referred to from the result of the distance calculation with respect to respective positions of the small regions. Accumulation can be conducted for all positions of the 49 small regions and the total distance is calculated for one character. This process is repeated for all the characters, namely, the 3003 characters, and produces a recognition result candidate in accordance with the smaller distance. In this method the initial distance calculation is similar to that of equations (6) and (7) and the number of calculations is the same as that of equation (12). The number of calculations of the total distance per character is an accumulation of the 49 small region positions and the addition is conducted 49 times. Therefore, the number of calculation for all of the 3003 characters becomes as follows, considering equation (12). 49 × 3003 = 147147 The total number of calculations becomes the sum of the results of equations (16) and (12). 300 + 147147 = 147447 Based on the above test result, the number of calculations required by the first embodiment is about 1/50 that required by the prior art. A simple calculation for comparing the first embodiment with the first prior art method through all checking methods can be obtained within 1/50 the number of calculations. Even if an increase in calculation time caused by the complicated memory access and the judgement of the condition becomes complicated, thereby increasing the calculation time, a large number of calculations is deleted. When compared with the second prior art method, 1/3 of the calculations are sufficient from equations (11) and (17). The second prior art method is the same as that of the present embodiment in that a dictionary is formed by classifying the position of respective small regions. The total distance was calculated in the prior art for all the characters. In this embodiment, a point is given to the character of the upper classes in which the distance is small, thereby providing a final recognition result candidate and also enabling the number of calcuations to be reduced. A review of the recognition capability of the associative matching recognition process In the method of this embodiment, the feature vector is classified for respective positions of the small regions and is replaced by respective representative vectors. Thus, the amount of information for recognition is decreased as compared with that in the first prior art method, using all checking methods. In the recognition experiments using various kinds of word processor printing characters having 3003 characters including the first 2965 standard characters of the JIS, (Japan Industry Standard), the number of classes L of 49 positions of the small region is 20 to 30 (as should be referred to by item of "associative matching standard pattern forming process"). When α=5 (as is referred to "associative matching recognition process") a recognition ratio in the first grade of more than 99% (the ratio at which the recognition result candidate of the highest point is obtained as the rough classification result 216 in Fig. 4) can be obtained and a recognition ratio similar to those of all the checking methods can be obtained. The method of the present invention greatly reduces the number of calculations while maintaining a recognition ratio similar to that of the prior art. Fine classification process An associative matching process is used to output a rough classification result 416 from associative matching recognition unit 409 in Fig. 4 as a candidate of the recognition result, such as the first candidate, the second candidate, etc., in accordance with the order of the character in which a high point is accumulated as a result of the associative matching. Therefore, the possibility that an objective recognition result is included in the rough classification result 416 of the upper 5th to 10th grades selected from among thousands of characters becomes almost one hundred percent. Based on the rough classification result 416 of the upper 5th to 10th grades obtained as recited above, a detailed matching is conducted between the partial information of respective recognition result candidates and the detailed matching, a precise fine classification process ordering similar character candidate is conducted. In the present embodiment, to analyze the above partial information, the partial feature vectors of four dimensions in the predetermined position of the small region are compared and, selected from among type direction line element feature quantity 415 obtained from the feature quantity extracting portion 407 in Fig. 4. As explained in the item "feature of method of extracting the type direction line element feature quantity", 49 pairs of feature vectors of four dimensions in the feature vector of 196 dimensions obtained as type direction line element feature quantity 415 represents 49 partial features of the position of small regions of the type pattern represented by type image data 413 in Fig. 4, namely, the partial information. In character candidates such as ┌ ┘ or ┌ ┘ in Japanese, which are easily mistaken, attention is paid to the position of the small region where error recognition easily occurs and a comparison is conducted between the partial feature vectors corresponding to the position of the small region, thereby facilitating the analysis of the partial information. As a concrete process, easily mistaken characters constitute respective groups and are made into a table such as a fine classification table. For example, as shown in Fig. 19, other easily mistaken relational characters are registered with regard to respective characters of the first standard Chinese character selected from among 2965 characters as shown in Fig. 19. In this case shown by "null" in Fig. 19, the relational character sometimes does not exist and in this case a fine classification recognition process is not conducted. To simultaneously recognize the respective characters, flag "1" designates which portion of the small region is used out of the number 1 to 49 small region as the partial feature vector. The number of small regions to be used is determined as being the same within respective groups in which a character is registered as a relation character. For example, refer to the table ┌ ┘ and ┌ ┘ as shown in Fig. 19. The position of the small region represented by flag "0" means that it is not used as a fine classification of the character candidate. A fine classification table previously obtained as recited above is registered in a fine classification dictionary unit 412 of Fig. 4. A standard partial feature vector of the position of the small region to which a flag "1" is assigned in the fine classification table of Fig. 19 with respect to respective characters, is registered in a fine classification dictionary unit 412 as a fine classification dictionary. Fine classification unit 410 in Fig.4 executes the following fine classification process by using the above fine classification table and fine classification dictionary. For respective recognition result candidates obtained as the rough classification result 416 of the upper 10 ranks outputted from associative matching recognition unit 409 of Fig. 4, a fine classification table registered in fine classification dictionary unit 412 in Fig. 4 is referred to. It is searched or detected whether or not a character similar to the candidate character is included as a candidate character of the order (for example, rank 1 or 3) continued on the order (rank 2) of the candidate character within the rough classification result 416 and it is judged whether or not a fine classification process, namely, a partial matching, is necessary (Fig. 5, S28 → S29). Where a relational character of the candidate character does not exist (in the case of "null" in Fig.19) or a relational character concerning the candidate is not included as a candidate character having a rank following the candidate character within the rough classification result 416, the fine classification process is not necessary. In addition, the rough classification result 416 can be output as the fine classification result 417 of Fig.4. It is deemed to be the final recognition result (Fig.5,S29 →S31). On the other hand, where a relational character of a candidate character is included as a candidate character having the rank following that of the candidate character in the rough classification result 416, partial matching can be carried out using the following algorithm (Fig. 5 S29 →S30). 1 ○. First, the fine classification table is referred to and the position of the small region coresponding to the candidate character is detected. 2 ○. Next, a partial feature vector corresponding to a position of a small region detected by 1 is extracted from the type direction line element feature quantity 415. This quantity is input corresponding to the rough classification result 416 previously obtained from feature quantity extracting unit 407 of Fig. 2. 3 ○. The distance between the partial feature vector extracted in 2 ○ and the partial feature vector in the fine classification dictionary corresponding to the candidate character and the relational character is calculated. The order of the candidate character and the relational character is changed in accordance with the smaller distance. The recognition result candidate with the new rank obtained by the partial matching process from 1 ○ to 3 ○ is finally output as the fine classification result 417 of Fig.4 (Fig. 5, S30 → S31). Candidate characters other than the above candidate character and that corresponding to the similar character which are selected from the rough classification result 416 are outputted as the fine classification result 417 in the same recognition order as in the rough classification recognition. The character candidate which is easily miss recognized, is selected from the recognition result candidate obtained as the rough classification result 416 by the fine classification process can precisely determine the recognition order. Therefore, the final recognition ratio can be further increased. Other mode of the first embodiment The above embodiment applies the associative matching recognition method based on the first principle of the present invention to character image data recognition. The character direction line element feature quantity obtained from the character image data is used for the feature quantity for recognition, and the fine classification is combined therewith. It is possible to apply the present invention to the recognition using various feature quantities of the type image data such as stroke information, as well as the above type direction line element feature quantity. It is not limited to recognition of character image data but is applied to word recognition based on the second principle. In this case, for example, the speech spectrum envelope parameter (cepstrum coefficient) of every frame at respective timings of the word pattern may be used as respective feature quantities of a plurality of regions and may be applied to associative matching recognition according to the present invention. The dictionary used in this case may store a feature quantity of a plurality of word patterns. This invention may be applied to various other input pattern recognition methods. A spectrum envelope pattern of a speech frequency may be changed to an image to provide an input pattern, thereby enabling a feature quantity similar to the type direction line element feature quantity explained by referring to Figs. 10 to 14, thereby enabling the speech to be recognized. Explanation of the second embodiment The second concrete embodiment is explained based on the third principle of the invention. Whole structure of the second embodiment Fig. 20 shows the complete structure of the second embodiment. Input speech 2009 is first input to preprocessing unit 2001 and respective processes (described later) such as cut-out of a word period, normalization, or speech analysis are carried out, thereby outputting feature vector time sequence pattern 2010 which is subjected to a linear normalization. Feature vector time sequence pattern 2010 is inputted to the partial pattern extraction unit 2002, thereby providing the partial pattern 2011. Partial pattern 2011 is inputted sequentially to table of distance between partial patterns calculating unit 2003, in which the distance between the input and respective standard partial patterns stored in the standard partial pattern dictionary unit 2004 is calculated, thereby forming table 2012 of distance between partial patterns. Table 2012 of distance between partial patterns 2012 is input to a rough classification unit 2005 in which the distances of respective words are calculated based on the table of distance between partial patterns 2012 by referring to word dictionary unit 2006. The word recognition is then executed based on the calculation result, thereby providing a rough classification word candidate 2013. A rough classification word candidate 2013 is inputt to a fine classification unit 2007. The fine classification unit 2007 again receives the input speech 2009 and performs a fine classification. At this stage, within-word vowel sequence dictionary unit 2008 is referred to and a fine classification is conducted. As a result, a final fine classification word candidate 2014 is obtained. Operation of this embodiment The operation of this embodiment is explained hereinafter. Operation of the preprocessing unit The operation of preprocessing unit 2001 of Fig. 20 is explained. Fig. 21 shows an operational flowchart of preprocessing unit 2001 and the explanation is made by referring to it. Input voice 2009 is conducted to a low pass filter (LPF) of 9kHz and 60dB/oct (S43). It is sequentially A/D-converted to a digital audio signal with a sampling frequency of 24kHz and a quantizing accuracy of 12 bits including a sign(S44). Next, the signal's change in power with time is calculated and a constant threshold value 2202 is determined for power pattern 2201 obtained as shown in Fig. 22. Then word period 2203, as shown in Fig. 22, is automatically cut out (S45). Next, the word period cut out as stated above is subjected to a linear normalization to provide 48 frames in the direction of time (S46). The frame indicates the basic time unit for use in speech analysis which will be explained later. One frame indicates 21.3 msec. Speech analysis is conducted every frame (loop of S47→S51→S47). The digital speech signal subjected to linear normalization as stated above, is analyzed starting with its head. The speech signal is multiplied by a Hamming Window with a time length of 21.3 msec (512 points), thereby enabling the digital speech signals of respective frames to be cut out (S47). The signals of respective frames (cut out as recited above) are subjected to a FFT (high speed fourier transform) of 512 points and are converted to a power spectrum (S48). The obtained power spectrum of 512 points is subjected to a division and integration by a band pass filter (BPF)of 50 channels having an equal interval in a mel scale and a frequency axis is converted to a mel measurement (S49). A cepstrum coefficient (x1' , x2',.....x10') of up to 10 dimensions is obtained by a cepstrum analysis (S50). However, the obtained cepstrum coefficient is normalized in accordance with the following equation. The above process is repeated for all the 48 frames of a single word period (S51→ S47). The cepstsrum coefficient normalized by the above equation (18) for 48 frames is outputted from preprocessing unit 2001 of Fig. 20 as the feature vector. Standard partial pattern,word dictionary forming process In the above embodiment a word recognition is conducted using a feature vector obtained as recited above. Where the later described word recognition is conducted, it is necessary to previously register respective standard partial patterns and a word dictionary, in the standard partial pattern dictionary unit 2004, and in the word dictionary unit 2006 as shown in Fig. 20. Before the word recognition process, a process for forming the standard partial pattern and word dictionary will be explaind. The learning pattern of input word 2009 is processed by preprocessing unit 2001 and the time sequence pattern of the feature vector of the word W* subjected to a linear normalization of n frames (n=48 frames in the above explanation) in the time direction is expressed as W k = ( X k1 , X k2 , · · · , X kn ) k=1,2, · · · , N Fig. 23 should be referred to, wherein N represents the kind of word, X k,t (t=1,2,...n) is the feature vector (comprising cepstrum coefficients of 1st - 10th dimensions) of the t th frame in a time direction of the word W k . Next, the time sequence pattern of the feature vector of Fig. 19 is input to partial pattern extraction unit 2002 of Fig. 20 and a mask ψm(m=1 to M) is applied to the feature vector time sequence pattern of the word W k as shown by the slanted line in Fig. 24 and partial pattern W (m) / k is extracted. Namely, w (m) k = Ψ m ( W k ) The following arithmetic operation will be carried out as (20). A collection of partial patterns obtained by performing the arithmetic operation of equation (20) of respective vector time sequence patterns of N kinds of word W1, W2,...,W N is expressed as { w (m) 1 , w (m) 2 , · · · , w (m) N } m=1,2, · · · , M By paying attention to a portion pattern W (m) / k corresponding to a mask ψ m among a collection of partial patterns expressed by equation (21), N kinds of words W 1 , W 2 , ..., W N are classified into T classes C (m) / i (i=1 to T<N). This classification is conducted by a sequence using a clustering algorithm according to the furthest neighbour algorithm. C (m) / i represents the i th class of the partial pattern corresponding to the mask Ψ m . 1 C (m) i = { w (m) i } , (i=1,2, · · · , N) count=N Namely, here they are classified into N classes as an initial state and respective classes comprise a partial pattern W (m) / i, count means variable number representing the number of the class division and upon count=T, the clustering operation is ended. 2 ○ Find C (m) / i', C (m) / j' satisfying the following equation where wherein, W (m) / pt and W (m) / qt represent a feature vector of the t th frame in the time direction within respective partial patterns W (m) / p, W (m) / q and d(W (m) / p, W (m) / q) defined by the above equation shows the euclidean distance of the partial patterns W (m) / p and W (m) / q. 3 ○ C (m) / i', and C (m) / j' are integrated to provide a single class. 4 count= count -1 5 ○ if the count is not equal to T, steps 2 ○ to 4 ○ are repeated and if the count is equal to T, the clustering process is completed. The above clustering algorithm classifies respective partial patterns W (m) , (K=1 to N) of N words W 1 , W 2 ...WN corresponding to a single mask ψ m into T classes C (m) / i, (i= 1 to T). Next, the standard partial pattern W (m) / i (i= 1 to T) of T classes corresponding to a mask ψ m obtained as recited above is calculated. The process calculates the average value of the partial pattern included in the class with regard to respective classes C (m) / i (i=1 to T). The partial pattern corresponding to the mask ψ m of the word included in respective classes is represented by the standard partial pattern of the class included in the partial pattern. The clustering process and the standard partial pattern forming process are shown in Fig. 25 as an example of the mask ψ 1 . The above process is conducted for respective masks ψ 1 to ψ M of N kinds of word speech W 1 , W 2 ...W N , and independently classified into T classes from respective masks. The standard partial pattern w (m) / i (i=1 to T), (m=1 to M) calculated together with the above classifications is stored in standard partial pattern dictionary unit 2004 in Fig. 20. Next, it is stored in word dictionary unit 2006 in Fig. 20 which classes N words W 1 , W 2 ...W N into among T classes for respective masks ψ 1 to ψ M by the above clustering process. An example of a word dictionary is shown in Fig. 26. The class number in respective masks ψ 1 to ψ M is stored for N words W 1 , W 2 ...W N . Respective words W 1 , W 2 ...W N can be expressed by the collection of standard partial patterns of the class included in respective masks ψ 1 to ψ M for all the masks. Rough classification process A rough classification process for input speech 2009 is conducted based on the standard partial pattern and word dictionary formed as recited above. The feature vector time sequence pattern 2010 of the unknown input word is calculated by preprocessing unit 2001 of Fig. 20 in a similar manner to the case of the process of forming the standard partial pattern. Then, the output of preprocessing unit 2001 is divided into partial patterns by partial pattern extracting unit 2002 (Figs. 23 and 24 should be referred to). The unknown input word is expressed as W and and the distance D (W and, W k ) between W and and the dictionary word W k is defined by the following equation. wherein, d (m) c (k, m) = d ( w (m) c (k, m) , w (m) ) w (m) = Ψ m ( W ) and wherein c(k, m) is the number of the class to which W k belongs and w (m) / c(k,m) is the standard partial pattern representing the class in respective masks ψ m . Therefore d (m) / c(k,m) is the distance between the standard partial pattern w (m) / c(k,m) and the partial pattern w (m) of the unknown input word W and (in accordance with the equation (22)) and thus the distance between the unknown input word W and and the dictionary word W k , which is defined by equation (23), is obtained as the sum of the distances between the partial pattern of the unknown input word and the standard partial pattern of the dictionary word in all the masks ψ 1 to ψ M . An example of the process for calculating the distance between the unknown input word W and and the dictionary W 1 is shown in Fig. 27. The distance calculation can be conducted with regard to all the dictionary words W 1 to W N in Fig. 20 in the rough classification in this embodiment. In this case, it is not necessasry to calculate the distance between the input pattern and the standard partial pattern of the class to which the dictionary word belongs, for respective dictionary words, because a plurality of dictionary words is included in one class. Therefore, before the distances between respective dictionary words are calculated, the distance d (m) / i (i=1 to T) between the partial pattern W and (m) of the unknown input word W and and the standard partial pattern W (m) / i of respective classes C (m) / i stored in the standard partial pattern dictionary unit 2004 is obtained with every one of the respective masks ψ m (m=1 to M), thereby producing a table 2012 of distance between partial patterns as shown in Fig. 28. Based on the table 2012 of distance between partial patterns obtained by the above process, the rough classification unit 2005 of Fig. 20 calculates the distance between the unknown input word W and and all the dictionary words W 1 to W N as follows. When the distance between the unknown input word W and and the predetermined dictionary word W k is calculated based on equations (23) to (25), the distance d (m) / c(k,m) between the standard partial pattern W (m) / c(k,m)of the class to which W k belongs and the partial pattern W and (m) of the unknown input word W and always exists in the table 2012 of distance between partial patterns and the calculation of equation (23) may be conducted merely by extracting the value from the distance. The above process is conducted for all the dictionary words W 1 to W N . As a result the dictionary word which is ranked in a higher order owing to the small between-words distance, is outputted as a rough classification word candidate 2013 in Fig. 20. Review of the capability of recognition of the rough classification process In the rough classification processes described above the number M of the masks ψ 1 to ψ M is 12 to 16 (the mask length is 3 to 4 frames), the number T of the classes is 25 and the kind N of the words to be recognized is 212. For the feature vector, the time sequence pattern 2010 is subjected to a linear normalization to provide a time sequence of 48 frames outputted from preprocessing unit 2001 of Fig. 20 and then 10th-ranked recognition ratio (i.e. the ratio in which the rough classification word candidate 2013 (Fig. 20) up to 10th-rank is correct) is 99.6 %. Thus, a high classification ratio is provided. The recognition ratio is similar to that of the pattern matching method of the first prior art and the DP matching method of the second prior art recited in the item of the background technology, as it relates to the 10th-ranked recognition ratio. For the rough classification methods in the second embodiment, the number of the matchings per mask is not the number N of respective dictionary words, but may be the number T of respective classes. This would greatly decrease the number of calculations to about 1/10 that of the pattern matching method of the first prior art, and to as small as 1/200 that of the DP pattern matching method of the second prior art. Therefore, it is clear that the present invention is very effective for rough classification to obtain the rough classification word candidate 213 up to the 10th rank. Fine classification process The above rough classification process can include with high probability the correct recognition result in the rough classification word candidate 2013 (Fig. 20) up to the 10th rank. Then, using rough classification word candidate 2013, the fine classification unit 207 of Fig. 20 performs re-recognition of rough classification word candidate 2013 up to the 10th degree and further can select a rough classification word candidate more precisely up to the higher rank so that the word candidate becomes within the higher rank. Finally, it can obtain the fine classification word candidate 2014 with a higher recognition ratio. The fine classification process is explained hereinafter. The whole process is explained. The fine classification process in the second embodiment registers the vowel sequence within N kinds of respective dictionary words obtained by the large classification process, as a vowel label in advance. The vowel recognition is applied to the unknown input word for inputting input word 2009 by a suitable vowel recognition process, thereby providing a vowel sequence corresponding to the unknown input word. The simplest vowel recognition method includes the feature quantities (the cepstrum coefficient and so on) of five vowels of ┌ ┘ as a dictionary and the feature quantities of the five vowels are matched with the feature quantities obtained from the respective frames of the unknown input word. A vowel sequence is obtained for each respective frame. Various other prior art methods exist but the present embodiment can use any method having a recognition ratio for the first ranked word of about 92%. On the other hand, the vowel sequence of rough classification word candidate 2013 output from the rough classification unit 2005 of Fig. 20 is obtained by referring to the within-word vowel sequence dictionary unit 2008. The DP matching is performed for the vowel sequence of the unknown input word. The vowel sequence of the rough classification word candidate 2013 is obtained as recited above by using the later-described DP matching algorithm. Words which are not matched, namely, in which the vowel sequence of the unknown input word is not matched with that of the rough classification word candidate, are deleted from the rough classification word candidate 2013. The final fine classification word candidate 2014 is thereby outputted. A concrete operation of the above process is explained next. In the vowel recognition process for the unknown input word, the number of the vowel sequence of the unknown input word is not matched with the respective number of the vowel sequence of the rough classification word candidate 2013, as an error may occur in the cutting-out operation. Therefore, the second embodiment does not restrict the number of vowels. It uses the DP matching method. Considering the possibility that the vowel recognition process functions incorrectly for an unknown input word, candidates up to the second rank of the vowel sequence of the unknown input word obtained by the vowel recognition process may be subject to a matching. This process is a feature of this embodiment. More concretely, the vowel series recognized through the vowel recognition process for the unknown input word W and is expressed as { v i ' , v i "} = {/a/,/i/,/u/,/e/,/o/ } i=1,2, · · · , I where equation (28) simply means that V and i ' and V and i " take one of five voowels in the blaket { }, respectively. I is the number of vowels in the unknown input word W and. represents the i th vowel of the vowel sequence recognized by the vowel recognition process applied to the unknown input word W and, and V and i ' V and i " are respectively the first and second candidates of the i th vowel. On the other hand, the vowel series of the word candidate W k obtained at the rough classification word candidate 2013 (in case 10th rank, k=1, 2,...10), is expressed as { v kj } = {/a/,/i/,/u/,/e/,/o/ } j=1,2, · · · ,J where j is the vowel number of the word candidate W k and V kj is the j th vowel of the vowel sequence of the word candidate W k . Matching between the vowel sequence of the unknown input word W and and the vowel sequence of the word candidate W k is conducted by obtaining the accumulated distance D (I, J) using the DP matching algorithm and comparing it with the magnitude of the accumulation distance D. The accumulation distance D(I, J) between the vowel sequence of the unknown input word W and and the vowel sequence of the word candidate W k is calculated by the DP matching algorithm given by the following recurrence formula. 1 ○ initial value determination D(0,0) = 0 D(i,0) = D(i , -1) =D(0,j) = D(-1,j) = ∞ (i=1,2, · · · , I j=1,2, · · ·, J) 2 ○ recurrence formula 3 ○ normalization D(I,J) = D(I,J)/(I+J) As an example, respective vowel sequence and V k of the unknown input word W and and the word candidate W k have the following vowel sequence. v k1 = /a/ v k2 = /i/ In this case, the accumulation distance D (I, J) between and is calculated in accordance with the DP matching algorithm recited in 1 ○ to 3 ○ above, and the DP matching path becomes as shown in Fig. 29. Thus, the accumulation distance D (I, J) =0. The accumulation distance of the vowel sequence of the unknown input word W and and the vowel sequence of the wordcandidate W k is the minimum. As a result, the word candidate W k obtained as the large classification candidate 2013 of Fig. 20 remains as the fine classification word candidate 2014 of Fig. 20 for unknown input word W and. Review of the recognition capability of the fine classification process The recognition ratio of the 10th rank of the rough classification word candidate 2013 is 99.6%. However, as a result of an improvement, the above fine classification process can provide a recognition ratio of the 10th rank of 99.8% and can increase the recognition ratio of the 15th rank to 99.86%. A word candidate selected from the rough classification word candidate 2013 up to the 10th rank thereof can be selected up to the 8th rank by the fine classification candidate 2013. Similarly, the word candidate selected from the rough classification word candidate 2013 up to the 30th rank can be selected up to the 15th rank by the fine classification candidate 2014. In this case, a small number of rough classification word candidates 2013 is originally selected and a small number of vowel sequences of respective words is selected. Therefore, the DP matching of the vowel sequence of the word candidate W k and the unknown input word W and can be carried out at high speed. An application of the second embodiment The second embodiment is a method of obtaining the word candidate for the input speech 2009 (Fig. 20) of the unknown input word as the fine classification word candidate 2014. After the word candidate is thus obtained, a further precise recognition is performed based on fine classification word candidate 2014, thus providing the final recognition result. Various processes can be used to achieve this object but they are not recited in detail. The DP matching may be further conducted for the fine classification word candidate 2014 and the input speech 2009. Methods for achieving the highest matching degree may then be used to achieve a final recognition result. After two-stage recognition process comprising the rough classification process and the fine classification process has been conducted, the above DP matching may be carried out. This can greatly decrease the number of calculations compared with the case where the DP matching is carried out from the beginning. The recognition ratio may be equal to or greater than the case where DP matching is conducted from the beginning. Another embodiment of the fine classification process In the fine classification process in the second embodiment, respective vowels of various vowel sequences of the unknown input word W and use candidates up to the 2nd rank as shown in equation (27). The distance calculation in the DP matching using the 2nd-ranked candidate is carried out by providing the first candidate and second candidate with the same weight, as shown in equation (31). In the calculation of the distance dis(i, j) in the equation (31),the distance is made 0 where the vowel V kj of the vowel sequence of the word candidate W k is equal to the first candidate V and i ' and the second candidate V and i " . In contrast, in the following embodiment, different distances are obtained from equation (31), depending on whether the vowel V kj of the vowel sequence of the word candidate W k is equal to the first candidate V and i ' or to the second candidate V and i ". When it is equal to the first candidate V and i ', the distance is made 0 and when it is equal to the second candidate V and i " the distance is determined to be a value between 0 and 1. Therefore, as a larger weight is applied to the first candidate than to the second candidate, and an appropriate fine classification process can be carried out.

Claims: A pattern recognition apparatus comprising: (A) feature quantity extracting means (101, 301) for (i) receiving a plurality of learning patterns representing the various patterns to be recognised and a pattern to be recognized, (ii) dividing each learning pattern and the pattern to be recognized into a plurality of regions such that each learning pattern and the pattern to be recognized are similarly divided into said regions, and (iii) extracting a feature quantity from each region in the learning patterns and the pattern to be recognized; (B) classifying means (102, 302) for selection of a corresponding respective region in each learning pattern and for classification of the learning patterns into a prespecified number of classes based upon the extracted feature quantities of the learning patterns for the region selected, the classifying means performing said selection and classification for each region; (C) calculating means (103, 303) for calculating for each region a respective representative feature quantity for each of said classes; (D) dictionary storing means (104, 304) for storing for retrieval the representative feature quantities and information identifying for each region the learning patterns in each class; and (E) similarity determining means (105, 305) for determining for each region the degree of similarity between the extracted feature quantity of the pattern to be recognized and the respective representative feature quantity of each class stored in the dictionary storing means (104, 304); characterized by: (F) point accumulating means (106) operable for each region for (i) ranking a subset of the classes according to said degree of similarity, the greater the degree of similarity the higher the ranking given to the classes in the subset and those classes below a predetermined rank being excluded from the subset, and (ii) accumulating points for each learning pattern by, for each class in the determined subset, adding a number of points determined by the ranking of the class for each learning pattern belonging to the class (G) recognizing means for selecting learning patterns using the accumulated points. A pattern recognition apparatus according to claim 1, wherein said feature quantity extracting means (101, 301) comprises: (A) dividing means (202) for dividing a pattern to be recognized into a plurality of overlapping regions (207); (B) thin-line pre-processing means (406) for condensing a portion of the pattern to be recognized into a line of dots one dot wide when said portion is a line; (C) forming means (201) for forming a respective direction line element for each said dot, said direction line element representing the direction from each said dot to each adjacent dot; and (D) operating means (203) for arithmetically obtaining a partial feature vector (205) as the respective feature quantity of each region (207) of the pattern to be recognized by obtaining for respective directions, values representing the density of respective direction line elements of respective dots within each said region (207), said values being obtained by weighting the presence of each direction line element with a respective weight, said weights decreasing from the centre to the periphery of each said region, the result of said totalling being a component element of said vector. A pattern recognition apparatus according to claim 2, wherein said dividing means (202) divides the pattern to be recognized into a plurality of overlapping rectangular regions. A pattern recognition apparatus according to claim 2 or claim 3, wherein said directions comprise a horizontal, a vertical, a 45-degree and a 135-degree direction and said direction line elements can be formed by said forming means (201) with a logical mask. A pattern recognition apparatus according to any one of claims 2 to 4, wherein the smaller the value obtained as a sum of the squares of the Euclidean distances between (i) respective ones of the elements of the partial feature vector (205) for each region of the pattern to be recognized, and (ii) the respective corresponding elements of the representative feature quantity of each class of learning patterns for that region, the larger the degree of similarity determined by said similarity determining means (105, 305) for that class. A pattern recognition apparatus according to any one of claims 2 to 5, further comprising: (H) recognition means (409) for generating candidates (416) for a result of a rough classification, said candidates (416) corresponding to the information identifying the learning patterns having from the highest to a lower number of points accumulated by the point accumulating means (106); (I) fine classification dictionary means (412) for storing information identifying similar learning patterns, discrimination data designating a predetermined region in the similar learning patterns and partial feature vectors (205) of the predetermined region in the similar learning patterns; and (J) fine classification result output means (410) for determining the degree of similarity between the partial feature vector of the pattern to be recognized and the partial feature vector of each similar learning pattern stored in the fine classification dictionary means (412), information identifying one of said similar learning patterns being included in said candidates (416) for the result of the rough classification, and for outputting said candidates (417) based on a determined degree of similarity. A pattern recognition apparatus according to claim 1, further comprising: (H) rough classification means (306) for generating candidates (312) for a result of a rough classification, said candidates (312) corresponding to the information identifying the learning patterns having from the highest to a lower number of points accumulated by the point accumulating means (106); (I) vowel sequence recognition means (307) for receiving said plurality of learning patterns and pattern to be recognized where said learning patterns and pattern to be recognized are spoken words (310, 311) and for outputting a respective vowel sequence for each pattern received; (J) vowel sequence dictionary storing means (308) for storing for retrieval the respective vowel sequences of those learning patterns corresponding to respective candidates (312) for the result of the rough classification; and (K) fine classification means (309) for (i) performing a dynamic programming matching between the respective vowel sequence of each learning pattern corresponding to a candidate for the result of the rough classification and the vowel sequence of the pattern to be recognized, and (ii) outputting candidates for the result of fine classification, said candidates being each learning pattern corresponding to a candidate for the result of the rough classification in the order of the highest to a lower degree of matching according to said dynamic programming matching. A pattern recognition apparatus according to claim 7, wherein said feature quantity extracting means (301) comprises (A) normalizing means for normalizing each learning pattern and the pattern to be recognized to have a predetermined time period; (B) cepstrum determining means for dividing each normalized pattern into a respective plurality of frames of equal time period and for determining the cepstrum coefficient of predetermined dimensions by a cepstrum analysis; and (C) partial feature quantity extracting means for detecting each of said plurality of frames having a continuous cepstrum coefficient and for extracting the feature quantity of that plurality of frames. A pattern recognition apparatus according to claim 8, wherein the cepstrum coefficients are used by the similarity determining means (305) in accordance with claim 5. A pattern recognition apparatus according to any one of claims 1 to 9, further comprising: output means (107) for outputting a predetermined number of candidates for the result of pattern recognition performed by the apparatus, said candidates corresponding to the information identifying the learning patterns having from the highest to a lower number of points accumulated by the point accumulating means (106). A pattern recognition apparatus according to any one of claims 1 to 10, wherein said calculating means (103, 303) calculates for each region the respective representative feature quantity of each class by calculating the average of the respective feature quantities of the learning patterns in that class. A pattern recognition apparatus according to any one of claims 1 to 11, wherein said point accumulating means (106) accumulates points for each region for each learning pattern in a class of the subset according to the formula: P = α - n + 1 where P is the number of points accumulated for that learning pattern, α is the predetermined rank for that region below which classes are excluded from the subset, and n is the ranking of the class into which that learning pattern has been classified for that region. A pattern recognition apparatus according to claim 7, wherein said vowel sequence recognition means (307) outputs a plurality of vowel sequences for the pattern to be recognized and wherein said fine classification means (309) performs the dynamic programming matching between said plurality of vowel sequences and the respective vowel sequence of each learning pattern. A pattern recognition apparatus according to claim 7, wherein said vowel sequence recognition means (307) outputs a plurality of ranked vowel sequences for the pattern to be recognized and wherein said fine classification means (309) performs the dynamic programming matching between said plurality of ranked vowel sequences and the respective vowel sequence of each learning pattern using weights corresponding to the ranks of the vowel sequences. A pattern recognition method comprising: (A) receiving a plurality of learning patterns representing the various patterns to be recognised and a pattern to be recognized; (B) dividing each of said plurality of learning patterns and the pattern to be recognized into a plurality of regions such that each learning pattern and the pattern to be recognized are similarly divided into said regions; (C) extracting a feature quantity from each region in the learning patterns and the pattern to be recognized; (D) selecting a corresponding respective region in each learning pattern; (E) classifying the learning patterns into a prespecified number of classes based upon the feature quantities extracted from the learning patterns for the region selected; (F) performing steps (D) and (E) for each region; (G) calculating for each region a respective representative feature quantity for each of said classes; (H) storing for retrieval the representative feature quantities and information identifying for each region the learning patterns in each class; and (I) determining for each region the degree of similarity between the extracted feature quantity of the pattern to be recognized and the respective representative feature quantity of each class stored in the dictionary storing means; characterized by: (J) ranking for each region a subset of the classes according to said degree of similarity, giving a higher ranking to the classes in the subset the greater the degree of similarity, and excluding from the subset those classes below a predetermined rank; and (K) accumulating points for each learning pattern by, for each class within each determined subset of classes, adding a number of points determined by the rank of the class for each learning pattern belonging to the class; (L) and selecting candidates for the pattern to be recognised on the basis of the accumulated points. A pattern recognition method according to claim 15 further comprising: (M) generating candidates (312) for a result of a rough classification, said candidates (312) corresponding to the information identifying the learning patterns having from the highest to a lower number of accumulated points; (N) recognizing the respective vowel sequence of each learning pattern and of the pattern to be recognized where said learning patterns and pattern to be recognized are voiced words (310, 311); (O) storing for retrieval the respective vowel sequences of those learning patterns corresponding to respective candidates (312) for the result of the rough classification; (P) performing a dynamic programming matching between the respective vowel sequence of each learning pattern corresponding to a candidate for the result of the rough classification and the vowel sequence of the pattern to be recognized; and (Q) outputting candidates for the result of a fine classification, said candidates being each learning pattern corresponding to a candidate for the result of the rough classification in the order of the highest to a lower degree of matching according to said dynamic programming matching. A pattern recognition method according to claim 15 further comprising: outputting a predetermined number of candidates for the result of the pattern recognition method, said candidates corresponding to the information identifying the learning patterns having the highest to a lower number of accumulated points.

Inventors: KIMURA MASAYUKI, KIMURA, MASAYUKI
Applicants: FUJITSU LTD, FUJITSU LIMITED
Application year: 1989
Main classification: G06K9
IPC codes: G10L15, G06K9