Tomek Strzalkowski - Böcker

Reversible grammar allows computational models to be built that are equally well suited for the analysis and generation of natural language utterances. This task can be viewed from very different perspectives by theoretical and computational linguists, and computer scientists. The papers in this volume present a broad range of approaches to reversible, bi-directional, and non-directional grammar systems that have emerged in recent years. This is also the first collection entirely devoted to the problems of reversibility in natural language processing. Most papers collected in this volume are derived from presentations at a workshop held at the University of California at Berkeley in the summer of 1991 organised under the auspices of the Association for Computational Linguistics. This book will be a valuable reference to researchers in linguistics and computer science with interests in computational linguistics, natural language processing, and machine translation, as well as in practical aspects of computability.

Automated question answering - the ability of a machine to answer questions, simple or complex, posed in ordinary human language - is one of today’s most exciting technological developments. It has all the markings of a disruptive technology, one that is poised to displace the existing search methods and establish new standards for user-centered access to information. This book gives a comprehensive and detailed look at the current approaches to automated question answering. The level of presentation is suitable for newcomers to the field as well as for professionals wishing to study this area and/or to build practical QA systems. The book can serve as a "how-to" handbook for IT practitioners and system developers. It can also be used to teach advanced graduate courses in Computer Science, Information Science and related disciplines. The readers will acquire in-depth practical knowledge of this critical new technology.