Ax Grammars for Natural Languages
Ax Grammars for Natural Languages
复制标题
自然语言的 Axe 语法
DOI:
--
复制
发表时间:
1991
期刊:
影响因子:
--
通讯作者:
H. Koster
中科院分区:
文献类型:
--
作者:
H. Koster
AAx Grammars over a Finite Lattice (agfls), a simple form of two-level grammars admitting quite eecient implementations, are proposed as a formalism to express the syntax of natural languages. In this paper the concepts and notation of agfls are described. A brief example is given of their use in describing a fragment of the English language, followed by a discussion of issues like parsing and ambiguity. 1 Informatics and Linguistics Informatics and Linguistics have a common interest in syntax. In the sixties of this century the emerging science of Informatics wholeheartedly embraced the theory of Formal Languages, which was already at that time available from Logics and Mathematical Linguistics. In the next decades, informaticians have greatly enlarged and enriched Formal Language theory. They have devised eecient parsing algorithms and put the theory to useful work in the description of programming languages and the construction of compilers, software engineering environments, interactive user interfaces and other forms of syntax-directed software. This whole body of theory and practice is available in its turn to modern Linguistics. Informatics can now pay back its historical debt to Linguistics | with interest. 1.1 On a division of labour Linguists should not write programs. To begin with, they are ill-equipped and ill-educated for the profession of software developer. Furthermore, a fascination with programming tends to keep them from exercising their own speciality. Linguists should write grammars rather than programs. Linguistic knowledge encapsulated in a program is like a corpse in a white-plastered grave. Even if the program works correctly and eeciently, it is doomed to disappear in the end, due to lack of maintenance. Nobody shall resuscitate the knowledge from the ashes of a C-program or LISP-program: we can be sure the programmer has reveled in the exploitation of clever tricks and could not be bothered to write documentation. On the other hand, a grammar is a pure" description, without any operational considerations, which admits of many different implementations. A grammar can serve as the basis of many dierent pieces of