IEEE International Conference on Acoustics Speech and Signal Processing 2002
DOI: 10.1109/icassp.2002.5743640
|View full text |Cite
|
Sign up to set email alerts
|

Audio Indexing of Arabic broadcast news

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0

Year Published

2006
2006
2024
2024

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 33 publications
(37 citation statements)
references
References 4 publications
0
36
0
Order By: Relevance
“…All popcomp has to do is to compare the two positions in the corpus. 1 The make_kbest_suf program below is similar to the make_standard_suf program above except we now sort by the two orders at alternating depths in the tree. First we sort lexicographically and then we sort by popularity and so on, using a construction similar to KD-Trees (Bentley, 1975).…”
Section: K-best Suffix Arraysmentioning
confidence: 99%
See 2 more Smart Citations
“…All popcomp has to do is to compare the two positions in the corpus. 1 The make_kbest_suf program below is similar to the make_standard_suf program above except we now sort by the two orders at alternating depths in the tree. First we sort lexicographically and then we sort by popularity and so on, using a construction similar to KD-Trees (Bentley, 1975).…”
Section: K-best Suffix Arraysmentioning
confidence: 99%
“…The code below is simple to describe (though there are more efficient implementations that avoid unnecessary qsorts). int* make_kbest_suf () { int N = strlen(corpus); int* suf = (int*)malloc(N * sizeof(int)); 1 With a little extra book keeping, one can keep a table on the side that makes it possible to map back and forth between popularity rank and the actual popularity. This turns out to be useful for some applications.…”
Section: K-best Suffix Arraysmentioning
confidence: 99%
See 1 more Smart Citation
“…Final system has been built using a lexicon which contains 10,130 unique grapheme words. As in [12], [11], we used grapheme as modeling unit to create our own lexicon because. An example of its content obtained after text pre-processing is shown in Table IV.…”
Section: Tonal Vowels Normalizatiońmentioning
confidence: 99%
“…A "machine translation" system is trained based on an initial phonetic dictionary and afterwards this system can be used to convert any other word to its phonetic form. Finally, another approach, to generate a pronunciation dictionary for ASR, consists in simply modeling graphemes instead of phonemes [38,39]. The "phonetic transcription" of the word is, in fact, its written form.…”
Section: Grapheme-to-phoneme Conversion For Romanianmentioning
confidence: 99%