東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Generalized Categorial Grammar for U...

Nguyen, Luan Viet.

Linked to FindBook

Google Book

Amazon

博客來

Generalized Categorial Grammar for Unbounded Dependencies Recovery.

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Generalized Categorial Grammar for Unbounded Dependencies Recovery./
Author:	Nguyen, Luan Viet.
Description:	207 p.
Notes:	Source: Dissertation Abstracts International, Volume: 75-06(E), Section: B.
Contained By:	Dissertation Abstracts International75-06B(E).
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3612711
ISBN:	9781303744815

Generalized Categorial Grammar for Unbounded Dependencies Recovery.
Nguyen, Luan Viet.

Generalized Categorial Grammar for Unbounded Dependencies Recovery. - 207 p.

Source: Dissertation Abstracts International, Volume: 75-06(E), Section: B.

Thesis (Ph.D.)--University of Minnesota, 2014.

Accurate recovery of predicate-argument dependencies is vital for interpretation tasks like information extraction and question answering, and unbounded dependencies may account for a significant portion of the dependencies in any given text. This thesis describes a Generalized Categorial Grammar (GCG) which, like other categorial grammars, imposes a small, uniform, and easily learnable set of semantic composition operations based on functor-argument relations, but like HPSG, is generalized to limit the number of categories used to those needed to enforce grammatical constraints.

ISBN: 9781303744815Subjects--Topical Terms:

626642
Computer Science.

Generalized Categorial Grammar for Unbounded Dependencies Recovery.
LDR:03140nam a2200301 4500 001 1967322
005 20141112080256.5
008 150210s2014 ||||||||||||||||| ||eng d
020 $a 9781303744815
035 $a (MiAaPQ)AAI3612711
035 $a AAI3612711
040 $a MiAaPQ $c MiAaPQ
100 1 $a Nguyen, Luan Viet. $3 2104291
245 1 0 $a Generalized Categorial Grammar for Unbounded Dependencies Recovery.
300 $a 207 p.
500 $a Source: Dissertation Abstracts International, Volume: 75-06(E), Section: B.
500 $a Adviser: William Schuler.
502 $a Thesis (Ph.D.)--University of Minnesota, 2014.
520 $a Accurate recovery of predicate-argument dependencies is vital for interpretation tasks like information extraction and question answering, and unbounded dependencies may account for a significant portion of the dependencies in any given text. This thesis describes a Generalized Categorial Grammar (GCG) which, like other categorial grammars, imposes a small, uniform, and easily learnable set of semantic composition operations based on functor-argument relations, but like HPSG, is generalized to limit the number of categories used to those needed to enforce grammatical constraints.
520 $a The thesis also describes a system for automatically reannotating syntactically-annotated corpora for the purpose of refining linguistically-informed phrase structure analyses of various phenomena. In particular, it describes a method for implementing syntactic analyses of various phenomena through automatic reannotation rules, which operate deterministically on a corpus like the Penn Treebank (Marcus et al., 1993) to produce a corpus with desired syntactic analyses. This reannotated corpus is then used to define a probabilistic grammar which is automatically annotated with additional latent variable values (Petrov and Klein, 2007) and used to parse the constituent and syntactic dependencies from input sentences of the Wall Street Journal and from a minimal but special corpus introduced by (Rimell et al., 2009) that contains only sentences having Object extraction from a relative clause, Object extraction from a reduced relative clause, Subject extraction from a relative clause, Free relatives, Object wh-questions, Right node raising, and Subject extraction from an embedded clause. This corpus was designed specifically to test various parsers on their capability to recover these unbounded dependencies as studied by (Rimell et al., 2009, Nivre et al., 2010). Our system achieves the best result with noticeable margin on unbounded dependency recovery task compared to the results of all 7 other major systems studied by (Rimell et al., 2009, Nivre et al., 2010). The first paper describing this system earned the attention from the NLP research community after it won the Best Paper Award at the international conference COLING 2012.
590 $a School code: 0130.
650 4 $a Computer Science. $3 626642
650 4 $a Language, Linguistics. $3 1018079
650 4 $a Engineering, Computer. $3 1669061
690 $a 0984
690 $a 0290
690 $a 0464
710 2 $a University of Minnesota. $b Computer Science. $3 1018528
773 0 $t Dissertation Abstracts International $g 75-06B(E).
790 $a 0130
791 $a Ph.D.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3612711