Christopher C. Yang and Ming-Hsuan Yang. Constraint networks: A survey. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, volume 2, pages 1930-1935, 1997.  Home/Search   Document Details and Download   Summary   Related Articles

....the ambiguity is then successively reduced. Constraint Dependency Grammar (CDG) as first defined by Maruyama [3, 35, 36] is an example of a grammar based on eliminative parsing. In CDG, the decision criteria for deletion of parse structures is formulated as a constraint satisfaction problem (CSP) [37] where the constraints are the grammar rules and the solutions are the parses. Thus, ambiguity is successively reduced towards a single parse by deleting illegal, or less preferred, partial structural descriptions from the set of solutions. 2.4 Corpora For Natural Language Learning For both ....

....= or predicates joined by the logical con nectives and, or, or not. This is a first order predicate calculus formula over all roles that requires that an assignment of RVs to roles be consistent with the formula. Thus, parsing is formulated as a Constraint Satisfaction Problem (CSP) [37] where the solutions of the CSP are the parses. Several access functions are defined for accessing the needed grammatical infor mation associated with an RV in order to test it for grammaticality in C. These include: pos x) which returns the position of the word for the RV assigned to x (cat ....

Christopher C. Yang and Ming-Hsuan Yang. Constraint networks: A survey. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, volume 2, pages 1930-1935, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC