Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimized Prolog encoding of typed feature structures
Proceedings of the 1999 international conference on Logic programming
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
A technique for counting ones in a binary computer
Communications of the ACM
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Reasoning with taxonomies
A compact architecture for dialogue management based on scripts and meta-outputs
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
Generalized encoding of description spaces and its application to typed feature structures
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Enhancing set constraint solvers with lexicographic bounds
Journal of Heuristics
Approximate bit vectors for fast unification
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
| Hi-index | 0.00 |
Constructing an encoding of a concept lattice using short bit vectors allows for efficient computation of join operations on the lattice. Join is the central operation any unification-based parser must support. We extend the traditional bit vector encoding, which represents join failure using the zero vector, to count any vector with less than a fixed number of one bits as failure. This allows non-joinable elements to share bits, resulting in a smaller vector size. A constraint solver is used to construct the encoding, and a variety of techniques are employed to find near-optimal solutions and handle timeouts. An evaluation is provided comparing the extended representation of failure with traditional bit vector techniques.