| other,9-2-P01-1047,bq | 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> ) . | #1955 Our logical definition leads to a neat relation tocategorial 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,15-1-P01-1047,bq | 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> . | #1941 We provide a logical definition of Minimalist grammars, that are Stabler's formalization ofChomsky 's minimalist program. |
| other,14-3-P01-1047,bq | Here we emphasize the connection to <term> Montague semantics </term> which can be viewed as a <term> formal computation </term> of the <term> logical form </term> . | #2005 Here we emphasize the connection to Montague semantics which can be viewed as aformal computation of the logical form. |
| tech,31-2-P01-1047,bq | 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> ) . | #1977 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 alearning algorithm from structured data (based on a typing-algorithm and type-unification). |
| other,3-1-P01-1047,bq | 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> . | #1929 We provide alogical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. |
| other,1-2-P01-1047,bq | 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> ) . | #1947 Ourlogical 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,18-3-P01-1047,bq | Here we emphasize the connection to <term> Montague semantics </term> which can be viewed as a <term> formal computation </term> of the <term> logical form </term> . | #2009 Here we emphasize the connection to Montague semantics which can be viewed as a formal computation of thelogical form. |
| other,6-1-P01-1047,bq | 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> . | #1932 We provide a logical definition ofMinimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. |
| other,17-2-P01-1047,bq | 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> ) . | #1963 Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment ofMontague 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,6-3-P01-1047,bq | Here we emphasize the connection to <term> Montague semantics </term> which can be viewed as a <term> formal computation </term> of the <term> logical form </term> . | #1997 Here we emphasize the connection toMontague semantics which can be viewed as a formal computation of the logical form. |
| tech,22-2-P01-1047,bq | 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> ) . | #1968 Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), aparsing-as-deduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification). |
| other,25-2-P01-1047,bq | 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> ) . | #1971 Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-as-deduction in aresource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification). |
| other,11-1-P01-1047,bq | 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> . | #1937 We provide a logical definition of Minimalist grammars, that areStabler 's formalization of Chomsky's minimalist program. |
| other,34-2-P01-1047,bq | 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> ) . | #1980 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 fromstructured data (based on a typing-algorithm and type-unification). |
| tech,42-2-P01-1047,bq | 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> ) . | #1988 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 andtype-unification). |
| tech,40-2-P01-1047,bq | 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> ) . | #1986 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 atyping-algorithm and type-unification). |
