| other,3-1-P01-1047,bq | improvements are possible . We provide a <term> | logical definition | </term> of <term> Minimalist grammars </term> | #1929 We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. |
| other,1-2-P01-1047,bq | 's minimalist program </term> . Our <term> | logical definition | </term> leads to a neat relation to <term> | #1947 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,bq | </term> leads to a neat relation to <term> | categorial grammar | </term> , ( yielding a treatment of <term> | #1955 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,14-3-P01-1047,bq | 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 a formal computation of the logical form. |
| other,18-3-P01-1047,bq | <term> formal computation </term> of the <term> | logical form | </term> . <term> Techniques for automatically | #2009 Here we emphasize the connection to Montague semantics which can be viewed as a formal computation of the logical form . |
