 |
Page History
...
MRSAT Column | Function | LexGrid Equivalent | |
|---|---|---|---|
MAPSETVERSION |
| Relations.representsVersion | |
FROMVSAB | The from code system version | Relations.fromCodingSchemeVersion | |
FROMRSAB | The from code system | Relations.FromCodingScheme | |
TOVSAB | The to code system version | Relations.toCodingSchemeVersion | |
TORSAB | The to code system | Relations.toCodingScheme | |
MAPSETRSAB | Source of the value set | Relations.owner | |
(anything else) |
|
|
MRMAP Mappings
There are at least two possibilities for the MRMAP transformations into LexGrid. The first, the "flattened transformation" puts the entire MRMAP row into the table.
...
MRMAP Column | Function | LexGrid Equivalent | |
|---|---|---|---|
MAPSETCUI |
| Relations.containerName | |
MAPID | Row identifier | Target.associationInstanceId | |
FROMEXPR | Source code or expression | Source.sourceEntityCode | |
REL | UMLS asserted relationship | associationPredicate (if RELA absent) | |
RELA | Source asserted relationship | associationPredicate(if not blank) | |
TOEXPR | Target code or expression | Target.targetEntityCode (if code) | |
TOTYPE | Type of the data | targetData.associationDataText.dataType (if target is not code) | |
(entire MRMAP row |
|
|
MRMAP Expanded Option
MRMAP Column | Function | LexGrid Equivalent |
|---|---|---|
MAPSETCUI |
| Relations.containerName |
MAPID | Row identifier | Target.associationInstanceId |
FROMEXPR | Source code or expression | Source.sourceEntityCode |
REL | UMLS asserted relationship | associationPredicate (if RELA absent) |
RELA | Source asserted relationship | associationPredicate(if not blank) |
TOEXPR | Target code or expression | Target.targetEntityCode (if code) |
TOTYPE | Type of the data | targetData.associationDataText.dataType (if target is not code) |
(anything else) | unmigrated-wiki-markup | Target(Data).associationQualification\[EVS:associationQualifier\] |
Expression Issues
One of the requirements for mapping has been the ability to discover what maps a given entity (may) participate in. This will not be completely answerable in situations where the codes are carried in text expressions. One alternativ would be to parse the target expression when possible and to create multiple rows, one for each target. Besides the parsing complexity, however, the other issue is that it is not possible to record the expression operators (AND, OR, ...) in the expansion. This, however, would arguably be the best use of the mappings for this level of complexity.
...
