Show simple item record

dc.contributor.authorNederhof, Mark-Jan
dc.contributor.authorSatta, Giorgio
dc.contributor.authorShieber, Stuart
dc.date.accessioned2008-11-10T19:44:29Z
dc.date.issued2003
dc.identifier.citationMark-Jan Nederhof, Giorgio Satta, and Stuart M. Shieber. Partially ordered multiset context-free grammars and ID/LP parsing. In Proceedings of the Eighth International Workshop on Parsing Technologies, pages 171-182, Nancy, France, April 2003.en
dc.identifier.urihttp://nrs.harvard.edu/urn-3:HUL.InstRepos:2252599
dc.description.abstractWe present a new formalism, partially ordered multiset context-free grammars (poms-CFG), along with an Earley-style parsing algorithm. The formalism, which can be thought of as a generalization of context-free grammars with partially ordered right-hand sides, is of interest in its own right, and also as infrastructure for obtaining tighter complexity bounds for more expressive context-free formalisms intended to express free or multiple word-order, such as ID/LP grammars. We reduce ID/LP grammars to poms-grammars, thereby getting finer-grained bounds on the parsing complexity of ID/LP grammars. We argue that in practice, the width of attested ID/LP grammars is small, yielding effectively polynomial time complexity for ID/LP grammar parsing.en
dc.description.sponsorshipEngineering and Applied Sciencesen
dc.language.isoen_USen
dc.publisherAssociation for Computational Linguisticsen
dc.relation.isversionofhttp://hmi.ewi.utwente.nl/sigparse/iwpt2003/shieber.pdfen
dash.licenseLAA
dc.titlePartially ordered multiset context-free grammars and ID/LP parsingen
dc.relation.journalProceedings of the Eighth International Workshop on Parsing Technologiesen
dash.depositing.authorShieber, Stuart
dash.identifier.orcid0000-0002-7733-8195*
dash.contributor.affiliatedShieber, Stuart


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record