An Empirical Approach to Temporal Reference Resolution (journal version)
Janyce Wiebe, Thomas P. O'Hara, Thorsten Ohrstrom-Sandgren, and, Kenneth K. McKeever (New Mexico State University)

TL;DR
This paper presents an empirical investigation into resolving explicit temporal references in scheduling dialogs, developing and evaluating a system based on a recency-focused model across diverse datasets.
Contribution
It introduces a reliable annotation process, develops a fully automatic system, and evaluates the effectiveness of a recency-based focus model for temporal reference resolution.
Findings
High annotation reliability among naive annotators
System performs well on unseen data sets
Recency-based focus model has low ambiguity and few errors
Abstract
Scheduling dialogs, during which people negotiate the times of appointments, are common in everyday life. This paper reports the results of an in-depth empirical investigation of resolving explicit temporal references in scheduling dialogs. There are four phases of this work: data annotation and evaluation, model development, system implementation and evaluation, and model evaluation and analysis. The system and model were developed primarily on one set of data, and then applied later to a much more complex data set, to assess the generalizability of the model for the task being performed. Many different types of empirical methods are applied to pinpoint the strengths and weaknesses of the approach. Detailed annotation instructions were developed and an intercoder reliability study was performed, showing that naive annotators can reliably perform the targeted annotations. A fully…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpeech and dialogue systems · Personal Information Management and User Behavior · Constraint Satisfaction and Optimization
