“Hulan-2013-10-11”版本间的差异
来自cslt Wiki
（→TTS） |
（→Dialog system） |
||
| （某位用户的一个中间修订版本未显示） | |||
| 第3行： | 第3行： | ||
==ASR Kernel development== | ==ASR Kernel development== | ||
| − | [[http://cslt.riit.tsinghua.edu.cn/mediawiki/index.php/2013- | + | [[http://cslt.riit.tsinghua.edu.cn/mediawiki/index.php/2013-10-11 ASR group weekly report]] |
==TTS== | ==TTS== | ||
| 第21行： | 第21行： | ||
* Conducting the initial experiment: | * Conducting the initial experiment: | ||
| − | #Using 9k dim TF/IDF, compose feature vectors for each query, each answer. Mach the TF/IDF of query+answer to match the TF/IDF of new queries | + | #Using 9k dim TF/IDF, compose feature vectors for each query, each answer. Mach the TF/IDF of query+answer to match the TF/IDF of new queries. |
# Keep two top-level categories, try to reduce top-level errors: | # Keep two top-level categories, try to reduce top-level errors: | ||
| + | Add the scores of the Cosine score of the match with queries and answers directly: | ||
| + | top-level errors: 2/60 , all errors: 13/60 | ||
| + | Use scores of the Cosine score of the match with queries only: | ||
| + | top-level errors: 0/60 , all errors: 7/60 | ||
| + | speed: 2 query/second | ||
Next week: | Next week: | ||
| − | * Reverse index-based fast match | + | * Reverse index-based fast match (only match with queries) |
# code done in python | # code done in python | ||
| − | # CER 7/60, speed 1 query/second | + | # CER 7/60, speed 1 query/second |
* Use the new data set to verify the program. | * Use the new data set to verify the program. | ||
2013年10月11日 (五) 03:12的最后版本
ASR
ASR Kernel development
TTS
- CD lab files done. Refining the script.
- Training toolkit is cleaned up. Now no alignment is required. Parallel training is done.
- Tried syllable based system instead of phones.
- Collected an online-novel reading.
Next week:
- Refine the script
- Clean up the online reading.
Dialog system
- Conducting the initial experiment:
- Using 9k dim TF/IDF, compose feature vectors for each query, each answer. Mach the TF/IDF of query+answer to match the TF/IDF of new queries.
- Keep two top-level categories, try to reduce top-level errors:
Add the scores of the Cosine score of the match with queries and answers directly: top-level errors: 2/60 , all errors: 13/60 Use scores of the Cosine score of the match with queries only: top-level errors: 0/60 , all errors: 7/60 speed: 2 query/second
Next week:
- Reverse index-based fast match (only match with queries)
- code done in python
- CER 7/60, speed 1 query/second
- Use the new data set to verify the program.
