Name
Abstract | ||
|---|---|---|
We describe an application of a recently developed speech compression technique to automatic recognition of isolated words (from a given dictionary). The scheme maps sampled speech, from a given word, into a finite codebook (of the same size as the dictionary) using linear predictive coding (LPC) all-pole models and a minimum distortion or nearest neighbor rule between all samples from the given word and the codewords from the codebook. Standard LPC techniques are used to design the codebook, but the final system requires no on-line LPC analysis. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1145/1013879.802674 | SIGCOMM '81 Proceedings of the seventh symposium on Data communications |
Keywords | Field | DocType |
isolated word,isolated word recognition,on-line lpc analysis,final system,linear predictive coding,finite codebook,automatic recognition,speech compression technique,all-pole model,standard lpc technique,minimum distortion,source code,arbitration,word recognition,cryptology,nearest neighbor,digital signature | k-nearest neighbors algorithm,Pattern recognition,Computer science,Source code,Cryptography,Word recognition,Digital signature,Speech recognition,Artificial intelligence,Distortion,Linear predictive coding,Codebook | Conference |
Volume | Issue | ISSN |
11 | 4 | 0146-4833 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrès Buzo | 1 | 0 | 0.34 |
| Horacio Martìnez | 2 | 0 | 0.34 |
| Carlos Rivera | 3 | 10 | 20.47 |
| Aron Jazcilevich | 4 | 0 | 0.34 |