|
||||||||||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||||||||||
ABSTRACT
While dialog system technology is advancing, there is a lack of theory allowing the vastly different domains for systems to be compared. As a result, all predictions of the cost of building a new dialog system must be made by a dialog expert based on intuition and experience. Recently it has been proposed that entropy can be used as a complexity measure for dialog systems. These calculations would require domain specifications and understanding of information theory. This paper introduces the Domain Complexity Analysis Tool, or DomCAT. With this tool, anyone with basic knowledge of dialog systems can calculate system complexities and create new dialog domain specifications, and dialog complexity calculations can become standard for the field. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
INDEX TERMS
Primary Classification:
Additional Classification:
General Terms:
|
||||||||||||||||||||||||||||||||||||||||||||||