2011
DOI: 10.1109/tasl.2011.2134087
|View full text |Cite
|
Sign up to set email alerts
|

Lattice Indexing for Spoken Term Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
61
0
1

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 128 publications
(62 citation statements)
references
References 17 publications
0
61
0
1
Order By: Relevance
“…To do so, these lattices are processed using the lattice indexing technique described in [99] so that the lattices of all the utterances in the search collection are converted from individual weighted finite state transducers to a single generalized factor transducer structure in which the start-time, end-time, and lattice posterior probability of each word token are stored as three-dimensional costs. This factor transducer is actually an inverted index of all word sequences seen in the lattices.…”
Section: Word-based Std Systemmentioning
confidence: 99%
“…To do so, these lattices are processed using the lattice indexing technique described in [99] so that the lattices of all the utterances in the search collection are converted from individual weighted finite state transducers to a single generalized factor transducer structure in which the start-time, end-time, and lattice posterior probability of each word token are stored as three-dimensional costs. This factor transducer is actually an inverted index of all word sequences seen in the lattices.…”
Section: Word-based Std Systemmentioning
confidence: 99%
“…The lattice indexing technique, described in [124], first converts the word lattices of all the utterances in the speech data from Table 9 System summary in terms of the ASR subsystem and STD subsystem employed. "prob."…”
Section: Kaldi-based Std Systemmentioning
confidence: 99%
“…Lattices generated by the BMMI models are processed using the lattice indexing technique described in [18]. The lattices of all the utterances in the eval set are converted from individual finite state transducers (FST) output by Kaldi to a single generalized factor transducer structure in which the start-time, end-time and lattice posterior probability of each word token in every lattice is stored as a 3-dimensional cost associated with that instance of the word.…”
Section: Openfst-based Kws System Descriptionmentioning
confidence: 99%
“…This factor transducer is, in essence, an inverted index of all word sequences seen in the collection of eval set lattices, and permits further manipulation easily using the Google OpenFST tools [19]. Interested readers are referred to [18] for details.…”
Section: Openfst-based Kws System Descriptionmentioning
confidence: 99%