0
Your cart

Your cart is empty

Books > Language & Literature > Language & linguistics > Computational linguistics

Buy Now

Semi-Supervised Dependency Parsing (Hardcover, 1st ed. 2015) Loot Price: R2,215
Discovery Miles 22 150
Semi-Supervised Dependency Parsing (Hardcover, 1st ed. 2015): Wenliang Chen, Min Zhang

Semi-Supervised Dependency Parsing (Hardcover, 1st ed. 2015)

Wenliang Chen, Min Zhang

 (sign in to rate)
Loot Price R2,215 Discovery Miles 22 150 | Repayment Terms: R208 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

This book presents a comprehensive overview of semi-supervised approaches to dependency parsing. Having become increasingly popular in recent years, one of the main reasons for their success is that they can make use of large unlabeled data together with relatively small labeled data and have shown their advantages in the context of dependency parsing for many languages. Various semi-supervised dependency parsing approaches have been proposed in recent works which utilize different types of information gleaned from unlabeled data. The book offers readers a comprehensive introduction to these approaches, making it ideally suited as a textbook for advanced undergraduate and graduate students and researchers in the fields of syntactic parsing and natural language processing.

General

Imprint: Springer Verlag, Singapore
Country of origin: Singapore
Release date: July 2015
First published: 2015
Authors: Wenliang Chen • Min Zhang
Dimensions: 235 x 155 x 11mm (L x W x T)
Format: Hardcover - Cloth over boards
Pages: 144
Edition: 1st ed. 2015
ISBN-13: 978-981-287-551-8
Categories: Books > Language & Literature > Language & linguistics > Computational linguistics
LSN: 981-287-551-4
Barcode: 9789812875518

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!

Partners