Computational Morphology - Practical Mechanisms for the English Lexicon (Paperback)

Previous work on morphology has largely tended either to avoid precise computational details or to ignore linguistic generality. Computational Morphology is the first book to present an integrated set of techniques for the rigorous description of morphological phenomena in English and similar languages. By taking account of all facets of morphological analysis, it provides a linguistically general and computationally practical dictionary system for use within an English parsing program.The authors cover morphographemics (variations in spelling as words are built from their component morphemes), morphotactics (the ways that different classes of morphemes can combine, and the types of words that result), and lexical redundancy (patterns of similarity and regularity among the lexical entries for words). They propose a precise rule-notation for each of these areas of linguistic description and present the algorithms for using these rules computationally to manipulate dictionary information. These mechanisms have been implemented in practical and publicly available software, which is described in detail, and appendixes contain a large number of computer-tested sets of rules and lexical entries for English.Graeme D. Ritchie is a Senior Lecturer in the Department of Artificial Intelligence at the University of Edinburgh, where Alan W. Black is currently a research student. Graham J. Russell is a Research Fellow at ISSCO (Institut Dalle Molle pour les etudes semantiques et cognitives) in Geneva, and Stephen G. Pulman is a Lecturer in the University of Cambridge Computer Laboratory and Director of SRI International's Cambridge Computer Science Research Centre."

General

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!