state-of-the-art . This paper proposes a generic
<term>
mathematical formalism
</term>
for the combination of various structures
#11987This paper proposes a genericmathematical formalism for the combination of various structures: strings, trees, dags, graphs, and products of them.
other,14-1-P06-1018,ak
combination of various structures :
<term>
strings
</term>
,
<term>
trees
</term>
,
<term>
dags
</term>
#11996This paper proposes a generic mathematical formalism for the combination of various structures:strings, trees, dags, graphs, and products of them.
#11998This paper proposes a generic mathematical formalism for the combination of various structures: strings,trees, dags, graphs, and products of them.
other,18-1-P06-1018,ak
strings
</term>
,
<term>
trees
</term>
,
<term>
dags
</term>
,
<term>
graphs
</term>
, and products
#12000This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees,dags, graphs, and products of them.
other,20-1-P06-1018,ak
<term>
trees
</term>
,
<term>
dags
</term>
,
<term>
graphs
</term>
, and products of them . The
<term>
#12002This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags,graphs, and products of them.
other,1-2-P06-1018,ak
</term>
, and products of them . The
<term>
polarization
</term>
of the objects of the elementary
#12010Thepolarization of the objects of the elementary structures controls the saturation of the final structure.
other,11-2-P06-1018,ak
elementary structures controls the
<term>
saturation
</term>
of the final structure . This
<term>
#12020The polarization of the objects of the elementary structures controls thesaturation of the final structure.
other,1-3-P06-1018,ak
</term>
of the final structure . This
<term>
formalism
</term>
is both elementary and powerful enough
#12027Thisformalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency grammars, TAG, HPSG and LFG.
other,12-3-P06-1018,ak
powerful enough to strongly simulate many
<term>
grammar formalisms
</term>
, such as
<term>
rewriting systems
</term>
#12038This formalism is both elementary and powerful enough to strongly simulate manygrammar formalisms, such as rewriting systems, dependency grammars, TAG, HPSG and LFG.
other,17-3-P06-1018,ak
grammar formalisms
</term>
, such as
<term>
rewriting systems
</term>
,
<term>
dependency grammars
</term>
#12043This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such asrewriting systems, dependency grammars, TAG, HPSG and LFG.
other,20-3-P06-1018,ak
as
<term>
rewriting systems
</term>
,
<term>
dependency grammars
</term>
,
<term>
TAG
</term>
,
<term>
HPSG
</term>
#12046This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems,dependency grammars, TAG, HPSG and LFG.
other,23-3-P06-1018,ak
,
<term>
dependency grammars
</term>
,
<term>
TAG
</term>
,
<term>
HPSG
</term>
and
<term>
LFG
</term>
#12049This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency grammars,TAG, HPSG and LFG.
other,25-3-P06-1018,ak
grammars
</term>
,
<term>
TAG
</term>
,
<term>
HPSG
</term>
and
<term>
LFG
</term>
. We present an
#12051This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency grammars, TAG,HPSG and LFG.
other,27-3-P06-1018,ak
<term>
TAG
</term>
,
<term>
HPSG
</term>
and
<term>
LFG
</term>
. We present an efficient
<term>
algorithm
#12053This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency grammars, TAG, HPSG andLFG.