Natural Language Decomposition and Interpretation of Complex Utterances

Harsh Jhamtani, Hao Fang, Patrick Xia, Eran Levy, Jacob Andreas +1 more
5/15/2023
cs.CL

No official code found. Best implementation: microsoft/decomposition-of-complex-utterances (6 stars, MIT, last commit 2024-07-16). 1 more below.

Abstract

Designing natural language interfaces has historically required collecting supervised data to translate user requests into carefully designed intent representations. This requires enumerating and labeling a long tail of user requests, which is challenging. At the same time, large language models (LLMs) encode knowledge about goals and plans that can help conversational assistants interpret user requests requiring numerous steps to complete. We introduce an approach to handle complex-intent-bearing utterances from a user via a process of hierarchical natural language decomposition and interpretation. Our approach uses a pre-trained language model to decompose a complex utterance into a sequence of simpler natural language steps and interprets each step using the language-to-program model designed for the interface. To test our approach, we collect and release DeCU -- a new NL-to-program benchmark to evaluate Decomposition of Complex Utterances. Experiments show that the proposed approach enables the interpretation of complex utterances with almost no complex training data, while outperforming standard few-shot prompting approaches.

View on arXivView PDF

Code Implementations(2)

MIT

Resources for Natural Language Decomposition and Interpretation of Complex Utterances. IJCAI 2024

62May 6, 20242 years agoMIT
MIT

Resources for Natural Language Decomposition and Interpretation of Complex Utterances. IJCAI 2024.

41May 3, 20242 years agoMIT

Similar Papers

Cite this paper

@article{jhamtani2023natural,
  title  = {Natural Language Decomposition and Interpretation of Complex Utterances},
  author = {Harsh Jhamtani and Hao Fang and Patrick Xia and Eran Levy and Jacob Andreas and Ben Van Durme},
  year   = {2023},
  eprint = {2305.08677},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.08677v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.08677.svg)](https://codeofpaper.com/paper/2305.08677)

Discussion