Grammar Formalisms Viewed as Evolving Algebras
نویسندگان
چکیده
We consider the use of evolving algebra methods of specifying grammars for natural languages. We are especially interested in distributed evolving algebras. We provide the motivation for doing this, and we give a reconstruction of some classical grammatical formalisms in directly dynamic terms. Finally, we consider some technical questions arising from the use of direct dynamism in grammatical formalisms.
منابع مشابه
Dynamic Interpretations of Constraint-Based Grammar Formalisms
We present a rendering of some common grammatical formalisms in terms of evolving algebras. Though our main concern in this paper is on constraint-based formalisms, we also discuss the more basic case of context-free grammars. Our aim throughout is to highlight the use of evolving algebras as a speci cation tool to obtain grammar formalisms.
متن کاملEvolving Algebras and Mathematical Models of Language
We consider the use of evolving algebra methods of specifying grammars for natural languages. We are especially interested in distributed evolving algebras. We provide the motivation for doing this, and we give a reconstruction of some classical grammatical formalisms in directly dynamic terms. Finally, we consider some technical questions arising from the use of direct dynamism in grammatical ...
متن کاملEvolving algebras and labelled deductivesystems for the semantic network
In the present paper we deal with two approaches suitable to formal treatment of semantical network based reasoning , that are Evolving Algebras (EA) and Labelled Deduc-tive Systems (LDS). The evolving algebras methodology give a tools for precise operational description of the any computational process at the desired level of abstraction, while labelled deduction systems allows to treat variou...
متن کاملSpecifying Complex and Structured Systems with Evolving Algebras
This paper presents an approach for specifying complex structured systems with Evolving Algebras by means of aggregation and composition Evolving algebras provide a formal method for executable speci cations which has been employed for specifying several algorithms and programming languages With its transition system like rule based syntax the concept is as well very intuitive as well suited fo...
متن کاملA Generalized View on Parsing and Translation
We present a formal framework that generalizes a variety of monolingual and synchronous grammar formalisms for parsing and translation. Our framework is based on regular tree grammars that describe derivation trees, which are interpreted in arbitrary algebras. We obtain generic parsing algorithms by exploiting closure properties of regular tree languages.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994