Search



Page tree

  

Semantic Forms

Similar to the stated and inferred view of precoordinated concepts, as described in 2.1 Precoordination and Postcoordination, the meaning represented by postcoordinated expressions can also be represented in different ways. When enabling postcoordinated expressions within a system, it is important to be support these different views and understand why they are needed.

Close to User Form

The Close to User Form (CTU) Expression is the faithful representation of the clinical meaning as it was entered by the user. It is the{ primary stored and communicated view of the clinical information that’s encoded using SNOMED CT. The CTU Expression includes any refinement that was applied by the system, based on the selections made in a data entry form, or those made explicitly. 

And, importantly, it does not include any additional relationships that are added, based on classifier rules to make the expression complete or to normalize it. It only includes the parts of the clinical meaning that were specifically intended by the user.

Classifiable Form

The Classifiable Form (CF) expression is a syntactically valid and concept model compliant representation of the CTU expression. It serves as the input to the classifier, enabling expressions to be classified together with other SNOMED CT content.

And in the classifiable form, any ungrouped attributes and role groups have been validated and appropriately applied to the definition of the focus concept.

Necessary Normal Form

The Necessary Normal Form (NNF) expression is the inferred view of the expression, and it includes all the relationships that are necessarily true, with redundancy removed. This is the output of the process that took the classifiable form expression and classified it with a given SNOMED edition. The NNF represents the necessary relationships used for querying, so this becomes part of your substrate when you’re running an Expression Constraint query.

The NNF includes refinements that represent inferred relationships, without any redundant refinements or redundant relationship groups.

Objective of Different Semantic Forms

Within the released SNOMED CT content, the stated definitions of SNOMED CT concepts are represented as Description Logic OWL axioms, and these are the clinical definition that SNOMED authors state when they define the meaning of a concept. For postcoordinated expressions, the CTU expression can be compared to the stated concept definition, as it represents the expression as it was created.

When querying SNOMED CT concepts, the inferred definitions are used. The inferred definition of a concept is derived (or inferred) by classifying the stated definitions using a Description Logic reasoner. The output of this classification process is represented in the release using the relationship table and includes the necessary normal form for each concept. The necessary normal form represents the set of ‘necessary’ inferred relationships. For more information on concept definitions, please refer to Appendix D of the release file specification: Concept Definition Illustrations. In the same way as for precoordinated concepts, the inferred view, or the NNF expressions, needs to be generated to support querying over postcoordinated expressions, see Figure 2.4-1.

To enable the classification of the CTU expression, a transformation is required to provide a form that can serve as input to a Description Logic reasoner. Such reasoner requires a form which is syntactically valid and complies to the concept model rules. This is why all support for postcoordination also requires the ability to generate the CF of each expression.


Gliffy Macro Error

You do not have permission to view this diagram.

Figure 2.4-1: Expression forms compared to the representations of precoordinated content.


Canonical Form

Although the Compositional Grammar syntax supports a standard way of representing SNOMED CT expressions, expressions that contain exactly the same concept identifiers and refinements, may still differ from one another in the following ways:

The canonical form of an expression is a serialized representation produced by applying a set of rules that ensure a single unique representation for any expression.


The expression is rendered in the form specified by the SNOMED CT compositional grammar.

  • For canonical representation, a restricted version of the compositional grammar is used:
    • No whitespace characters may be included in the canonical form
    • No pipe characters "|" and thus no term text shall be included in the canonical form.
    • Thus the permitted characters are:
      • Digits [0-9] - for conceptId values
      • Plus [+] - to combine focus concepts
      • Colon [:] - to represent the start of a refinement
      • Equals [=] - to link an attribute name to it value
      • Comma [,] - to separate attributes within a refinement
      • Round brackets [()] - to represent nesting
      • Curly brackets [{}] - to represent grouping
      • Definition status indicator
        • Equal to indicator [===] - to represent semantic equivalence
        • Subtype of indicator [<<<] - to represent a primitive clinical meaning

The syntax determines the general order of elements within an expression as follows:

  • Focus conceptIds
    • Within a set of focus conceptIds, concept Identifiers are sorted alphabetically based on their normal string rendering (i.e. digits with no leading zeros):
      • The reason for alphabetic sorting rather than numeric sorting is that it is complex to sort attributes and groups which consist of an arbitrary number of conceptIds using numeric keys.
  • Attributes (expressed as name-value pairs)
    • Within a set of ungrouped attributes or a set of attributes within a group:
      • Attributes are sorted alphabetically based on the string concatenation of the name and value conceptIds separated by an "=" sign;
      • If a value contains nested refinements, the value is enclosed in round brackets (which may influence the sort order) and the elements of the nested expression are sorted by applying the general canonical sorting rules.
  • Groups (containing attributes)
    • Groups are sorted by alphabetical order of the combined set of previously sorted attributes.

Examples

Original ExpressionCanonical Form

195967001:246112005=24484000

417076003:272741003=24028007

71388002:{260686004=129304002,405813007=15497006,405815000=122456005}

64572001:{116676008=72704001,363698007=12611008}

Table 2.4-1: Examples of expressions and their canonical form.



Feedback
  • No labels