2014
DOI: 10.1016/j.csl.2013.12.003
|View full text |Cite
|
Sign up to set email alerts
|

Improved open-vocabulary spoken content retrieval with word and subword lattices using acoustic feature similarity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
15
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(15 citation statements)
references
References 57 publications
0
15
0
Order By: Relevance
“…It also yielded 13% relative improvement for a set of OOV queries on audio recordings of McGill course lectures [193] with several speakers [185], and 6.1% relative improvements on broadcast news with many speakers [184]. The graph-based approach with random walk was also shown to outperform the exemplar-based approach with examples from PRF [181]. This is because the exemplarbased approach only considers those information for objects most confident to be relevant or irrelevant, whereas the graphbased approach globally considers all the objects retrieved in the first pass.…”
Section: E Graph-based Approachmentioning
confidence: 94%
See 3 more Smart Citations
“…It also yielded 13% relative improvement for a set of OOV queries on audio recordings of McGill course lectures [193] with several speakers [185], and 6.1% relative improvements on broadcast news with many speakers [184]. The graph-based approach with random walk was also shown to outperform the exemplar-based approach with examples from PRF [181]. This is because the exemplarbased approach only considers those information for objects most confident to be relevant or irrelevant, whereas the graphbased approach globally considers all the objects retrieved in the first pass.…”
Section: E Graph-based Approachmentioning
confidence: 94%
“…Another way to exploit the graph structure is using the random walk [181]- [183], [185], which does not use any labelled data. The basic idea is that the hypothesized regions (nodes) strongly connected to many other hypothesized regions (nodes) with higher/lower confidence scores on the graph should have higher/lower scores.…”
Section: E Graph-based Approachmentioning
confidence: 99%
See 2 more Smart Citations
“…where C(d) is the ASR score of d, δ is a interpolation factor tuned on the development data. This method is similar to the Pseudo Relevance Feedback (PRF) [26]. Note that, the PRF assumes that top detections (e.g.…”
Section: Rescoring Oov Detections By Simple Interpolationmentioning
confidence: 99%