In the paper “Formal Basis of a Language Universal” by Miloš Stanojević and Mark Steedman in Computational Linguistics 47:1 (, there is an error in example (12) on page 17.

The two occurrences of the notation ∖W should appear as |W. The paper has been updated so that the paragraph reads:

In the full theory, these rules are generalized to “second level” cases, in which the secondary function is of the form (Y|Z)|W such as the following “forward crossing” instance, in which — matches either / or ∖ in both input and output:

  • (12) 

    The Forward Crossing Level Two Composition Rule

      X/×Y (YZ)|WB× (XZ)|W          (B×2)

This is an open-access article distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits you to copy and redistribute in any medium or format, for non-commercial use only, provided that the original work is not remixed, transformed, or built upon, and that appropriate credit to the original source is given. For a full description of the license, please visit