Name
Abstract | ||
|---|---|---|
This study presents a two-stage spoken term detection (STD) method that uses the same STD engine twice and a support vector machine (SVM)-based classifier to verify detected terms from the STD engine's output. In a front-end process, the STD engine is used to pre-index target spoken documents from a keyword list built from an automatic speech recognition result. The STD result includes a set of keywords and their detection intervals (positions) in the spoken documents. For keywords having competitive intervals, we rank them based on the STD matching cost and select the one having the longest duration among competitive detections. The selected keywords are registered in the pre-index. They are then used to train an SVM-based classifier. In a query term search process, a query term is searched by the same STD engine, and the output candidates are verified by the SVM-based classifier. Our proposed twostage STD method with pre-indexing was evaluated using the NTCIR-10 SpokenDoc-2 STD task and it drastically outperformed the traditional STD method based on dynamic time warping and a confusion network-based index. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1587/transinf.2016SLP0017 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
decision process, pre-indexing, spoken term detection, support vector machine, verification | Pattern recognition,Computer science,Support vector machine,Speech recognition,Artificial intelligence,Decision process,Classifier (linguistics) | Journal |
Volume | Issue | ISSN |
E99D | 10 | 1745-1361 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kentaro Domoto | 1 | 0 | 0.68 |
| takehito utsuro | 2 | 456 | 82.76 |
| Naoki Sawada | 3 | 16 | 5.06 |
| Hiromitsu Nishizaki | 4 | 163 | 29.49 |