Discourse & Dialogue
Hierarchical Topic Models and the Nested Chinese Restaurant Process
Griffiths, Thomas L., Jordan, Michael I., Tenenbaum, Joshua B., Blei, David M.
We address the problem of learning topic hierarchies from data. The model selection problem in this domain is daunting--which of the large collection of possible trees to use? We take a Bayesian approach, generating an appropriate prior via a distribution on partitions that we refer to as the nested Chinese restaurant process. This nonparametric prior allows arbitrarily large branching factors and readily accommodates growing data collections. We build a hierarchical topic model by combining this prior with a likelihood that is based on a hierarchical variant of latent Dirichlet allocation. We illustrate our approach on simulated data and with an application to the modeling of NIPS abstracts.
Hierarchical Topic Models and the Nested Chinese Restaurant Process
Griffiths, Thomas L., Jordan, Michael I., Tenenbaum, Joshua B., Blei, David M.
We address the problem of learning topic hierarchies from data. The model selection problem in this domain is daunting--which of the large collection of possible trees to use? We take a Bayesian approach, generating an appropriate prior via a distribution on partitions that we refer to as the nested Chinese restaurant process. This nonparametric prior allows arbitrarily large branching factors and readily accommodates growing data collections. We build a hierarchical topic model by combining this prior with a likelihood that is based on a hierarchical variant of latent Dirichlet allocation. We illustrate our approach on simulated data and with an application to the modeling of NIPS abstracts.
Hierarchical Topic Models and the Nested Chinese Restaurant Process
Griffiths, Thomas L., Jordan, Michael I., Tenenbaum, Joshua B., Blei, David M.
We address the problem of learning topic hierarchies from data. The model selection problem in this domain is daunting--which of the large collection of possible trees to use? We take a Bayesian approach, generating anappropriate prior via a distribution on partitions that we refer to as the nested Chinese restaurant process. This nonparametric prior allows arbitrarilylarge branching factors and readily accommodates growing data collections. We build a hierarchical topic model by combining this prior with a likelihood that is based on a hierarchical variant of latent Dirichlet allocation. We illustrate our approach on simulated data and with an application to the modeling of NIPS abstracts.
Automated Essay Evaluation: The Criterion Online Writing Service
Burstein, Jill, Chodorow, Martin, Leacock, Claudia
Critique is an application he best way to improve one's writing instructor, revise based on the feedback, that is comprised of a suite of programs and then repeat the whole process as often as that evaluate and provide feedback for errors in possible. Unfortunately, this puts an enormous grammar, usage, and mechanics, that identify load on the classroom teacher, who is faced the essay's discourse structure, and that recognize with reading and providing feedback for perhaps potentially undesirable stylistic features. The companion scoring application, e-rater version As a result, teachers are not able to give 2.0, extracts linguistically-based features writing assignments as often as they would from an essay and uses a statistical model of wish. For example, the singular indefinite determiner a is labeled with the part-of-speech symbol AT, the adjective good is tagged JJ, the singular common noun job gets the label NN. After the corpus is tagged, frequencies are collected for each tag and for each function word (determiners, prepositions, etc.), and also for each adjacent pair of tags and function words. The individual tags and words are called unigrams, and the adjacent pairs are the bigrams. To illustrate, the word sequence, "a good job" contributes to the counts of three bigrams: a-JJ, AT-JJ, JJ-NN, which represent, respectively, the fact that the function word a was followed by an adjective, an indefinite singular determiner was followed by a noun, and an adjective was followed by a noun.
Natural Language Assistant: A Dialog System for Online Product Recommendation
Chai, Joyce, Horvath, Veronika, Nicolov, Nicolas, Stys, Margo, Kambhatla, Nanda, Zadrozny, Wlodek, Melville, Prem
With the emergence of electronic-commerce systems, successful information access on electroniccommerce web sites becomes essential. To provide an efficient solution for information access, we have built the NATURAL language ASSISTANT (NLA), a web-based natural language dialog system to help users find relevant products on electronic-commerce sites. The system brings together technologies in natural language processing and human-computer interaction to create a faster and more intuitive way of interacting with web sites. By combining statistical parsing techniques with traditional AI rule-based technology, we have created a dialog system that accommodates both customer needs and business requirements.
Natural Language Assistant: A Dialog System for Online Product Recommendation
Chai, Joyce, Horvath, Veronika, Nicolov, Nicolas, Stys, Margo, Kambhatla, Nanda, Zadrozny, Wlodek, Melville, Prem
With the emergence of electronic-commerce systems, successful information access on electroniccommerce web sites becomes essential. Menu-driven navigation and keyword search currently provided by most commercial sites have considerable limitations because they tend to overwhelm and frustrate users with lengthy, rigid, and ineffective interactions. To provide an efficient solution for information access, we have built the NATURAL language ASSISTANT (NLA), a web-based natural language dialog system to help users find relevant products on electronic-commerce sites. The system brings together technologies in natural language processing and human-computer interaction to create a faster and more intuitive way of interacting with web sites. By combining statistical parsing techniques with traditional AI rule-based technology, we have created a dialog system that accommodates both customer needs and business requirements. The system is currently embedded in an application for recommending laptops and was deployed as a pilot on IBM's web site.
Automatically Training a Problematic Dialogue Predictor for a Spoken Dialogue System
Walker, M. A., Langkilde-Geary, I., Wright Hastie, H., Wright, J., Gorin, A.
Spoken dialogue systems promise efficient and natural access to a large variety of information sources and services from any phone. However, current spoken dialogue systems are deficient in their strategies for preventing, identifying and repairing problems that arise in the conversation. This paper reports results on automatically training a Problematic Dialogue Predictor to predict problematic human-computer dialogues using a corpus of 4692 dialogues collected with the 'How May I Help You' (SM) spoken dialogue system. The Problematic Dialogue Predictor can be immediately applied to the system's decision of whether to transfer the call to a human customer care agent, or be used as a cue to the system's dialogue manager to modify its behavior to repair problems, and even perhaps, to prevent them. We show that a Problematic Dialogue Predictor using automatically-obtainable features from the first two exchanges in the dialogue can predict problematic dialogues 13.2% more accurately than the baseline.
Optimizing Dialogue Management with Reinforcement Learning: Experiments with the NJFun System
Singh, S., Litman, D., Kearns, M., Walker, M.
Designing the dialogue policy of a spoken dialogue system involves many nontrivial choices. This paper presents a reinforcement learning approach for automatically optimizing a dialogue policy, which addresses the technical challenges in applying reinforcement learning to a working dialogue system with human users. We report on the design, construction and empirical evaluation of NJFun, an experimental spoken dialogue system that provides users with access to information about fun things to do in New Jersey. Our results show that by optimizing its performance via reinforcement learning, NJFun measurably improves system performance.
Toward Conversational Human-Computer Interaction
Allen, James F., Byron, Donna K., Dzikovska, Myroslava, Ferguson, George, Galescu, Lucian, Stent, Amanda
The belief that humans will be able to interact with computers in conversational speech has long been a favorite subject in science fiction, reflecting the persistent belief that spoken dialogue would be the most natural and powerful user interface to computers. With recent improvements in computer technology and in speech and language processing, such systems are starting to appear feasible. There are significant technical problems that still need to be solved before speech-driven interfaces become truly conversational. This article describes the results of a 10-year effort building robust spoken dialogue systems at the University of Rochester.
Toward Conversational Human-Computer Interaction
Allen, James F., Byron, Donna K., Dzikovska, Myroslava, Ferguson, George, Galescu, Lucian, Stent, Amanda
The belief that humans will be able to interact with computers in conversational speech has long been a favorite subject in science fiction, reflecting the persistent belief that spoken dialogue would be the most natural and powerful user interface to computers. With recent improvements in computer technology and in speech and language processing, such systems are starting to appear feasible. There are significant technical problems that still need to be solved before speech-driven interfaces become truly conversational. This article describes the results of a 10-year effort building robust spoken dialogue systems at the University of Rochester.