Constraint satisfaction for robust parsing of spoken language

Abstract. The eliminative nature of constraint satisfaction over finite domains offers an interesting potentialfor robustness in the parsing of spoken language. An approach is presented that puts unusually ambitious demands on the design of the constraint satisfaction procedure by trying to combine preferential reasoning, dynamic scheduling, parallel processing, and incremental constraint solving, within a coherent solution.