Regular expressions for language engineering
Natural Language Engineering
A framework for resolution of time in natural language
ACM Transactions on Asian Language Information Processing (TALIP) - Special Issue on Temporal Information Processing
An ontology of time for the semantic web
ACM Transactions on Asian Language Information Processing (TALIP) - Special Issue on Temporal Information Processing
A Finite-state Approach to Events in Natural Language Semantics
Journal of Logic and Computation
The semantic representation of temporal expressions in text
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Computational treatment of temporal notions: the CTTN-system
Proceedings of the 2005 international conference on Annotating, extracting and reasoning about time and events
Regular relations for temporal propositions
Natural Language Engineering
Finite-state representations embodying temporal relations
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Hi-index | 0.00 |
This paper elaborates a model for representing various types of semantic calendar expressions (SCEs), which correspond to the disambiguated intensional meanings of natural-language calendar phrases. The model uses finite-state transducers (FSTs) to mark denoted periods of time on a set of timelines also represented as an FST. In addition to an overview of the model, the paper presents methods to combine the periods marked on two timeline FSTs into a single timeline FST and to adjust the granularity and span of time of a timeline FST. The paper also discusses advantages and limitations of the model.