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

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    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.
    Original languageEnglish
    Title of host publicationAdvances in natural language processing
    Number of pages8
    Place of PublicationBerlin
    PublisherSpringer
    Publication date2006
    Pages748-755
    ISBN (Print)978-3-540-37334-6, 3-540-37334-9
    Publication statusPublished - 2006
    MoE publication typeA4 Article in conference proceedings
    EventInternational Conference on NLP - Turku, Finland
    Duration: 23 Aug 200625 Aug 2006
    Conference number: 5

    Bibliographical note

    Springer;
    3-540-37334-9;

    Fields of Science

    • 612 Languages and Literature
    • language technology
    • computational linguistics
    • calendar expressions

    Cite this