Semantic Processing for Finite Domains
Series: Studies in Natural Language Processing;
- Publisher's listprice GBP 103.00
-
52 128 Ft (49 646 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 5 213 Ft off)
- Discounted price 46 915 Ft (44 681 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
52 128 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 28 September 1990
- ISBN 9780521362269
- Binding Hardback
- No. of pages212 pages
- Size 234x152x16 mm
- Weight 412 g
- Language English 0
Categories
Short description:
This book aims to look at the semantics of natural languages in context.
MoreLong description:
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.
MoreTable of Contents:
List of figures; Acknowledgements; 1. Problems in semantic analysis of text; 2. Previous computational approaches to semantic analysis; 3. A domain formalization; 4. Inference-driven mapping; 5. Results of inference-driven semantic analysis; Appendices; References.
More
