Robust parsing and spoken negotiative dialogue with databases
This paper presents a robust parsing algorithm and semantic formalism for the interpretation of utterances in spoken negotiative dialogue with databases. The algorithm works in two passes: a domain-specific pattern-matching phase and a domain-independent semantic analysis phase. Robustness is achiev...
Saved in:
Published in | Natural language engineering Vol. 14; no. 3; pp. 289 - 312 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Cambridge, UK
Cambridge University Press
01.07.2008
|
Subjects | |
Online Access | Get full text |
ISSN | 1351-3249 1469-8110 1469-8110 |
DOI | 10.1017/S1351324906004402 |
Cover
Summary: | This paper presents a robust parsing algorithm and semantic formalism for the interpretation of utterances in spoken negotiative dialogue with databases. The algorithm works in two passes: a domain-specific pattern-matching phase and a domain-independent semantic analysis phase. Robustness is achieved by limiting the set of representable utterance types to an empirically motivated subclass which is more expressive than propositional slot–value lists, but much less expressive than first-order logic. Our evaluation shows that in actual practice the vast majority of utterances that occur can be handled, and that the parsing algorithm is highly efficient and accurate. |
---|---|
Bibliography: | ArticleID:00440 PII:S1351324906004402 istex:B1BC78831E24A6A47E76674BA7A45CB7C6571010 ark:/67375/6GQ-7T6ND2D8-3 ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
ISSN: | 1351-3249 1469-8110 1469-8110 |
DOI: | 10.1017/S1351324906004402 |