Modeling korean clinical records as a simple temporal constraint satisfaction problem

Authors:
Heekyong Park;Jinwook Choi
Affiliations:
Seoul National University, Seoul, South Korea;Seoul National University, Seoul, South Korea
Venue:
Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries
Year:
2008

Citing 1
Cited 0

Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Temporal information is especially crucial in medical text processing. The simple temporal constraint satisfaction problem (STP) has been evaluated as sufficient to represent most English clinical temporal assertions. We aimed to test expressive power of STP in representing Korean clinical documents and to find out any encoding issues dependent on Korean language. This paper shows that STP is sufficient. Some distinctive characteristics were found but they did not affect the encoding work.