| lr,12-2-P83-1003,ak | sufficient to provide a strongly adequate <term> | grammar | </term> for <term> crossed serial dependencies | #14658 The extension is shown to be sufficient to provide a strongly adequategrammar for crossed serial dependencies, as found in e.g. Dutch subordinate clauses. | |
| other,11-1-P83-1003,ak | formalism </term> is proposed , allowing <term> | non-terminals | </term> to consist of finite sequences of | #14626 An extension to the GPSG grammatical formalism is proposed, allowingnon-terminals to consist of finite sequences of category labels, and allowing schematic variables to range over such sequences. | |
| other,23-1-P83-1003,ak | category labels </term> , and allowing <term> | schematic variables | </term> to range over such sequences . The | #14638 An extension to the GPSG grammatical formalism is proposed, allowing non-terminals to consist of finite sequences of category labels, and allowingschematic variables to range over such sequences. | |
| other,22-2-P83-1003,ak | dependencies </term> , as found in e.g. <term> | Dutch subordinate clauses | </term> . The structures induced for such | #14668 The extension is shown to be sufficient to provide a strongly adequate grammar for crossed serial dependencies, as found in e.g.Dutch subordinate clauses. | |
| tech,14-4-P83-1003,ak | a simple extension to an existing <term> | parsing method | </term> for <term> GPSG </term> . <term> Metagrammatical | #14709 The extension is shown to be parseable by a simple extension to an existingparsing method for GPSG. | |
| other,14-2-P83-1003,ak | strongly adequate <term> grammar </term> for <term> | crossed serial dependencies | </term> , as found in e.g. <term> Dutch subordinate | #14660 The extension is shown to be sufficient to provide a strongly adequate grammar forcrossed serial dependencies, as found in e.g. Dutch subordinate clauses. | |
| other,15-3-P83-1003,ak | more appropriate to data involving <term> | conjunction | </term> than some previous proposals have | #14687 The structures induced for such constructions are argued to be more appropriate to data involvingconjunction than some previous proposals have been. | |
| other,18-1-P83-1003,ak | </term> to consist of finite sequences of <term> | category labels | </term> , and allowing <term> schematic variables | #14633 An extension to the GPSG grammatical formalism is proposed, allowing non-terminals to consist of finite sequences ofcategory labels, and allowing schematic variables to range over such sequences. | |
| other,5-3-P83-1003,ak | </term> . The structures induced for such <term> | constructions | </term> are argued to be more appropriate | #14677 The structures induced for suchconstructions are argued to be more appropriate to data involving conjunction than some previous proposals have been. | |
| other,4-1-P83-1003,ak | dictionary </term> . An extension to the <term> | GPSG grammatical formalism | </term> is proposed , allowing <term> non-terminals | #14619 An extension to theGPSG grammatical formalism is proposed, allowing non-terminals to consist of finite sequences of category labels, and allowing schematic variables to range over such sequences. |
