skip to main content
10.1145/1378889.1379006acmconferencesArticle/Chapter ViewAbstractPublication PagesjcdlConference Proceedingsconference-collections
poster

Modeling korean clinical records as a simple temporal constraint satisfaction problem

Published:16 June 2008Publication History

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.

References

  1. Dechter R., Neiri I., Pearl J. Temporal constraint networks. Artif Intell. 1991;49:61--95. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Hripcsak G., Zhou L., Parsons, S., Das, A. K., Johnson, S. B. Modeling electronic discharge summaries as a simple temporal constraint satisfaction problem. J Am Med Inform Assoc 2005;12(1):55--63.Google ScholarGoogle Scholar

Index Terms

  1. Modeling korean clinical records as a simple temporal constraint satisfaction problem

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          JCDL '08: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries
          June 2008
          490 pages
          ISBN:9781595939982
          DOI:10.1145/1378889

          Copyright © 2008 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 16 June 2008

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • poster

          Acceptance Rates

          JCDL '08 Paper Acceptance Rate33of117submissions,28%Overall Acceptance Rate415of1,482submissions,28%
        • Article Metrics

          • Downloads (Last 12 months)0
          • Downloads (Last 6 weeks)0

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader