We establish a semantics for building grammars from a modularised specification in which modules are able to delete productions from imported nonterminals. Modules have import lists of nonterminals; some or all of an imported nonterminal’s productions may be suppressed at import time. There are two basic import mechanisms which (a) reference or (b) clone an imported nonterminal’s productions. O...

We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting with a simple Xbar grammar, we learn a new grammar whose nonterminals are subsymbols of the original nonterminals. In contrast with previous work, we are able to split various terminals to different degrees, as approp...

Let G be a finite extensive form game with perfect information and chance moves, referred to here as a game. Fix a set of players N = {1, 2, ..., n} and a set of histories H, such that the root history ∅ ∈ H and, for any a = (a1, ..., at−1, at) ∈ H, (a1, ..., at−1) ∈ H. The set of terminal histories is Z ⊂ H, and the player assignment function identifies a subset of players (or Nature) at each ...

This paper introduces a set of English grammar symbols that the author has developed to enhance students’ understanding and consequently, application of the English grammar rules. A pretest-posttest control-group design was carried out in which the samples were students in two girls’ senior high schools (N=135, P ≤ 0.05) divided into two groups: the Treatment which received gramm...