5. A patterns speech recognition system as claimed in claim 4, wherein said second matching means further comprises third means responsive to said serial integers and said partial similarity measures for finding a point sequence of provisional segmentation points at which said input pattern is divided into those partial paterns of the concatenation for which said maximum summation is found, and said decision means comprises means responsive to the first predetermined number found by said third means for successively specifying consecutive integers between unity and the last-mentioned predetermined number and means responsive to said partial recognition results, said consecutive integers, and the provisional segmentation points for finding those segmentation points among the point sequences at which said input pattern is divided into the partial patterns, equal in number to said first predetermined number, the partial recognition results for the last-mentioned partial patterns giving said reference pattern concatenation.
4. A continuous speech recognition system as claimed in claim 1, wherein said word number specifier comprises means for successively specifying said word number K as a finite sequence of different integers k, said integers including said first predetermined number k, and said recognition means comprises first matching means responsive to said input and reference pattern feature vectors for finding a partial similarity measure S&lt;p, m&gt; and a partial recognition result n&lt;p, m&gt;, said partial similarity measure being defined as a maximum of similarity measures S[A(p, m), B.sup.n ] between each partial pattern A(p, m) and said reference patterns, said partial pattern being defined by a part of said input pattern feature vector sequence as: EQU A(p, m) = a.sub.p+1, a.sub.p+2, . . . , a.sub.m, overall said partial recognition result being one of said reference patterns that gives said maximum; second matching means comprising, in turn, first means for successively providing serial integers x between unity and a greatest one of said different numbers and second means responsive to each of said serial integers and the partial similarity measures for finding an overall similarity measure T&lt;k&gt; defined as a maximum of summations, each being calculated for the similarity measures of those partial patterns, x in number, into a concatenation of which said input pattern is divided; third matching means responsive to said word number K and the overall similarity measures for deciding said first predetermined number to be one of said different integers that gives a maximum of the overall similarity measures found by said second matching means for said different integers; and decision means responsive to the first predetermined number found by said third matching means and the partial recognition results for deciding said reference pattern concatenation.