Benjamin Han
Abstract
Automatic extraction and reasoning over temporal properties in natural language discourse has not had wide use in practical systems due to its demand for a rich and compositional, yet inference-friendly, representation of time. Motivated by our study of temporal expressions from the Penn Treebank corpora, we address the problem by proposing a two-level constraint-based framework for processing and reasoning over temporal information in natural language. Within this framework, temporal expressions are viewed as partial assignments to the variables of an underlying calendar constraint system, and multiple expressions together describe a temporal constraint-satisfaction problem (TCSP). To support this framework, we designed a typed formal language for encoding natural language expressions. The language can cope with phenomena such as under-specification and granularity change. The constraint problems can be solved using various constraint propagation and search methods, and the solutions can then be used to answer a wide range of time-related queries.
- Allen, J. F. 1984. Towards a general theory of action and time. Artif. Intell. 23 (1984), 123--154. Google Scholar
- Androutsopoulos, I. 2002. Exploring Time, Tense and Aspect in Natural Language Database Interfaces. John Benjamins.Google Scholar
- Artale, A. and Franconi, E. To appear. Temporal description logics. In Handbook of Time and Temporal Reasoning in Artificial Intelligence. M. F. Dov Gabbay and L. Vila, eds. MIT Press, Cambridge, MA.Google Scholar
- Bacchus, F. and Van Beek, P. 1998. On the conversion between non-binary and binary constraint satisfaction problems. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), 311--318. Google Scholar
- Bikel, D. M., Schwartz, R., and Weischedel, R. M. 1999. An algorithm that learns what's in a name. Machine Learning 34, 1--3 (1999), 211--231. Google Scholar
- Charniak, E. 2000. A maximum-entropy-inspired parser. In Proceedings of NAACL-2000. Google Scholar
- Collins, M. 1999. Head-driven statistical models for natural language parsing. PhD dissertation, University of Pennsylvania. Google Scholar
- Cristianini, N. and Shawe-Taylor, J. 2000. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press. Google Scholar
- Dechter, R., Meiri, I., and Peari, J. 1991. Temporal constraint networks. Artif. Intell. 49 (1991), 61--95. Google Scholar
- Ferro, L., Mani, I., Sundheim, B., and Wilson, G. 2001. TIDES temporal annotation guidelines. MITRE Tech. Rep.Google Scholar
- Gabbay, D., Hodkinson, I., and Reynolds, M. 1994. Temporal Logic: Mathematical Foundations and Computational Aspects. Oxford University Press. Google Scholar
- Gavalda, M. 2000. SOUP: A parser for real-world spontaneous speech. In Proceedings of the 6th International Workshop on Parsing Technologies (IWPT-2000, Trento, Italy).Google Scholar
- Han, B. 2003. Time calculus for natural language - tagging guidelines. Unpublished draft, Language Technologies Institute, Carnegie Mellon University, Pittsburgh, PA.Google Scholar
- Han, B. and Kohlhase, M. 2003. A time calculus for natural language. In Proceedings of the 4th Workshop on Inference in Computational Semantics (Nancy, France).Google Scholar
- Hauck, R. V., Chau, M., and Chen, H. 2002. COPLINK: Arming law enforcement with new knowledge management technologies. In Advances in Digital Government: Technology, Human Factors, and Policy. W. McIver and A. Elmagarmid, eds. Kluwer Academic, Dordrecht, The Netherlands.Google Scholar
- Hobbs, J. R., Ferguson, G., Allen, J., Hayes, P., Niles, I., and Pease, A. 2002. A DAML Ontology of Time. http://www.cs.rochester.edu/~ferguson/daml/.Google Scholar
- Hwang, C. H. and Schubert, L. K. 1994. Interpreting tense, aspect and time adverbials: A compositional, unified approach. In Proceedings of the 1st International Conference on Temporal Logic (ICTL 94, Bonn, Germany, July 11--14), 238--264. Google Scholar
- Kamp, H. and Reyle, U. 1993. From Discourse to Logic. Kluwer Academic, Dordrecht, The Netherlands.Google Scholar
- Kumar, V. 1992. Algorithms for constraint satisfaction problems: A survey. AI Mag. 13, 1 (1992), 32--44. Google Scholar
- Mackworth, A. K. 1977. Consistency in networks of relations. Artif. Intell. 8 (1977), 99--118.Google Scholar
- Marcus, M., Kim, G., Marcinkiewicz, M., MacIntyre, R., Bies, A., Ferguson, M., Katz, K., and Schasberger, B. 1994. The Penn Treebank: Annotating predicate argument structure. In Proceedings of the ARPA Human Language Technology Workshop. Google Scholar
- Meiri, I. 1992. Temporal reasoning: A constraint-based approach. PhD dissertation, UCLA. Google Scholar
- Ning, P., Wang, X. S., and Jajodia, S. 2002. An algebraic representation of calendars. Ann. Math. Artif. Intell. 36, 1--2 (2002), 5--38. Google Scholar
- Ohlbach, H. and Gabbay, D. 1998. Calendar logic. J. Appl. Non-classical Logics 8, 4 (1998), 291--324.Google Scholar
- Pratt, I. and Francez, N. 2001. Temporal prepositions and temporal generalized quantifiers. Linguistics and Philosophy 24 (2001), 187--222.Google Scholar
- Pustejovsky, J., Sauri, R., Setzer, A., Gaizauskas, R., and Ingria, B. 2002. TimeML Annotation Guidelines. http://www.cs.brandeis.edu/~jamesp/arda/time/documentation/AnnotationGuideline v0.4.0.pdf.Google Scholar
- Setzer, A. 2001. Temporal information in newswire articles: an annotation scheme and corpus study. Ph.D. dissertation, University of Sheffield.Google Scholar
- Snodgrass, R. T. ed. 1995. The TSQL2 Temporal Query Language. Kluwer Academic, Dordrecht, The Netherlands. Google Scholar
- Steedman, M. 1996. Temporality. In Handbook of Logic and Language. J. van Benthem and A. ter Meulen eds. Elsevier, London, 895--935.Google Scholar
- Stickel, M. E., Waldinger, R. J., and Chaudhrim, V. K. 2001. A Guide to SNARK. Tech. Rep. http://www.ai.sri.com/snark/tutorial/tutorial.html.Google Scholar
- Wijsen, J. 2000. A string-based model for infinite granularities. In Proceedings of the AAAI-2000 Workshop on Spatial and Temporal Granularity, 9--16.Google Scholar
- Wooldridge, M., Dixon, C., and Fisher, M. 1998. A tableau-based proof method for temporal logics of knowledge and belief. J. Appl. Non-Classical Logics 8 (1988), 225--258.Google Scholar
Index Terms
- A framework for resolution of time in natural language
Recommendations
Temporal reasoning in a meta constraint logic programming architecture
TIME '96: Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)Constraint Logic Programming (CLP) is a powerful programming paradigm combining the advantages of Logic Programming and the efficiency of constraint solving. However, CLP presents some limitations in dealing with temporal reasoning. First, it uses an "...
GLR parsing with multiple grammars for natural language queries
This article presents an approach for parsing natural language queries that integrates multiple subparsers and subgrammars, in contrast to the traditional single grammar and parser approach. In using LR(k) parsers for natural language processing, we are ...
Comments