This note covers the following topics: finite
state automata, finite state parsers and transducers, finite state methods in
natural language processing, recursive transition networks (RTNs), RTN
transducers and ATNs, definite clause grammars, bottom up parsing, top down
parsing, using bottom up and top down information for parsing, passive chart
parsing, bottom-up active chart parsing, top-down active chart parsing, feature
structures, parsing feature-based grammars, natural language generation- a
topdown generator.
Author(s): Patrick
Blackburn and Kristina Striegnitz
This PDF covers the
following topics related to Prolog : Introduction, How Do You Learn A
Programming Language, Defining your own procedures, Variables,
Tests, Returning results by instantiation, “Facts”, Simple tracing, Backtracking
in more detail, Summary so far, Circularity and loops.
This PDF covers the following
topics related to Prolog : Getting Started, Standard Programming Style, Prolog
Terms, Unification, Expressing disjunctive subgoals, Evaluating numerical
expressions, Negation, Cuts, Using Cuts to Specify Defaults, Just One More Thing
About Cuts, Some Common Techniques, Efficiency Considerations, Definite Clause
Grammars.
The contents include:
Introduction, Knowledge Representation, Prolog’s Search Strategy, Unification, Recursion and Lists, The
Box Model of Execution, Programming Techniques and List Processing, Control and Negation,
Parsing in Prolog, Modifying the Search Space, Prolog Syntax, Operators, Advanced Features.
This note
covers the following topics in prolog: Facts about prolog, query in Prolog
system, prolog Programs, Matching, Programming Style, Internal Representation,
The Bar Notation, Appending Lists, Arithmetic Expressions in Prolog, Matching
vs. Arithmetic Evaluation, Relations, Defining Operators, Backtracking, Cuts and
Negation.