 |
|
What people are saying - Write a reviewWe haven't found any reviews in the usual places. Related books
Contents
Other editions - View all
Common terms and phrasesalgorithm applied argument Asserting atomic formulas auxiliary backtracking called categorial grammar compiler computation conc concatenation context-free grammars database DCG rule defined definition depth-first derived clauses difference list discussed empty encoding example filler filler-gap dependencies final find finite first function symbols functor goal halts Horn clauses implementation infix input instance instantiation lambda calculus lambda expression language left corner left-corner left-recursive lexical linguistic literal logic programming logical form matching n(program natural-language node nogap nonterminal notation noun phrase np(NP operator optrel parse tree parser partial execution predicate prefix principia problem program clauses Prolog programs Prolog systems proof procedure proof tree pure Prolog quantifier query recursive relative clauses relpron represented scope Section semantic network semantics sentence sequence shrdlu shuffle Shuffled solution specific string positions terminal Terry top-down transition network unification unifier unit clauses variables verb phrase vp(VP wff write wrote(X,Y Popular passagesPage 18 - If at any time the system fails to find a match for a goal, it backtracks, ie it rejects the most recently activated clause, undoing any substitutions made by the match with the head of the clause. Next it reconsiders the original goal which activated the rejected clause, and tries to find a subsequent clause which also matches the goal. Page 14 - A literal is an atomic formula or the negation of an atomic formula. A formula is in conjunctive normal form... Page 55 - The operators < (less than), > (greater than), <= (less than or equal to) and >- (greater than or equal to) all yield 0 if the specified relation is false and 1 if it is true. Page 201 - One of the advantages of this approach is that it is not... Page 109 - English auxiliaries which we will use is the following: a verb phrase can always have an auxiliary prefixed to it if a certain condition holds, namely, that the form of the verb phrase that follows the auxiliary is the form that the auxiliary requires. Page 80 - English, subjects agree with the verb they are the subject of both in person (first, second or third) and in number (singular or plural). For instance, the string "*I writes programs... Page 126 - If A and B are categories then A/B and A\B are categories. Page 65 - Let F be a set of function symbols, and X a set of variables. Page 94 - Execution certain computations that would normally be performed at execution time by changes to the program itself. References to this bookFrom other books
From Google ScholarSemantic-head-driven GenerationFernando CN Pereira - 1990 - Computational Linguistics Can Logic Programming Execute as Fast as Imperative Programming?Peter Lodewijk Van Roy Logic, Programming And PrologUlf Nilsson, Jan Maluszynski The Computational Linguistics of Biological SequencesDavid B Searls References from web pagesProlog and Natural-Language Analysis Prolog and Natural-Language Analysis JSTOR: Prolog and Natural Language Analysis Prolog and Natural-Language Analysis - Digital Edition ... The Online Books Page: Prolog and Natural Language Analysis, by ... Prolog and natural-language analysis Book Reviews: Prolog for Natural Language Processing LG519: Prolog and Natural Language Processing, (I) System : An Introduction to Natural Language Processing through ... An Evaluation of Prolog as a Tool for Natural Language Analysis ... Bibliographic information
|
