Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


osu1118867950.pdf (555.22 KB)

ETD Abstract Container

Abstract Header

Generalized ID/LP grammar: a formalism for parsing linearization-based HPSG grammars

Daniels, Michael W.
http://rave.ohiolink.edu/etdc/view?acc_num=osu1118867950

Abstract Details

2005, Doctor of Philosophy, Ohio State University, Linguistics.
This dissertation motivates and describes the Generalized Immediate Dominance/Linear Precedence (GIDLP) formalism: a formalism capable of serving as a processing backbone for linearization-based grammars in the Head Driven Phrase Structure Grammar (HPSG) framework. Complementing the work on the formalism, the thesis defines and implements an efficient parsing algorithm for GIDLP grammars. Representing a prominent tradition within HPSG, linearization-based HPSG assumes that the domain of word order can be larger than the local tree. This supports elegant and general linguistic analyses for (relatively) free word order languages, including the possibility of licensing discontinuous constituents. For processing with an HPSG grammar, most systems depend on parsing algorithms that make use of a phrase structure backbone – a part of the grammar that has been set aside and given a distinguished role in the parsing process – thereby contrasting with those that view parsing as a general constraint solving task, where general methods for logical reasoning are to be applied to the constraints present in an HPSG grammar. Processing backbones support efficient parsing algorithms, but they restrict the class of HPSG theories that can be encoded to those employing a phrase structure backbone, which excludes linearization-HPSG grammars. The GIDLP formalism solves the dilemma between the desire to encode linguistically general and elegant linearization-HPSG analyses and the need for a processing backbone. GIDLP allows linguists to specify grammars with linear precedence constraints that operate within explicitly declared word order domains extending beyond the local tree as well as immediate dominance rules in which the grammar writer can arrange the right-hand side as to minimize the number of parsing hypotheses that must be explored. The GIDLP parsing algorithm developed in the thesis supports efficient processing by making direct use of linear precedence constraints during parsing.
W. Detmar Meurers (Advisor)
187 p.
Language, Linguistics
parsing; backbone; linearization; HPSG; free word order

Recommended Citations

Citations

  • Daniels, M. W. (2005). Generalized ID/LP grammar: a formalism for parsing linearization-based HPSG grammars [Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1118867950

    APA Style (7th edition)

  • Daniels, Michael. Generalized ID/LP grammar: a formalism for parsing linearization-based HPSG grammars. 2005. Ohio State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1118867950.

    MLA Style (8th edition)

  • Daniels, Michael. "Generalized ID/LP grammar: a formalism for parsing linearization-based HPSG grammars." Doctoral dissertation, Ohio State University, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=osu1118867950

    Chicago Manual of Style (17th edition)

osu1118867950
1,043
© 2005, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.