Grammar Formalisms in Computational Linguistics

30-04-2001

Click here to start

Table of Contents

Grammar Formalisms in Computational Linguistics

The Architecture of LFG

Correspondence

Correspondence

Functions

Feature Structures as Functions

Notational Specialty in LFG

Functions and Correspondence

Functions in Rewrite Rules

Functions in Rewrite Rules

Functions in Rewrite Rules

Metavariables

Local Trees and Metavariables

Functions in Rewrite Rules

Functions in Tree Structure

Functions in Rewrite Rules

Functions in Tree Structure

Functions in Rewrite Rules

Tree Structure with Annotations

Metavariables and Functions

Algorithm for Calculating F-Structures from C-Structures

Algorithm for Calculating F-Structures from C-Structures

Functional Annotation

How?

Algorithm for Calculating F-Structures from C-Structures

Variables in the tree

How?

Algorithm for Calculating F-Structures from C-Structures

Solution of metavariables

How?

Algorithm for Calculating F-Structures from C-Structures

Solution of equations

How?

Subsequent steps

Subsequent steps

Author: Pius ten Hacken 

Email: pius.tenhacken@unibas.ch

Home Page: ../Grammar-Formalisms.html