Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Reasoning with taxonomies
A bag of useful techniques for efficient and robust parsing
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
A web-based instructional platform for constraint-based grammar formalisms and parsing
ETMTNLP '02 Proceedings of the ACL-02 Workshop on Effective tools and methodologies for teaching natural language processing and computational linguistics - Volume 1
A generalized-zero-preserving method for compact encoding of concept lattices
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
| Hi-index | 0.00 |
Bit vectors provide a way to compute the existence of least upper bounds in partial orders, which is a fundamental operation needed by any unification-based parser. However, bit vectors have seen relatively little adoption because of their length and associated speed disadvantages. We present a novel bit vector technique based on allowing one-sided errors; the resulting approximate bit vectors can be much shorter than the minimum lengths required by existing techniques that would provide exact answers. We give experimental results showing that our approximate vectors give accurate enough answers to be useful in practice.