國立高雄大學圖資館 |

Language: English

Back

Evaluating grammar formalisms for ap...

Chiang, David.

Evaluating grammar formalisms for applications to natural language processing and biological sequence analysis.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Evaluating grammar formalisms for applications to natural language processing and biological sequence analysis.
Author:	Chiang, David.
Description:	144 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 2996.
Notes:	Supervisor: Aravind K. Joshi.
Contained By:	Dissertation Abstracts International65-06B.
Subject:	Computer Science.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3137994
ISBN:	0496851640

Evaluating grammar formalisms for applications to natural language processing and biological sequence analysis.
Chiang, David.

Evaluating grammar formalisms for applications to natural language processing and biological sequence analysis. - 144 p.

Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 2996.

Thesis (Ph.D.)--University of Pennsylvania, 2004.

Finally, we explore the application of formal grammars to modeling secondary/tertiary structures of biological sequences. We show how additional SGC can be used to extend models to take more complex structures into account, paying special attention to the technique of intersection, which has drawn comparatively little attention in computational linguistics.

ISBN: 0496851640Subjects--Topical Terms:

212513
Computer Science.

Evaluating grammar formalisms for applications to natural language processing and biological sequence analysis.
LDR:03453nmm _2200313 _450 001 162788
005 20051017073523.5
008 090528s2004 eng d
020 $a 0496851640
035 $a 00149289
040 $a UnM $c UnM
100 0 $a Chiang, David. $3 227932
245 1 0 $a Evaluating grammar formalisms for applications to natural language processing and biological sequence analysis.
300 $a 144 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 2996.
500 $a Supervisor: Aravind K. Joshi.
502 $a Thesis (Ph.D.)--University of Pennsylvania, 2004.
520 # $a Finally, we explore the application of formal grammars to modeling secondary/tertiary structures of biological sequences. We show how additional SGC can be used to extend models to take more complex structures into account, paying special attention to the technique of intersection, which has drawn comparatively little attention in computational linguistics.
520 # $a For our other two applications, by contrast, we can readily increase the SGC of a formalism without increasing its computational complexity. For natural language translation, we discuss the formal, linguistic, and computational properties of a formalism that is more powerful than those currently proposed for statistical machine translation systems.
520 # $a Grammars are gaining importance in statistical natural language processing and computational biology as a means of encoding theories and structuring algorithms. But one serious obstacle to applications of grammars is that formal language theory traditionally classifies grammars according to their weak generative capacity (WGC)---what sets of strings they generate---and tends to ignore strong generative capacity (SGC)---what sets of structural descriptions they generate---even though the latter is more relevant to applications.
520 # $a The first area is statistical parsing. We find that, in this domain, attempts to increase the SGC of a formalism can often be compiled back into the simpler formalism, gaining nothing. But this suggests a new view of current parsing models as compiled versions of grammars from richer formalisms. We discuss the implications of this view and its implementation in a probabilistic tree-adjoining grammar model, with experimental results on English and Chinese.
520 # $a These results should pave the way for theoretical research to pursue results that are more directed towards applications, and for practical research to explore the use of advanced grammar formalisms more easily.
520 # $a This dissertation develops and demonstrates, for the first time, a framework for carrying out rigorous comparisons of grammar formalisms in terms of their usefulness for applications. We do so by adopting Miller's view of SGC as pertaining not directly to structural descriptions but their interpretations in particular domains; and, following Joshi et al., by appropriately constraining the grammars and interpretations we consider. We then consider three areas of application.
590 $a School code: 0175.
650 # 0 $a Computer Science. $3 212513
690 $a 0984
710 0 # $a University of Pennsylvania. $3 212781
773 0 # $g 65-06B. $t Dissertation Abstracts International
790 $a 0175
790 1 0 $a Joshi, Aravind K., $e advisor
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://libsw.nuk.edu.tw:81/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3137994 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3137994