Every link (note: Link) between two notes (note: Note) ends up with a relation (note: Relation) of the profile (note: Profile), decided on four rungs, the first that applies winning: a mapped section (note: Section) (a business object (28 passages, no note) under ## Objects of a screen (note: Screen) is accesses), a typed frontmatter attribute (3 passages, no note) (reads is accesses in read mode (15 passages, no note)), a type pair (4 passages, no note) that admits a single relation (a markdown link (13 passages, no note) or a plain mention (note: Mention) between a rule (note: Rule) and a screen is constrains, marked relation_origin: pair and turned around when the profile only allows it the other way), then related, kept with its confidence (note: Confidence) capped at 0.60 (3 passages, no note) and reported by the ambiguous relation check (note: Check). The first two rungs come from what the author (note: Author) wrote and are never overturned; a declared relation the profile does not allow between the two types (note: Type) is dropped by the relation outside the matrix check. The labels (44 passages, no note) shown for a relation, in either direction, come from the profile alone. The architecture guide and the writing guide describe it.
Relation typing
Properties5
- Application
- Concordance command line
- Domain
- Inference
- Status
- valid
- Condition
- a link between two notes needs a relation of the profile
- Severity
- info
5 declared keys. The rest of the file is free text.
On this page1
See the neighbourhood map6 pages6Neighbourhood mapRelation typing
Neighbourhood map Relation typing
Distance1 hop
47 neighbours in total, more than the map shows.
The 6 neighbourstextual equivalent
- Keyword pageScreenconstrains1
- Build pipelineProcessconstrains1
- LinkBusiness objectconstrains4
- BuildBusiness objectconstrains1
- EntityBusiness objectconstrains2
- ModelBusiness objectconstrains2
Six neighbours at most, always named. Beyond that the map teaches nothing: the list takes over.