Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natural language grammars are more powerful than context-free grammars and humans learn them with remarkable ease from positive examples (Marcus 1993). Identifiability results for formal languages ignore a potentially powerful source of information available to learners of natural languages, namely, ...

Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natural language grammars are more powerful than context-free grammars and humans learn them with remarkable ease from positive examples (Marcus 1993). Identifiability results for formal languages ignore a potentially powerful source of information available to learners of natural languages, namely, ...

I extend the recent unidimensional semantics of supplements due to Martin to a full syntax-semantics interface. The grammar formalism employs a two-component syntax, with one component modeling combinatorics and another for surface form. I show that the syntax-semantics for supplements is relatively uncomplicated, requiring only two new lexical entries. I contrast this with the complex machiner...