Logos

OPERATIONopr.spa.ajuste-ortografico

ajuste ortográfico

The change of a stem's final letter before an ending that would otherwise make the letter stand for a different sound, so the sound holds and the spelling moves.

This is the one operation in the set whose input and output are both letters and whose motivation is entirely about sound. A stem ending in one of a small set of letters spells a different sound before a front vowel than before a back one, and the writing system fixes that by changing the letter so the sound does not change. Verbs that show it are not irregular in any way a speaker would notice; they are regular verbs whose spelling has to work harder, which is why the class is carved separately from the classes that alter a stem in fact. A reader who wants to check the claim that the sound is constant cannot check it here, since orthography is all the graph carries, and naming that is more useful than implying a phonology this version does not have.

statusstatus
documentedasserted, and the sources agree
provenanceprovenance
authoredwritten for Logos, from first principles
derivation statusderivation_status
unstatednobody has said whether it follows from anything
saliencesalience
No salience. Where no frequency source applies the object carries none, rather than a default or a guess (03-schema.md §3.5).
aliasesaliases
  • metalanguageorthographic stem adjustment
sourcessources
An empty list, which is an assertion: this rests on nothing external, and somebody checked. It is not the same as nobody having looked.

What it does, and when it fires

operation.rule

The domain it works in, and the firing condition as a sentence. The checkable form of that condition is the selects group below.

domaindomain
morphologicalit changes the shape of words
triggertrigger

A verb forms a cell whose ending begins with a vowel that would change what the stem's final letter spells.

How much it covers

operation.coverage

How many cases the operation actually derives, out of how many it claims, and how that was counted.

derives 3 of 3enumerated

None among the three conjugations, each of which shows the adjustment. What is missing is the thing the adjustment exists to preserve: this graph records no pronunciation anywhere, so the constancy of sound is asserted in this body and is shown nowhere in the data.

every case was counted, and the count closes: nothing is left over

Everything joined to this object

One group per typed edge, in both directions. A1b guarantees no object node is an orphan, so this is the whole navigation: an object with no edges would have failed the build rather than reached this page.

What this object is a kind of

Walking this object's own `is-a` edges: what it is a kind of. Several branches from one object are several classification axes, not competing supertypes.

objects
1
places drawn
1
multi-parent
None in this view. This subgraph happens to be a tree, which the explorer draws as one without assuming it is one.

Siblings are listed by name, then by id to break ties. That is a display choice made here and not an order the graph asserts.

Fan-out per dimension

A4

One row per dimension, largest first. That is a display order, not a verdict: 03-schema.md declares no threshold above which fan-out is too much, so this reports the count and grades nothing.

  • case13 values
  • mood8 values
  • voice8 values
  • aspect7 values
  • aktionsart6 values
  • number6 values
  • person6 values
  • tense6 values
  • comparison4 values
  • evidentiality4 values
  • gender4 values
  • politeness4 values
  • valency4 values
  • animacy3 values
  • definiteness3 values
  • deixis3 values
  • finiteness2 values
  • information structure2 values
  • interrogativity2 values
  • polarity2 values
  • switch-reference2 values

What kinds of this object there are

Walking the `is-a` edges that point at this object: what kinds of it there are. An object reachable two ways is drawn in both places and is still one object.

objects
1
places drawn
1
multi-parent
None in this view. This subgraph happens to be a tree, which the explorer draws as one without assuming it is one.

Siblings are listed by name, then by id to break ties. That is a display choice made here and not an order the graph asserts.

applies-to

edges.applies-to

the operation's input

this operation applies to

derives

edges.derives

the why-chain

derived by