| 摘要 |
<p>A distance d<n>(i, j) between a feature @@ of an input pattern and a feature @@<n> of a reference pattern is calculated for a time point (i, j). The minimum cumulative distance of the distances obtained previous to the time point (i, j) is calculated as an optimal cumulative value g<n>(i, j) in accordance with the recurrence formula of a dynamic programming method. A range of combinations (n, j) of words n and the time points j for new optimal cumulative values g<n>(i, j) to be calculated is restricted based on the previous optimal cumulative value for each time point i and memory areas exclusively for the optimal cumulative values of the combinations (n, j) are produced.</p> |
