| other,5-1-P06-1018,ak | This paper proposes a generic <term> mathematical formalism </term> for the combination of various structures : <term> strings </term> , <term> trees </term> , <term> dags </term> , <term> graphs </term> , and products of them . | #11987 This 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 | This paper proposes a generic <term> mathematical formalism </term> for the combination of various structures : <term> strings </term> , <term> trees </term> , <term> dags </term> , <term> graphs </term> , and products of them . | #11996 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,ak | This paper proposes a generic <term> mathematical formalism </term> for the combination of various structures : <term> strings </term> , <term> trees </term> , <term> dags </term> , <term> graphs </term> , and products of them . | #11998 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,ak | This paper proposes a generic <term> mathematical formalism </term> for the combination of various structures : <term> strings </term> , <term> trees </term> , <term> dags </term> , <term> graphs </term> , and products of them . | #12000 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,ak | This paper proposes a generic <term> mathematical formalism </term> for the combination of various structures : <term> strings </term> , <term> trees </term> , <term> dags </term> , <term> graphs </term> , and products of them . | #12002 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,ak | The <term> polarization </term> of the objects of the elementary structures controls the <term> saturation </term> of the final structure . | #12010 Thepolarization of the objects of the elementary structures controls the saturation of the final structure. | |
| other,11-2-P06-1018,ak | The <term> polarization </term> of the objects of the elementary structures controls the <term> saturation </term> of the final structure . | #12020 The polarization of the objects of the elementary structures controls thesaturation of the final structure. | |
| other,1-3-P06-1018,ak | This <term> formalism </term> 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> . | #12027 Thisformalism 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 | This <term> formalism </term> 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> . | #12038 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,ak | This <term> formalism </term> 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> . | #12043 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,ak | This <term> formalism </term> 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> . | #12046 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,ak | This <term> formalism </term> 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> . | #12049 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,ak | This <term> formalism </term> 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> . | #12051 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,ak | This <term> formalism </term> 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> . | #12053 This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency grammars, TAG, HPSG andLFG. |
