Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/130453
DC Field | Value | |
---|---|---|
dc.title | Using a Dependency Structure Parser without any Grammar Formalism to Analyse a Software Manual Corpus | |
dc.contributor.author | Ting, C.H.A. | |
dc.contributor.author | Shiuan, P.L. | |
dc.date.accessioned | 2016-11-16T11:06:08Z | |
dc.date.available | 2016-11-16T11:06:08Z | |
dc.date.issued | 1996 | |
dc.identifier.citation | Ting, C.H.A., Shiuan, P.L. (1996). Using a Dependency Structure Parser without any Grammar Formalism to Analyse a Software Manual Corpus. Using a Dependency Structure Parser without any Grammar Formalism to Analyse a Software Manual Corpus. ScholarBank@NUS Repository. | |
dc.identifier.isbn | 904200102X | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/130453 | |
dc.description.abstract | DESPAR is discussed, a hybrid approach to parsing that is based on an enhanced hidden Markov model & relies on no grammar formalism. The approach is corpus-based & statistical. Implementation builds on the insight of M. Liberman (1993) that dependency parsing is a kind of tagging for parts of speech. DESPAR takes tagged sentences as input, seeks candidate governors for each part of speech, eliminates invalid candidates for governor, & returns a likely dependency structure as output. The enhanced hidden Markov model operates with bigrams & uses a dynamic context algorithm & dependency axioms. The statistical part-of-speech tagger is based on the Brown & Wall Street Journal corpora, totaling almost 180,000 sentences. A module to handle unknown words effectively gives the parser unlimited vocabulary. A divide-and-conquer module simplifies complex sentences before parsing. DESPAR was applied to the software manual corpus in two stages; with original grammar & vocabulary & with added vocabulary. Preprocessing consisted of tokenization. it is concluded that no grammar formalism is required to analyze the dependency structure of a sentence. The performance of the parser could be improved by providing more corpora & by refining the enhanced hidden Markov model to use trigram transitions. L. Lagerquist. | |
dc.source | Scopus | |
dc.type | Book | |
dc.contributor.department | COMPUTATIONAL SCIENCE | |
dc.description.sourcetitle | Using a Dependency Structure Parser without any Grammar Formalism to Analyse a Software Manual Corpus | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.