-
Since the number searches involved is large it makes sense to
impose certain constraints on the way in which features are
matched
-
Start and End point Constraint:The start and end point
are assumed to match with reasonable degree so that t(1) and
r(1) are paired and so does t(I) and r(J)
-
Monotonicity: The path should be monotonic such that
ik-1 < ik and jk-1 < jk
-
Global Path Constraints:This specifies the amount of
compression or expansion of long stretches of test string when
mapped to the reference string
-
Itakura Constraint sets this to be slope between -1/2 and
2. When I=J, this reduces the cost to I2/3 instead
of I2 without the constraint
-
Additional constraints can be imposed depending upon the nature
and complexity of the search