Linguistic grammars with very low complexity

We have presented an overview of the FSIG approach and related FSIG gram- mars to issues of very low complexity and parsing strategy. We ended up with serious optimism according to which most FSIG grammars could be decom- posed in a reasonable way and then processed efficiently.

Two bracketing schemes for the Penn Treebank

The trees in the Penn Treebank have a standard representation that involves complete balanced bracketing. In this article, an alternative for this standard representation of the tree bank is proposed. The proposed representation for the trees is loss-less, but it reduces the total number of brackets by 28%. This is possible by omitting the redundant pairs of special brackets that encode initial and final embedding, using a technique proposed by Krauwer and des Tombe (1981). In terms of the paired brackets, the maximum nesting depth in sentences decreases by 78%. The 99.9% coverage is achieved with only five non-top levels of paired brackets. The observed shallowness of the reduced bracketing suggests that finite-state based methods for parsing and searching could be a feasible option for tree bank processing.

Exact solution for the unsteady flow and heat transfer between eccentrically rotating disks

The unsteady heat transfer associated with flow due to eccentrically rotating disks considered by Ramachandra Rao and Kasiviswanathan (1987) is studied via reformulation in terms of cylindrical polar coordinates. The corresponding exact solution of the energy equation is presented when the upper and lower disks are subjected to steady and unsteady temperatures. For an unsteady flow with nonzero mean, the energy equation can be solved by prescribing the temperature on the disk as a sum of steady and oscillatory parts

Cooperative Replies to Unbelievable Assertions

We propose a dialogue protocol for situations in which an agent makes to another agent an assertion that the other agent finds impossible to believe. In this interaction, unbelievable assertions are rejected using explanations formed by logical interpolation and new assertions are being made such that all previous rebuttals are taken into account.