Abstract
| Original language | English |
|---|---|
| Title of host publication | Language, Life, Limits : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014 |
| Editors | Arnold Beckman, Erzsébet Csuhaj-Varjú, Klaus Meer |
| Publisher | Springer VS |
| Publication date | 2014 |
| Pages | 93-102 |
| ISBN (Print) | 978-3-319-08018-5 |
| DOIs | |
| Publication status | Published - 2014 |
| Series | Lecture Notes in Computer Science |
|---|---|
| Volume | 8493 |
| ISSN | 0302-9743 |
Cite this
}
Constraint Logic Programming for Resolution of Relative Time Expressions. / Christiansen, Henning.
Language, Life, Limits: 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. ed. / Arnold Beckman; Erzsébet Csuhaj-Varjú; Klaus Meer. Springer VS, 2014. p. 93-102.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
TY - GEN
T1 - Constraint Logic Programming for Resolution of Relative Time Expressions
AU - Christiansen, Henning
PY - 2014
Y1 - 2014
N2 - Translating time expression into absolute time points or durations is a challenge for natural languages processing such as text mining and text understanding in general. We present a constraint logic language CLP(Time) tailored to text usages concerned with time and calendar. It provides a simple and flexible formalism to express relationships between different time expressions in a text, thereby giving a recipe for resolving them into absolute time. A constraint solver is developed which, as opposed to some earlier approaches, is independent of the order in which temporal information is introduced, and it can give meaningful output also when no exact reference time is available.
AB - Translating time expression into absolute time points or durations is a challenge for natural languages processing such as text mining and text understanding in general. We present a constraint logic language CLP(Time) tailored to text usages concerned with time and calendar. It provides a simple and flexible formalism to express relationships between different time expressions in a text, thereby giving a recipe for resolving them into absolute time. A constraint solver is developed which, as opposed to some earlier approaches, is independent of the order in which temporal information is introduced, and it can give meaningful output also when no exact reference time is available.
U2 - 10.1007/978-3-319-08019-2_10
DO - 10.1007/978-3-319-08019-2_10
M3 - Article in proceedings
SN - 978-3-319-08018-5
SP - 93
EP - 102
BT - Language, Life, Limits
A2 - Beckman, Arnold
A2 - Csuhaj-Varjú, Erzsébet
A2 - Meer, Klaus
PB - Springer VS
ER -