Index

Symbols

(-)bound: 10.4.1 Lambda-Abstraction

-abstraction: 10.4.1 Lambda-Abstraction

-conversion: 10.4.8 [Sidetrack:] Alpha-Conversion

-equivalent: 10.4.8 [Sidetrack:] Alpha-Conversion

-reduction: 10.4.2 Reducing Complex Expressions

A

abstracted over: 10.4.1 Lambda-Abstraction

active arc: 9 Active Chart Parsing, 9.1 Active Edges

active edge: 9.1 Active Edges, 9 Active Chart Parsing

affix: 2.3.1 Morphology

agenda: 9.2 The Fundamental Rule, 9.3 Using an Agenda

algorithm: 6.3 An Example Run

alphabet: 1.2 Some Examples

ambiguity: 5.1.2 The Tree Admissibility Interpretation

atomic formula: 10.2.3 Building Formulas

B

bottom-up parsing and recognition: 6 Parsing: Bottom-Up and Top-Down, 6.1 Bottom-Up Parsing and Recognition

bound variable: 10.2.3 Building Formulas, 10.2.4 Bound and Free Variables

breadth-first: 6.5.1 The General Idea

C

chart parsing: 6.4.3 [Sidetrack] Using a Chart, 8.1 Motivation

concatenation: 3.1.3 Definition of Regular Expressions

confluence: 10.4.3 Using Lambdas

constant symbol: 10.2.1 Vocabularies

context free: 5.1.1 The Basics

context free grammar: 5.1.1 The Basics

context free rule: 5.1.1 The Basics

D

Definite Clause Grammar: 5.1.3 A Little Grammar of English

depth-first: 6.5.1 The General Idea

derivation: 5.1.1 The Basics

derivation (morphological): 2.3.1 Morphology

dialogue act: 4.6.3 Beyond finite state techniques

dynamic: 8.3.1 Database manipulation

E

exponential: 6.4.3 [Sidetrack] Using a Chart

extraction: 5.3.1 Relative Clauses

F

failure driven loop: 8.3.2 Failure Driven Loops

feature: 5.2.3 DCGs give us a Natural Notation for Features

final state: 1.1.1 A Simple Machine that can laugh

finite state automaton: 1.1.2 Finite State Automata

finite state generator: 1.1.1 A Simple Machine that can laugh

finite state machine: 1.1.2 Finite State Automata

finite state parser: 2 Finite State Parsers and Transducers

finite state transducer: 2.1.3 Separating out the Lexicon

first-order language: 10.2.1 Vocabularies, 10.2.2 First-Order Languages

formal language: 1.1.2 Finite State Automata

free variable: 10.2.3 Building Formulas, 10.2.4 Bound and Free Variables

FSA: 1.1.2 Finite State Automata

FSM: 1.1.2 Finite State Automata

functional application: 10.4.2 Reducing Complex Expressions

fundamental rule: 9.2 The Fundamental Rule

G

gap: 5.3.1 Relative Clauses

I

inflection: 2.3.1 Morphology

input tape: 1.1.2 Finite State Automata

J

jump arc: 1.2 Some Examples

K

Kleene closure: 3.1.3 Definition of Regular Expressions

L

language accepted: 1.1.2 Finite State Automata

language generated: 1.1.2 Finite State Automata

language generated by a context free grammar: 5.1.1 The Basics

left-corner parsing: 7.1.3 Combining Top-down and Bottom-up Information

left-corner table: 7.3 Using Left-corner Tables

left corner: 7.1.3 Combining Top-down and Bottom-up Information

lexical rule: 5.1.3 A Little Grammar of English

local ambiguity: 5.1.3 A Little Grammar of English

M

matrix: 10.2.3 Building Formulas

meaning construction: 9.8 Exercise

meaning representation: 10.1 Introduction

morpheme: 2.3.1 Morphology

movement: 5.3.1 Relative Clauses

N

name: 10.2.1 Vocabularies

non-deterministic: 1.3 Deterministic vs. Non-deterministic FSAs

non-terminal symbol: 5.1.1 The Basics

O

Occurs-Check: 5.3.6 Occurs-Check

output tape: 1.1.2 Finite State Automata

P

parser: 2 Finite State Parsers and Transducers

parse tree: 5.1.2 The Tree Admissibility Interpretation

passive arc: 9.1 Active Edges

passive chart parsing: 8.1 Motivation

passive edge: 9.1 Active Edges

phrase structure grammar: 5.1.3 A Little Grammar of English

phrase structure rule: 5.1.3 A Little Grammar of English

polynomial: 6.4.3 [Sidetrack] Using a Chart

predicate symbol: 10.2.1 Vocabularies

preterminal symbol: 5.1.3 A Little Grammar of English

R

recognizer: 2 Finite State Parsers and Transducers, 1.1.2 Finite State Automata

regular expression: 3.1.3 Definition of Regular Expressions

regular language: 3.1.4 Regular Expressions and FSAs

relation symbol: 10.2.1 Vocabularies

restriction: 10.4.3 Using Lambdas

rewrite arrow: 5.1.1 The Basics

rewrite interpretation: 5.1.1 The Basics

rewrite rule: 5.1.1 The Basics

S

scope: 10.4.3 Using Lambdas, 10.2.3 Building Formulas

search: 1.3 Deterministic vs. Non-deterministic FSAs

sentence: 10.2.4 Bound and Free Variables

sentence symbol: 5.1.1 The Basics

speech act: 4.6.3 Beyond finite state techniques

spurious analysis: 5.3.3 A Second DCG

start state: 1.1.1 A Simple Machine that can laugh

start symbol: 5.1.1 The Basics

stem: 2.3.1 Morphology

subcategorize: 5.3.2 A First DCG

syntactic structure: 10.3.2 Being Systematic (II)

T

tape: 2.2.1 What are Finite State Transducers?

term: 10.2.3 Building Formulas, 10.2.2 First-Order Languages

terminal symbol: 5.1.1 The Basics

threading: 5.2.3 DCGs give us a Natural Notation for Features

top-down parsing/recognition: 6.5.1 The General Idea

transition: 1.1.1 A Simple Machine that can laugh

tree admissibility rule: 5.1.2 The Tree Admissibility Interpretation

W

well-formed formula: 10.2.3 Building Formulas