• DocumentCode
    2788369
  • Title

    Incremental partition recombination for efficient tracking of multiple dialog states

  • Author

    Williams, Jason D.

  • Author_Institution
    AT&T Labs. - Res., Shannon Lab., Florham Park, NJ, USA
  • fYear
    2010
  • fDate
    14-19 March 2010
  • Firstpage
    5382
  • Lastpage
    5385
  • Abstract
    For spoken dialog systems, tracking a distribution over multiple dialog states has been shown to add robustness to speech recognition errors. To retain tractability, past work has suggested tracking dialog states in groups called partitions. While promising, current techniques are limited to incorporating a small number of ASR N-Best hypotheses. This paper overcomes this limitation by incrementally recombining partitions during the update. Experiments with a database of 300,000 AT&T staff show better whole-dialog accuracy than existing approaches. In addition, our implementation, which is available to the research community, views partitions as programmatic objects - an accessible formulation for commercial application developers.
  • Keywords
    Markov processes; speech recognition; ASR N-best hypotheses; incremental partition recombination; multiple dialog states; partially observable Markov decision processes; programmatic objects; speech recognition errors; spoken dialog systems; Automatic speech recognition; Cities and towns; Databases; Face; History; Laboratories; Linear approximation; Robustness; Speech processing; Speech recognition; Dialog management; dialog modeling; partially observable Markov decision processes;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on
  • Conference_Location
    Dallas, TX
  • ISSN
    1520-6149
  • Print_ISBN
    978-1-4244-4295-9
  • Electronic_ISBN
    1520-6149
  • Type

    conf

  • DOI
    10.1109/ICASSP.2010.5494939
  • Filename
    5494939