DMCA
Quasi-Destructive Graph Unification (1991)
Cached
Download Links
- [acl.ldc.upenn.edu]
- [aclweb.org]
- [www.aclweb.org]
- [ucrel.lancs.ac.uk]
- [aclweb.org]
- [aclweb.org]
- [wing.comp.nus.edu.sg]
- [wing.comp.nus.edu.sg]
- DBLP
Other Repositories/Bibliography
by
Hideto Tomabechi
| Venue: | In Proceedings of the 29th Annual Meeting of the ACL |
| Citations: | 28 - 1 self |
BibTeX
@INPROCEEDINGS{Tomabechi91quasi-destructivegraph,
author = {Hideto Tomabechi},
title = {Quasi-Destructive Graph Unification},
booktitle = {In Proceedings of the 29th Annual Meeting of the ACL},
year = {1991},
pages = {315--322}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Graph unification is the most expensive part of unification-based grammar parsing. It often takes over 90% of the total paxsing time of a sentence. We focus on two speed-up elements in the design of unification algorithms: 1) elimination of excessive copying by only copying successful unifications, 2) Finding unification failures as soon as possible.
