Quantification and Implication in Semantic Calendar Expressions Represented with Finite-State Transducers

This paper elaborates a model for representing semantic calendar expressions (SCEs), which correspond to the 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 represented as a finite-state automaton (FSA). We present a treatment of SCEs corresponding to quantified phrases (any Monday; every May) and an implication operation for requiring the denotation of one SCE to contain completely that of another.

• Type: Conference
• Year: 2008
• Where: COLING
• Authors: Jyrki Niemi, Kimmo Koskenniemi
• Keywords: COLING 2008, Computational Linguistics, Finite-state Transducers, Natural-language Calendar Phrases, Semantic Calendar Expressions