Temporal ontology and temporal reference
Computational Linguistics - Special issue on tense and aspect
A computational model of the semantics of tense and aspect
Computational Linguistics - Special issue on tense and aspect
Computational Linguistics - Special issue on tense and aspect
Machine Learning - Special issue on learning with probabilistic representations
Maintaining knowledge about temporal intervals
Communications of the ACM
A word-based approach for modeling and discovering temporal relations embedded in Chinese sentences
ACM Transactions on Asian Language Information Processing (TALIP)
Algorithms for analysing the temporal structure of discourse
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Discourse relations and defeasible knowledge
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
A simplified theory of tense representations and constraints on their composition
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Hi-index | 0.00 |
Temporal reference is an issue of determining how events relate to one another. Determining temporal relations relies on the combination of the information, which is explicit or implicit in a language. This paper reports a computational model for determining temporal relations in Chinese. The model takes into account the effects of linguistic features, such as tense/aspect, temporal connectives, and discourse structures, and makes use of the fact that events are represented in different temporal structures. A machine learning approach, Weighted Bayesian Classifier, is developed to map their combined effects to the corresponding relations. An empirical study is conducted to investigate different combination methods, including lexicalbased, grammatical-based, and role-based methods. When used in combination, the weights of the features may not be equal. Incorporating with an optimization algorithm, the weights are fine tuned and the improvement is remarkable.