Name
Title | ||
|---|---|---|
Two-Step Spoken Term Detection Using Svm Classifier Trained With Pre-Indexed Keywords Based On Asr Result |
Abstract | ||
|---|---|---|
This paper presents a novel two-step 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 output of the second STD engine. In the first STD process, pre-indexing of the target spoken documents from a keyword list built from the results of automatic speech recognition of the speeches is performed The first STD process result includes a set of keywords and their detection intervals (positions) in the spoken documents. For the keywords that have competitive intervals, we rank them on the basis of the matching cost of STD and select the best one with the longest duration among competitive detections. The selected keywords are registered in the pre-index. In the second STD process, a query is searched by the same STD engine, and then, the outputted candidates are verified by an SVM classifier. Our proposed two-step STD method was evaluated using the NTCIR-10 SpokenDoc-2 STD task and it drastically outperformed the traditional STD method based on dynamic time warping and the confusion network -based index. |
Year | Venue | Keywords |
|---|---|---|
2015 | 16TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION (INTERSPEECH 2015), VOLS 1-5 | spoken document indexing, spoken term detection, verification by support vector machine |
Field | DocType | Citations |
Pattern recognition,Computer science,Speech recognition,Artificial intelligence,Svm classifier | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 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 |