Semantic Processing for Finite Domains (Paperback, New ed)

A primary problem in the area of natural language processing has been that of semantic analysis. This book aims to look at the semantics of natural languages in context. It presents an approach to the computational processing of English text that combines current theories of knowledge representation and reasoning in Artificial Intelligence with the latest linguistic views of lexical semantics. This results in distinct advantages for relating the semantic analysis of a sentence to its context. A key feature is the clear separation of the lexical entries that represent the domain-specific linguistic information from the semantic interpreter that performs the analysis. The criteria for defining the lexical entries are firmly grounded in current linguistic theories, facilitating integration with existing parsers. This approach has been implemented and tested in Prolog on a domain for physics word problems and full details of the algorithms and code are presented. Semantic Processing for Finite Domains will appeal to postgraduates and researchers in computational linguistics, and to industrial groups specializing in natural language processing.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Series:	Studies in Natural Language Processing
Release date:	February 2006
First published:	1990
Authors:	Martha Stone Palmer
Dimensions:	228 x 152 x 12mm (L x W x T)
Format:	Paperback - Trade
Pages:	212
Edition:	New ed
ISBN-13:	978-0-521-02403-7
Categories:	Books > Language & Literature > Language & linguistics > Computational linguistics Books > Language & Literature > Language & linguistics > Semantics (meaning) > General Promotions
LSN:	0-521-02403-X
Barcode:	9780521024037

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!