OpenBU

Structure Sharing and Parallelization in a GB Parser

OpenBU

Show simple item record

dc.contributor.author Shaban, Marwan
dc.date.accessioned 2011-09-12T13:07:15Z
dc.date.available 2011-09-12T13:07:15Z
dc.date.issued 1994-03-22
dc.identifier.uri http://hdl.handle.net/2144/1463
dc.description.abstract By utilizing structure sharing among its parse trees, a GB parser can increase its efficiency dramatically. Using a GB parser which has as its phrase structure recovery component an implementation of Tomita's algorithm (as described in [Tom86]), we investigate how a GB parser can preserve the structure sharing output by Tomita's algorithm. In this report, we discuss the implications of using Tomita's algorithm in GB parsing, and we give some details of the structuresharing parser currently under construction. We also discuss a method of parallelizing a GB parser, and relate it to the existing literature on parallel GB parsing. Our approach to preserving sharing within a shared-packed forest is applicable not only to GB parsing, but anytime we want to preserve structure sharing in a parse forest in the presence of features. en_US
dc.language.iso en_US en_US
dc.publisher Boston University Computer Science Department en_US
dc.relation.ispartofseries BUCS Technical Reports;BUCS-TR-1994-005
dc.title Structure Sharing and Parallelization in a GB Parser en_US
dc.type Technical Report en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search OpenBU


Browse

Deposit Materials

Statistics