978 - 1 - 107 - 01417 - 6 - Unification Grammars
نویسنده
چکیده
Natural languages1 are among Nature’s most extraordinary phenomena. While humans acquire language naturally and use it with great ease, the formalization of language, which is the focus of research in linguistics, remains evasive. As in other sciences, attempts at formalization involve idealization: ignoring exceptions, defining fragments, and the like. In the second half of the twentieth century, the field of linguistics has undergone a revolution: The themes that are studied, the vocabulary with which they are expressed, and the methods and techniques for investigating them have changed dramatically. While the traditional aims of linguistic research have been the description of particular languages (both synchronically and diachronically), sometimes with respect to other, related languages, modern theoretical linguistics seeks the universal principles that underlie all natural languages; it is looking for structural generalizations that hold across languages, as well as across various phrase types in a single language, and it attempts to delimit the class of possible natural languages by formal means. The revolution in linguistics, which is attributed mainly to Noam Chomsky, has influenced the young field of computer science. With the onset of programming languages, research in computer science began to explore different kinds of languages: formal languages that are constructed as a product of concise, rigorous rules. The pioneering work of Chomsky provided the means for applying the results obtained in the study of natural languages to the investigation of formal languages. One of the earliest areas of study in computer science was human cognitive processes, in particular natural languages. This area of research is
منابع مشابه
Learning and Parsing Stochastic Unification-Based Grammars
Stochastic Unification-Based Grammars combine knowledgerich and data-rich approaches to natural language processing. This provides a rich structure to the learning and parsing (decoding) tasks that can be described with undirected graphical models. While most work to date has treated parsing as a straight-forward multi-class classification problem, we are beginning to see how this structure can...
متن کاملLearning Lambek Grammars from Proof Frames
In addition to their limpid interface with semantics, the original categorial grammars introduced by Lambek 55 years ago enjoys another important property: learnability. After a short reminder on grammatical inference à la Gold, we provide an algorithm that learns rigid Lambek grammars with product from proof frames that are name free proof nets a generalisation of functor argument structures t...
متن کاملRough Sets and Learning by Unification
We apply basic notions of the theory of rough sets, due to Pawlak [30, 31], to explicate certain properties of unification-based learning algorithms for categorial grammars, introduced in [6, 11] and further developed in e.g. [18, 19, 24, 25, 26, 9, 28, 14, 15, 3]. The outcomes of these algorithms can be used to compute both the lower and the upper approximation of the searched language with re...
متن کاملHighly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unification grammars. Even with restricted variants of the formalism, off-line parsable grammars, the problem is computationally hard. We present two natural constraints on unification grammars which limit their expressivity an...
متن کاملReversible Unification Based Machine Translation
[n this paper it will be shown how unification g rammars can be used to build a reversible machine t ranslat ion system. Unification g rammars are often used to define the relation between strings and meaning representat ions in a declara t ive way. Such grammars are somet imes used in a bidirecLional way, thus the same grammar is used for both parsing and generation, in this paper 1 will show ...
متن کامل