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

Broadcast news LM adaptation over time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

2006
2006
2018
2018

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 28 publications
(26 citation statements)
references
References 21 publications
0
26
0
Order By: Relevance
“…This approach is known as count merging (Federico & Bertoldi, 2004;Ljolje, Hindle, Riley, & Sproat, 2000;Lobacheva, 2000), and it is usually related to well-known adaptation approaches, such as Maximum a Posteriori (MAP) or Maximum Likelihood Linear Regression (MLLR). MAP has been successfully applied to LM adaptation (see, for instance, (Chen et al, 2001;Liu et al, 2008)), although it has been proven in Bacchiani, Riley, Roark, and Sproat (2006), Bacchiani and Roark (2003), and Hsu (2007) that the performance of a MAP-based adaptation system is similar to that achieved with linear interpolation, but requiring a greater computational effort.…”
Section: Model Interpolationmentioning
confidence: 99%
See 1 more Smart Citation
“…This approach is known as count merging (Federico & Bertoldi, 2004;Ljolje, Hindle, Riley, & Sproat, 2000;Lobacheva, 2000), and it is usually related to well-known adaptation approaches, such as Maximum a Posteriori (MAP) or Maximum Likelihood Linear Regression (MLLR). MAP has been successfully applied to LM adaptation (see, for instance, (Chen et al, 2001;Liu et al, 2008)), although it has been proven in Bacchiani, Riley, Roark, and Sproat (2006), Bacchiani and Roark (2003), and Hsu (2007) that the performance of a MAP-based adaptation system is similar to that achieved with linear interpolation, but requiring a greater computational effort.…”
Section: Model Interpolationmentioning
confidence: 99%
“…One of the most common sources of data for adaptation purposes is the Internet. It is usually queried when trying to adapt the LMs to a specific topic (Lecorvé, Gravier, & Sébillot, 2009;Shi et al, 2008), or to the most recent content, such as in the case of a Broadcast News transcription domain, as proposed in Federico and Bertoldi (2004), Martins et al (2010), Saykham, Chotimongkol, and Wutiwiwatchai (2010).…”
Section: Previous Workmentioning
confidence: 99%
“…In [Federico and Bertoldi, 2004], an approach of this kind was introduced. The baseline vocabulary of 62K words is extended by adding to that special OOV word class 60K new words selected from the contemporary written news on a daily basis.…”
Section: Oov Word Classmentioning
confidence: 99%
“…In [Federico and Bertoldi, 2004] the problem of updating over time the LM component of an Italian broadcast news transcription system is addressed. In particular, vocabulary adaptation, done on a daily basis, is carried out by adding words to the active vocabulary according to frequency and recency in contemporary written news, which allowed achieving significantly lower OOV word rates.…”
Section: Vocabulary Selection/adaptationmentioning
confidence: 99%
“…The idea of vocabulary and LM adaptation is to use written news daily available on the Internet to adjust the vocabulary and reduce the impact of linguistic differences over time. Similar approaches to the one presented here have been proposed where vocabulary adaptation is carried out by adding and removing words from the baseline vocabulary according to frequency and recency in contemporary written news [2] [3]. In [1] a different approach is suggested which uses a multi-pass recognition strategy to generate morphological variations of the list of all words in the lattice, thus dynamically adapting the recognition vocabulary.…”
Section: Introductionmentioning
confidence: 99%