## Thilo Götz

## Feature Constraint Grammars

**Arbeitspapiere des SFB 340, Bericht Nr. 148 (2000)**, 150pp.

Postscript (1036kb)1-up;
Postscript gzip-komprimiert (294kb)
1-up

### Abstract

*Ph.D. thesis. Seminar für Sprachwissenschaft, Universität
Tübingen, 1999.*
This thesis is concerned with the logical foundations and
computational modeling of constraint-based grammar formalisms. By
computational modeling I understand the testing of the empirical
predictions of a given grammar on a computer. This subsumes, e.g., the
parsing problem: given a grammar and a string, does the grammar
predict that the string is grammatical, or ungrammatical? The logic
under consideration is a typed feature logic, that may be viewed as a
basis for formalizing HPSG grammars. The thesis has a dual focus on
theory and computation. I give algorithms for solving the prediction
problem, and the algorithms are proven correct with respect to the
underlying logic.

Seminar für Sprachwissenschaft

Eberhard-Karls-Universität Tübingen

Wilhelmstraße 113

72074 Tübingen

Germany