Connectivity in Bag Generation
| dc.creator | Trujillo, Arturo | |
| dc.creator | Berry, Simon | |
| dc.date | 1996-04-30 | |
| dc.date.accessioned | 2026-07-07T09:10:13Z | |
| dc.date.available | 2026-07-07T09:10:13Z | |
| dc.description | This paper presents a pruning technique which can be used to reduce the number of paths searched in rule-based bag generators of the type proposed by \cite{poznanskietal95} and \cite{popowich95}. Pruning the search space in these generators is important given the computational cost of bag generation. The technique relies on a connectivity constraint between the semantic indices associated with each lexical sign in a bag. Testing the algorithm on a range of sentences shows reductions in the generation time and the number of edges constructed. | |
| dc.description | Latex, 6 pages, needs colap.sty. To appear in COLING-96 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9604024 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9604024 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151289 | |
| dc.subject | Computation and Language | |
| dc.title | Connectivity in Bag Generation | |
| dc.type | text |