Loading...
Please wait, while we are loading the content...
Similar Documents
Some Results on Search Complexity vs Accuracy
| Content Provider | Semantic Scholar |
|---|---|
| Author | Ravishankar, Mosur |
| Copyright Year | 1997 |
| Abstract | This paper presents three different techniques applied in or devel- oped during the 1996 Hub-4 broadcast news transcription task. First, an efficient shortest path graph searchalgorithm is applied to the word lattice created by Viterbi search, producing a globally optimum result. This reduces the word error rate by about 3-10% (relative), depending on the test set. The execution time is at or close to real time for most utterances. Second, a segmented N-best listgeneration algorithm is described for producing compact N-best lists for very long utterances. Finally, a temporal smoothingtechnique is com- pared to deleted interpolation. On one test set, temporal smoothing reduces the error rate by 3% for an 8% increase in search cost, while the latter improves by 6% for a 50% increase in search cost. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www-cgi.cs.cmu.edu/~rkm/slt97/slt97.ps |
| Alternate Webpage(s) | http://www.itl.nist.gov/div894/894.01/proc/darpa97/pdf/ravisha1.pdf |
| Alternate Webpage(s) | http://www.informedia.cs.cmu.edu/documents/mosur.pdf |
| Alternate Webpage(s) | http://www.nist.gov/speech/publications/darpa97/ps/ravisha1.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
