DUCHIER, DENYS, CLAIRE GARDENT, & JOACHIM NIEHREN, 1998. Concurrent constraint programming in Oz for natural language processing. Lecture notes, Universitat des Saarlandes. Version 1.2.0.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....microplanning. Triggered by previous experience with the benefits of constraint based representation and solution strategies, we decided to try and tackle the tasks as constraint problems. While there is previous work on using constraint programming for parsing and semantic representation (cf. [3, 6, 8]) it has seen little attention in natural language generation (NLG) This work demonstrates a successful application of constraint programming to NLG problems. 1.2 Why Implement Yet Another Solver For several reasons, we decided to create our own solver rather than using an existing one. ....

Denys Duchier, Claire Gardent and Joachim Niehren, Concurrent Constraint Programming in Oz for Natural Language Processing, lecture notes, Universitat des Saarlandes, Saarbrucken, 1999 http://www.ps.uni-sb.de/#niehren/oz-natural-language-script.html

....steps (where the constraints propagate information amongst themselves) with distribution steps (where a choice is selected in a choice point) See, e.g. 106] for more explanation. This approach is widely applicable. For example, it is being applied successfully to computational linguistics [30, 59, 31]. In this section, we show how to solve a simple integer puzzle. Consider the problem of finding nine distinct digits A, B, I , so that the following equation holds: A BC D EF G HI = 1 Here, BC represents the integer 10 B C. As a constraint problem, this can be specified as follows: ....

Denys Duchier, Claire Gardent, and Joachim Niehren. Concurrent constraint programming in Oz for natural language processing. Lecture notes, http://www.ps.uni-sb.de/~niehren/oz-natural-language-script.html, 1999.

.... , because it alternates propagation steps (where the constraints propagate information amongst themselves) with distribution steps (where a choice is selected in a choice point) 75] This approach is widely applicable. For example, it is being applied successfully to natural language processing [17, 40, 18]. In this section, we show how to solve a simple integer puzzle. Consider the problem of nding nine distinct digits A, B, I , so that the following equation holds: A=BC D=EF G=HI = 1 As a constraint problem, this can be speci ed as follows: functor Fractions Name of module ....

Denys Duchier, Claire Gardent, and Joachim Niehren. Concurrent constraint programming in Oz for natural language processing. Lecture notes, http://www.ps.uni-sb.de/~niehren/oz-natural-language-script.html, 1999.

....alternates propagation steps (where the constraints propagate 9 information amongst themselves) with distribution steps (where a choice is selected in a choice point) 71] This approach appears to be widely applicable. For example, it is being applied successfully to natural language processing [17, 39, 18]. In this section, we show how to solve a simple integer puzzle. Consider the problem of finding nine distinct digits A, B, I , so that the following equation holds: A=BC D=EF G=HI = 1 As a constraint problem, this can be specified as follows: declare functor Fractions Name of module ....

Denys Duchier, Claire Gardent, and Joachim Niehren. Concurrent constraint programming in Oz for natural language processing. Lecture notes, http://www.ps.uni-sb.de/~niehren/oz-natural-language-script.html, 1999.

....apply to finite domain, finite set, and arithmetic constraints. Modern constraint technology allows the programmer to combine these algorithms at a high level of abstraction. Computational linguistics has only recently been discovered as an application of CP and the related technology. Duchier (1999) presented an approach to parsing dependency grammar which is based on constraint programming with finite sets. Koller et al. 1998) applied constraint programming to semantic underspecification, and Duchier and Gardent (1999) to discourse. In all of these instances, ambiguities cause ....

....only recently been discovered as an application of CP and the related technology. Duchier (1999) presented an approach to parsing dependency grammar which is based on constraint programming with finite sets. Koller et al. 1998) applied constraint programming to semantic underspecification, and Duchier and Gardent (1999), to discourse. In all of these instances, ambiguities cause combinatoric problems: The number of readings can grow exponentially with the number of ambiguities. This makes them a natural application of CP. The goal of coping with this combinatoric explosion of ambiguities is shared by the ....

[Article contains additional citation context not shown here]

Duchier, D., C. Gardent, and J. Niehren. 1999. Concurrent constraint programming in Oz for natural language processing. Lecture notes, http: //www.ps.uni-sb.de/~niehren/oz-natural-language-script.html.

No context found.

DUCHIER, DENYS, CLAIRE GARDENT, & JOACHIM NIEHREN, 1998. Concurrent constraint programming in Oz for natural language processing. Lecture notes, Universitat des Saarlandes. Version 1.2.0.

No context found.

Duchier, D., C. Gardent and J. Niehren, "Concurrent Constraint Programming in Oz for Natural Language Processing," Programming Systems Lab, Universitat des Saarlandes, Germany, 1998.

No context found.

Duchier, D.; Gardent, C.; Niehren,J. Language. Concurrent Constraint Programming in Oz for Natural Processing, 1998. Programming Systems Lab, Universitt des Saarlandes, Germany.

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