Two string-based finite-state models of the semantics of calendar expressions

Authors:
Jyrki Niemi;Lauri Carlson;Kimmo Koskenniemi
Affiliations:
Department of General Linguistics, University of Helsinki;Department of Translation Studies, University of Helsinki;Department of General Linguistics, University of Helsinki
Venue:
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
Year:
2006

Citing 3
Cited 0

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
A Finite-state Approach to Events in Natural Language Semantics

Journal of Logic and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents two string-based finite-state approaches to modelling the semantics of natural-language calendar expressions: extended regular expressions (XREs) over a timeline string of unique symbols, and a string of hierarchical periods of time constructed by finite-state transducers (FSTs). The approaches cover expressions ranging from plain dates and times of the day to more complex ones, such as the second Tuesday following Easter. The paper outlines the representations of sample calendar expressions in the two models, presents a possible application in temporal reasoning, and informally compares the models.