Natural Language Processing

Question 1

Context free grammars

Answer 1

CFGs are a very powerful mechanism,
and can handle most syntactic aspects
of natural languages

Question 2

What does a grammar look like?

Answer 2

• The → symbol is used to
  define the rules
• The symbols s, np, vp,
  det, n, v are called the
  non-terminal symbols
• The symbols in italics are
  the terminal symbols:
  the, a, man

Question 3

Parse trees

Answer 3

Trees representing the syntactic
structure of a string are often called
parse trees

Question 4

Recogniser

Answer 4

a recogniser is a program that correctly classifies strings as grammatical or
ungrammatical

Question 5

Parser

Answer 5

A context free parser correctly decides
whether a string belongs to the
language generated by a context free
grammar
* And it also tells us what its structure is

Question 6

Definite Clause Grammars

Answer 6

for writing grammars that hides the underlying difference list variables