| other,3-1-P01-1047,ak | We provide a <term> logical definition </term> of <term> Minimalist grammars </term> , that are <term> Stabler 's formalization </term> of <term> Chomsky 's minimalist program </term> . | #1930 We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. | |
| other,1-2-P01-1047,ak | Our <term> logical definition </term> leads to a neat relation to <term> categorial grammar </term> , ( yielding a treatment of <term> Montague semantics </term> ) , a <term> parsing-as-deduction </term> in a <term> resource sensitive logic </term> , and a <term> learning algorithm </term> from <term> structured data </term> ( based on a <term> typing-algorithm </term> and <term> type-unification </term> ) . | #1948 Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-as-deduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification). | |
| other,9-2-P01-1047,ak | Our <term> logical definition </term> leads to a neat relation to <term> categorial grammar </term> , ( yielding a treatment of <term> Montague semantics </term> ) , a <term> parsing-as-deduction </term> in a <term> resource sensitive logic </term> , and a <term> learning algorithm </term> from <term> structured data </term> ( based on a <term> typing-algorithm </term> and <term> type-unification </term> ) . | #1956 Our logical definition leads to a neat relation to categorial grammar , (yielding a treatment of Montague semantics), a parsing-as-deduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification). |
