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

Jyrki Niemi; Lauri Carlson; Kimmo Koskenniemi

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

Jyrki Niemi, Lauri Carlson, Kimmo Koskenniemi

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

Sammanfattning

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.

Originalspråk	engelska
Titel på värdpublikation	Advances in natural language processing
Antal sidor	8
Utgivningsort	Berlin
Förlag	Springer
Utgivningsdatum	2006
Sidor	748-755
ISBN (tryckt)	978-3-540-37334-6, 3-540-37334-9
Status	Publicerad - 2006
MoE-publikationstyp	A4 Artikel i en konferenspublikation
Evenemang	International Conference on NLP - Turku, Finland Varaktighet: 23 aug. 2006 → 25 aug. 2006 Konferensnummer: 5

Bibliografisk information

Springer;
3-540-37334-9;

Vetenskapsgrenar

612 Språk och litteratur
kieli
ajallisuus
ilmaukset

Åtkomst av dokument

http://www.springerlink.com/content/e1522371mm304073/fulltext.pdf

HFST - Helsinki Finite-State Technology
Linden, K. (Principal Investigator), Koskenniemi, K. (Deltagare), Yli-Jyrä, A. (Deltagare), Hulden, M. (Deltagare), Silfverberg, M. (Deltagare), Pirinen, T. (Deltagare), Axelson, E. (Deltagare), Hardwick, S. (Deltagare), Niemi, J. (Annan) & Hurskainen, A. (Deltagare)
01/01/2005 → …
Projekt: Forskningsprojekt
Two-level morphology
Koskenniemi, K. (Principal Investigator)
01/04/1981 → …
Projekt: Forskningsprojekt

Citera det här

@inproceedings{469a23c14b2d4d538d613c5a38ba294f,

title = "Two string-based finite-state models of the semantics of calendar expressions",

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. ",

keywords = "612 Languages and Literature, language technology, computational linguistics, calendar expressions, kieli, ajallisuus, ilmaukset, kieli, ajallisuus, ilmaukset",

author = "Jyrki Niemi and Lauri Carlson and Kimmo Koskenniemi",

note = "Springer; 3-540-37334-9; ; International Conference on NLP ; Conference date: 23-08-2006 Through 25-08-2006",

year = "2006",

language = "English",

isbn = "978-3-540-37334-6",

pages = "748--755",

booktitle = "Advances in natural language processing",

publisher = "Springer",

address = "United States",

}

TY - GEN

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

AU - Niemi, Jyrki

AU - Carlson, Lauri

AU - Koskenniemi, Kimmo

N1 - Conference code: 5

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - 612 Languages and Literature

KW - language technology

KW - computational linguistics

KW - calendar expressions

KW - kieli

KW - ajallisuus

KW - ilmaukset

KW - kieli

KW - ajallisuus

KW - ilmaukset

M3 - Conference contribution

SN - 978-3-540-37334-6

SN - 3-540-37334-9

SP - 748

EP - 755

BT - Advances in natural language processing

PB - Springer

CY - Berlin

T2 - International Conference on NLP

Y2 - 23 August 2006 through 25 August 2006

ER -

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

Sammanfattning

Bibliografisk information

Vetenskapsgrenar

Åtkomst av dokument

Projekt

HFST - Helsinki Finite-State Technology

Two-level morphology

Citera det här