Add to ORKGAbstract. 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. Key words: Constraint-based formalism, evolving algebra 1
This paper describes some of the results of the project The Reusability of Grammatical Resources. Th...
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses...
. Context-free grammars are used in several algebraic specification formalisms instead of first-orde...
We argue in this paper in favor of a fully constraint-based approach in the perspective of grammar d...
We give a precise definition of evolving algebras nondeterministic, mathematical machines. All proof...
We develop a framework for formalizing semantic construction within grammars expressed in typed feat...
Colloque avec actes et comité de lecture. internationale.International audienceThe static or axiomat...
Abstract. A problem for the development of constraint-based formalisms con-cerns (i) the maintainabi...
International audienceWe argue in this paper in favor of a fully constraint-based approach in the pe...
We present an approach specifying constraints on labeled trees, such as are commonly used within (co...
This thesis involves the study of formal properties of grammatical formalisms that are relevant to c...
AbstractA new generalization of context-free grammars is introduced: Boolean grammars allow the use ...
Abstract. The generative conception of grammars relies on the derivation process which, to its turn,...
Grammar formalisms are one of the key representation structures in Computer Science. So it is not su...
The notion of constraints started to occupy a central position in linguistic theories from the intro...
This paper describes some of the results of the project The Reusability of Grammatical Resources. Th...
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses...
. Context-free grammars are used in several algebraic specification formalisms instead of first-orde...
We argue in this paper in favor of a fully constraint-based approach in the perspective of grammar d...
We give a precise definition of evolving algebras nondeterministic, mathematical machines. All proof...
We develop a framework for formalizing semantic construction within grammars expressed in typed feat...
Colloque avec actes et comité de lecture. internationale.International audienceThe static or axiomat...
Abstract. A problem for the development of constraint-based formalisms con-cerns (i) the maintainabi...
International audienceWe argue in this paper in favor of a fully constraint-based approach in the pe...
We present an approach specifying constraints on labeled trees, such as are commonly used within (co...
This thesis involves the study of formal properties of grammatical formalisms that are relevant to c...
AbstractA new generalization of context-free grammars is introduced: Boolean grammars allow the use ...
Abstract. The generative conception of grammars relies on the derivation process which, to its turn,...
Grammar formalisms are one of the key representation structures in Computer Science. So it is not su...
The notion of constraints started to occupy a central position in linguistic theories from the intro...
This paper describes some of the results of the project The Reusability of Grammatical Resources. Th...
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses...
. Context-free grammars are used in several algebraic specification formalisms instead of first-orde...