other,5-1-P06-1018,bq |
This paper proposes a generic
<term>
mathematical formalism
</term>
for the combination of various
<term>
structures
</term>
:
<term>
strings
</term>
,
<term>
trees
</term>
,
<term>
dags
</term>
,
<term>
graphs
</term>
, and products of them .
|
#11050
This paper proposes a genericmathematical formalism for the combination of various structures: strings, trees, dags, graphs, and products of them. |
other,12-1-P06-1018,bq |
This paper proposes a generic
<term>
mathematical formalism
</term>
for the combination of various
<term>
structures
</term>
:
<term>
strings
</term>
,
<term>
trees
</term>
,
<term>
dags
</term>
,
<term>
graphs
</term>
, and products of them .
|
#11057
This paper proposes a generic mathematical formalism for the combination of variousstructures: strings, trees, dags, graphs, and products of them. |
other,14-1-P06-1018,bq |
This paper proposes a generic
<term>
mathematical formalism
</term>
for the combination of various
<term>
structures
</term>
:
<term>
strings
</term>
,
<term>
trees
</term>
,
<term>
dags
</term>
,
<term>
graphs
</term>
, and products of them .
|
#11059
This paper proposes a generic mathematical formalism for the combination of various structures:strings, trees, dags, graphs, and products of them. |
other,16-1-P06-1018,bq |
This paper proposes a generic
<term>
mathematical formalism
</term>
for the combination of various
<term>
structures
</term>
:
<term>
strings
</term>
,
<term>
trees
</term>
,
<term>
dags
</term>
,
<term>
graphs
</term>
, and products of them .
|
#11061
This 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,bq |
This paper proposes a generic
<term>
mathematical formalism
</term>
for the combination of various
<term>
structures
</term>
:
<term>
strings
</term>
,
<term>
trees
</term>
,
<term>
dags
</term>
,
<term>
graphs
</term>
, and products of them .
|
#11063
This 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,bq |
This paper proposes a generic
<term>
mathematical formalism
</term>
for the combination of various
<term>
structures
</term>
:
<term>
strings
</term>
,
<term>
trees
</term>
,
<term>
dags
</term>
,
<term>
graphs
</term>
, and products of them .
|
#11065
This 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,bq |
The
<term>
polarization
</term>
of the objects of the
<term>
elementary structures
</term>
controls the
<term>
saturation
</term>
of the final
<term>
structure
</term>
.
|
#11073
Thepolarization of the objects of the elementary structures controls the saturation of the final structure. |
other,7-2-P06-1018,bq |
The
<term>
polarization
</term>
of the objects of the
<term>
elementary structures
</term>
controls the
<term>
saturation
</term>
of the final
<term>
structure
</term>
.
|
#11079
The polarization of the objects of theelementary structures controls the saturation of the final structure. |
other,11-2-P06-1018,bq |
The
<term>
polarization
</term>
of the objects of the
<term>
elementary structures
</term>
controls the
<term>
saturation
</term>
of the final
<term>
structure
</term>
.
|
#11083
The polarization of the objects of the elementary structures controls thesaturation of the final structure. |
other,15-2-P06-1018,bq |
The
<term>
polarization
</term>
of the objects of the
<term>
elementary structures
</term>
controls the
<term>
saturation
</term>
of the final
<term>
structure
</term>
.
|
#11087
The polarization of the objects of the elementary structures controls the saturation of the finalstructure. |
other,12-3-P06-1018,bq |
This formalism is both elementary and powerful enough to strongly simulate many
<term>
grammar formalisms
</term>
, such as
<term>
rewriting systems
</term>
,
<term>
dependency grammars
</term>
,
<term>
TAG
</term>
,
<term>
HPSG
</term>
and
<term>
LFG
</term>
.
|
#11101
This 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,bq |
This formalism is both elementary and powerful enough to strongly simulate many
<term>
grammar formalisms
</term>
, such as
<term>
rewriting systems
</term>
,
<term>
dependency grammars
</term>
,
<term>
TAG
</term>
,
<term>
HPSG
</term>
and
<term>
LFG
</term>
.
|
#11106
This 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,bq |
This formalism is both elementary and powerful enough to strongly simulate many
<term>
grammar formalisms
</term>
, such as
<term>
rewriting systems
</term>
,
<term>
dependency grammars
</term>
,
<term>
TAG
</term>
,
<term>
HPSG
</term>
and
<term>
LFG
</term>
.
|
#11109
This 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,bq |
This formalism is both elementary and powerful enough to strongly simulate many
<term>
grammar formalisms
</term>
, such as
<term>
rewriting systems
</term>
,
<term>
dependency grammars
</term>
,
<term>
TAG
</term>
,
<term>
HPSG
</term>
and
<term>
LFG
</term>
.
|
#11112
This 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,bq |
This formalism is both elementary and powerful enough to strongly simulate many
<term>
grammar formalisms
</term>
, such as
<term>
rewriting systems
</term>
,
<term>
dependency grammars
</term>
,
<term>
TAG
</term>
,
<term>
HPSG
</term>
and
<term>
LFG
</term>
.
|
#11114
This 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,bq |
This formalism is both elementary and powerful enough to strongly simulate many
<term>
grammar formalisms
</term>
, such as
<term>
rewriting systems
</term>
,
<term>
dependency grammars
</term>
,
<term>
TAG
</term>
,
<term>
HPSG
</term>
and
<term>
LFG
</term>
.
|
#11116
This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency grammars, TAG, HPSG andLFG. |