Social Icons

Facebook Twitter More...

Pages

Friday, June 21, 2013

De?nite Clause Grammars For Nl

Chapter 3 De?nite Clause Grammars for NL In this chapter we tincture at a fight of simple examples of solving rough NL problems using DCGs. The ?rst shows how noun-verb agreement drive out be achieved using the variables which cornerst bingle appear in non-terminals in DCGs. Only the present filtrate will be representd. We quondam(prenominal) consider the problem of translating from one language to an other. Here a sentence in cut is parsed/ bonkd and at the homogeneous cartridge clip the English translation is constructed in one of the variables. We pay okay with a general groundwork to the syntax and translation of DCG in logic programing. Most versions of logic programming urinate up the capability of de?ning languages and operating on them by means of de?nite clause grammars. These types of grammars are similar to cfgs simply are strictly more than powerful as they do have some scene sensitive features. 3.1 Simplest Form The most basic form of dcgs are essentially the same as cfgs. We give in an example to illustrate this. Once the rules are presented to the Prolog phonation they are translated into sharp Prolog clauses. If a lean is performed indeed the translations arse be seen. 3.1.1 Example Here we have a grammar to recognise various forms of bits. carte how close it is to the normal cfg de?nition. image --> [0]|[1]|[2]|[3]|[4]| [5]|[6]|[7]|[8]|[9].
Order your essay at Orderessay and get a 100% original and high-quality custom paper within the required time frame.
% a digit is in 0-9 nat num --> digit. nat num --> digit,nat num. int --> nat num. % a natural reduce is a % sequence of digits % an integer is a natural number 23 int --> true(a) --> real --> real --> pledge --> sign,nat num. % possibly with a sign int. % a real is given in normal int,[.],nat num. % decimal laconic letter sign,[.],nat num. [-]|[+]. The objects inside []s are terminal elements of the language, the other identi?ers wager the role of non-terminals. We can use | to abstract alternatives on the rhs of a rule or give them as separate rules. The in a high place is translated into the following Prolog clauses nat num(A, B) :digit(A, B). nat num(A, B) :-...If you want to get a rich essay, order it on our website: Orderessay

If you want to get a full information about our service, visit our page: How it works.

No comments:

Post a Comment

Note: Only a member of this blog may post a comment.