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

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussa › Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

Abstrakti

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.

Alkuperäiskieli	englanti
Otsikko	Advances in natural language processing
Sivumäärä	8
Julkaisupaikka	Berlin
Kustantaja	Springer
Julkaisupäivä	2006
Sivut	748-755
ISBN (painettu)	978-3-540-37334-6, 3-540-37334-9
Tila	Julkaistu - 2006
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisuussa
Tapahtuma	International Conference on NLP - Turku, Suomi Kesto: 23 elok. 2006 → 25 elok. 2006 Konferenssinumero: 5

Lisätietoja

Springer;
3-540-37334-9;

Tieteenalat

612 Kielitieteet, kirjallisuus
kieli
ajallisuus
ilmaukset

Pääsy asiakirjaan

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

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

Siteeraa tätä

@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

Abstrakti

Lisätietoja

Tieteenalat

Pääsy asiakirjaan

Projektit

HFST - Helsinki Finite-State Technology

Two-level morphology

Siteeraa tätä