A Minimal GB Parser
OA Version
Citation
Shaban, Marwan. "A Minimal GB Parser", Technical Report BUCS-1993-013, Computer Science Department, Boston University, October 1993. [Available from: http://hdl.handle.net/2144/1467]
Abstract
We describe a GB parser implemented along the lines of those written by Fong [4] and Dorr [2]. The phrase structure recovery component is an implementation of Tomita's generalized LR parsing algorithm (described in [10]), with recursive control flow (similar to Fong's implementation). The major principles implemented are government, binding, bounding, trace theory, case theory, θ-theory, and barriers. The particular version of GB theory we use is that described by Haegeman [5].
The parser is minimal in the sense that it implements the major principles needed in a GB parser, and has fairly good coverage of linguistically interesting portions of the English language.