Patent
1995-05-05
1997-06-17
MacDonald, Allen R.
395 252, 395 253, 395 26, 395 261, G10L 500
Patent
active
056404883
ABSTRACT:
The dictionary is broken into clusters by first grouping the dictionary according to a rule based procedure whereby the dictionary is sorted by word length and alphabetically. After sorting, a plurality of first cluster centers is generated by selecting the dictionary entries that differ from neighboring entries by the first letter. Each of the dictionary entries is then assigned to the closest one of the first cluster centers using a dynamic time warping procedure. These newly formed clusters are then each analyzed to find the true cluster center and the dictionary entries are then each assigned to the closest true cluster center. The clusters, so formed, may then be rapidly searched to locate any dictionary entry. The search is quite efficient because only the closest cluster to the desired dictionary entry needs to be searched.
REFERENCES:
patent: 4975959 (1990-12-01), Benbassat
Wilpon, J. And Rabiner, L., "A Modified K-Means Clustering Algorithm for Use in Isolated Work Recognition," IEEE Transactions on Acoustics, Speech and Signal Processing, vol. ASSP-33, No. 3, Jun. 1985, pp. 587-594.
Demel Craig
Junqua Jean-claude
MacDonald Allen R.
Panasonic Technologies Inc.
Sax Robert
LandOfFree
System and method for constructing clustered dictionary for spee does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for constructing clustered dictionary for spee, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for constructing clustered dictionary for spee will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2164318