The name a link carries, taken from the profile: accesses, constrains, serves, related. Each relation lists the pairs of types it may join and a label for each direction, so that a screen reads "accesses" an object and the object reads "is accessed by" the screen. A relation is decided on four rungs, the first that applies winning: a mapped section, a typed frontmatter attribute, a type pair that admits a single relation, then related, the fallback capped at 0.60 and reported as ambiguous when a written link or a located mention carries it, never when co-occurrence alone does. A relation the profile does not allow between two types (note: Type) never enters the model.
Relation
Properties3
- Application
- Concordance command line
- Domain
- Inference
- Status
- valid
3 declared keys. The rest of the file is free text.
See the neighbourhood map6 pages6Neighbourhood mapRelation
Neighbourhood map Relation
Distance1 hop
91 neighbours in total, more than the map shows.
The 6 neighbourstextual equivalent
- Co-occurrenceTermgeneralizes8
- LinkTermspecializes26
- ModelTermspecializes14
- Section mentionTermspecializes1
- ProfileTermspecializes19
- Textual equivalentTermspecializes1
Six neighbours at most, always named. Beyond that the map teaches nothing: the list takes over.