Modularizing Contexted Constraints

Details Modularizing Contexted Constraints Modularizing Contexted Constraints

1996-06-08

arxiv.org/abs/cmp-lg/9606009v1

Computer Science

Computation and Language

6 pages LaTeX (uses colap.sty)D; To appear in the proceedings of COLING 1996

Scientific paper

This paper describes a method for compiling a constraint-based grammar into a potentially more efficient form for processing. This method takes dependent disjunctions within a constraint formula and factors them into non-interacting groups whenever possible by determining their independence. When a group of dependent disjunctions is split into smaller groups, an exponential amount of redundant information is reduced. At runtime, this means that an exponential amount of processing can be saved as well. Since the performance of an algorithm for processing constraints with dependent disjunctions is highly determined by its input, the transformation presented in this paper should prove beneficial for all such algorithms.

Affiliated with

Also associated with

No associations

Rating

Modularizing Contexted Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Modularizing Contexted Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modularizing Contexted Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-60936