Representing and Combining Calendar Information by Using Finite-State Transducers

  • Authors:
  • Jyrki Niemi;Kimmo Koskenniemi

  • Affiliations:
  • Department of General Linguistics, University of Helsinki, Finland, e-mail: {jyrki.niemi, kimmo.koskenniemi}@helsinki.fi;Department of General Linguistics, University of Helsinki, Finland, e-mail: {jyrki.niemi, kimmo.koskenniemi}@helsinki.fi

  • Venue:
  • Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.