| other,26-1-P93-1014,ak | Kasper-Rounds logic </term> to handle <term> | relational grammar analyses | </term> . We first introduce the key aspects | #25497 We present an implemented unification-based parser for relational grammars developed within the stratified feature grammar (SFG) framework, which generalizes Kasper-Rounds logic to handlerelational grammar analyses. | |
| tech,7-4-P93-1014,ak | operation </term> is essentially ordinary <term> | feature-structure unification | </term> augmented with an operation of <term> | #25542 The basic parsing operation is essentially ordinaryfeature-structure unification augmented with an operation of label unification to build the stratified features characteristic of SFG. | |
| tech,14-4-P93-1014,ak | </term> augmented with an operation of <term> | label unification | </term> to build the <term> stratified features | #25549 The basic parsing operation is essentially ordinary feature-structure unification augmented with an operation oflabel unification to build the stratified features characteristic of SFG. | |
| model,19-4-P93-1014,ak | label unification </term> to build the <term> | stratified features | </term> characteristic of <term> SFG </term> | #25554 The basic parsing operation is essentially ordinary feature-structure unification augmented with an operation of label unification to build thestratified features characteristic of SFG. | |
| tech,4-1-P93-1014,ak | </term> . We present an implemented <term> | unification-based parser | </term> for <term> relational grammars </term> | #25475 We present an implementedunification-based parser for relational grammars developed within the stratified feature grammar (SFG) framework, which generalizes Kasper-Rounds logic to handle relational grammar analyses. | |
| other,7-2-P93-1014,ak | first introduce the key aspects of <term> | SFG | </term> and a lexicalized , graph-based variant | #25508 We first introduce the key aspects ofSFG and a lexicalized, graph-based variant of the framework suitable for implementing relational grammars. | |
| other,23-4-P93-1014,ak | stratified features </term> characteristic of <term> | SFG | </term> . The authors propose a model for | #25558 The basic parsing operation is essentially ordinary feature-structure unification augmented with an operation of label unification to build the stratified features characteristic ofSFG. | |
| other,7-1-P93-1014,ak | unification-based parser </term> for <term> | relational grammars | </term> developed within the <term> stratified | #25478 We present an implemented unification-based parser forrelational grammars developed within the stratified feature grammar (SFG) framework, which generalizes Kasper-Rounds logic to handle relational grammar analyses. | |
| other,20-2-P93-1014,ak | framework suitable for implementing <term> | relational grammars | </term> . We then describe a <term> head-driven | #25521 We first introduce the key aspects of SFG and a lexicalized, graph-based variant of the framework suitable for implementingrelational grammars. | |
| tech,1-4-P93-1014,ak | for <term> lexicalized SFG </term> . The <term> | basic parsing operation | </term> is essentially ordinary <term> feature-structure | #25536 Thebasic parsing operation is essentially ordinary feature-structure unification augmented with an operation of label unification to build the stratified features characteristic of SFG. | |
| other,22-1-P93-1014,ak | framework </term> , which generalizes <term> | Kasper-Rounds logic | </term> to handle <term> relational grammar | #25493 We present an implemented unification-based parser for relational grammars developed within the stratified feature grammar (SFG) framework, which generalizesKasper-Rounds logic to handle relational grammar analyses. | |
| tech,4-3-P93-1014,ak | grammars </term> . We then describe a <term> | head-driven chart parser | </term> for <term> lexicalized SFG </term> . | #25528 We then describe ahead-driven chart parser for lexicalized SFG. | |
| other,8-3-P93-1014,ak | head-driven chart parser </term> for <term> | lexicalized SFG | </term> . The <term> basic parsing operation | #25532 We then describe a head-driven chart parser forlexicalized SFG. | |
| other,12-1-P93-1014,ak | grammars </term> developed within the <term> | stratified feature grammar ( SFG ) framework | </term> , which generalizes <term> Kasper-Rounds | #25483 We present an implemented unification-based parser for relational grammars developed within thestratified feature grammar ( SFG ) framework, which generalizes Kasper-Rounds logic to handle relational grammar analyses. |
