Arc and path consistence revisited
Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Comments on Mohr and Henderson's path consistency algorithm
Artificial Intelligence
Artificial Intelligence - Special issue on knowledge representation
From local to global consistency
Artificial Intelligence
On the inherent level of local consistency in constraint networks
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Arc-consistency and arc-consistency again
Artificial Intelligence
Structural disambiguation with constraint propagation
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Managing Multiple Knowledge Sources In Constraint-Based Parsing Of Spoken Language
Fundamenta Informaticae
The effectiveness of corpus-induced dependency grammars for post-processing speech
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Hi-index | 0.00 |
This paper describes an extension to the constraint satisfaction problem (CSP) called MUSE CSP (MUltiply SEgmented Constraint Satisfaction Problem). This extension is especially useful for those problems which segment into multiple sets of partially shared variables. Such problems arise naturally in signal processing applications including computer vision, speech processing, and handwriting recognition. For these applications, it is often difficult to segment the data in only one way given the low-level information utilized by the segmentation algorithms. MUSE CSP can be used to compactly represent several similar instances of the constraint satisfaction problem. If multiple instances of a CSP have some common variables which have the same domains and constraints, then they can be combined into a single instance of a MUSE CSP, reducing the work required to apply the constraints. We introduce the concepts of MUSE node consistency, MUSE arc consistency, and MUSE path consistency. We then demonstrate how MUSE CSP can be used to compactly represent lexically ambiguous sentences and the multiple sentence hypotheses that are often generated by speech recognition algorithms so that grammar constraints can be used to provide parses for all syntactically correct sentences. Algorithms for MUSE arc and path consistency are provided. Finally, we discuss how to create a MUSE CSP from a set of CSPs which are labeled to indicate when the same variable is shared by more than a single CSP.