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

Learning new user formulations in automatic Directory Assistance

Abstract: Telecom ltalia has deployed since the beginning of year 2001 a nationwide automatic Directory Assistance (DA) system that routinely serves customers asking for residential and business listings. DA for business listings is a challenging task: one of its main problems is that customers formulate their requests for the same listing with a great variability. Since it is difficult to reliably predict a priori the user formula tions, in this paper we ' propose a procedure for detecting, from field data, user formul… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…In (Popovici et al 2002), an unsupervised learning algorithm was proposed to obtain the linguistic variants of listings that were not modeled in the Telecom Italia's DA system. A phone-looped model was exploited to obtain the phonetic transcriptions for the utterances that failed the automated service and got routed to the operators.…”
Section: Closing the Feedback Loopmentioning
confidence: 99%
See 1 more Smart Citation
“…In (Popovici et al 2002), an unsupervised learning algorithm was proposed to obtain the linguistic variants of listings that were not modeled in the Telecom Italia's DA system. A phone-looped model was exploited to obtain the phonetic transcriptions for the utterances that failed the automated service and got routed to the operators.…”
Section: Closing the Feedback Loopmentioning
confidence: 99%
“…To discover these uncovered intents, a language model based acoustic clustering algorithm was proposed. Unlike the algorithm in (Popovici et al 2002) that clusters the one-best phonetic transcriptions, it treats the word transcription and the cluster they belong to as hidden variables, and optimizes the parameters associated with them with respect to an objective function. Specifically, given a fixed number of clusters, it builds a cluster-specific language model P (w | c) and a cluster prior model P (c) to maximize P (x) = c,w P (x, w, c) = c,w P (x | w) P (w | c) P (c), the likelihood of the observed acoustic signal x.…”
Section: Closing the Feedback Loopmentioning
confidence: 99%