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