next up previous contents
Next: The other chapters Up: Overview Previous: Overview

Towards reversible grammars

An interesting goal for this thesis might have been to devise an interpreter for reversible grammars. This interpreter should indeed compute the relation r for any given r-reversible grammar. However, it is not clear that such an interpreter actually can be built. Even though for each of the r-reversible grammars, programs can be built that compute r, it is not clear that a universal program can be built that accomplishes that task for any given grammar. In other words, even though the p-parsing problem (this notion will be defined in chapter 2) is solvable, by definition, for a fixed reversible grammar, it is not clear that the universal p-parsing problem for reversible grammars is solvable.

The goal of this thesis is more modest. Most attention in the next chapters will be devoted to the development of parsing and generation techniques which improve upon existing techniques with respect to the following two, related, dimensions:

Chapter 3 discusses methods for (grammatical) generation on the basis of constraint-based grammars. A method for generation, called `semantic-head-driven' generation, is introduced and compared with some `top-down' generation techniques, as for example proposed by [108] and [17], and with the chart-based technique of [83]. With respect to the dimensions mentioned above, semantic-head-driven generation is motivated because:

Chapter 4 is devoted to parsing. A method for parsing, called `head-corner' parsing is introduced. Again, this method is compared with competing approaches to parsing along the dimensions of applicability and linguistic deduction:


next up previous contents
Next: The other chapters Up: Overview Previous: Overview
Noord G.J.M. van
1998-09-30