| improvements are possible . We provide | a | <term> logical definition </term> of <term> | #1928 We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. | |
| <term> logical definition </term> leads to | a | neat relation to <term> categorial grammar | #1951 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). | |
| <term> categorial grammar </term> , ( yielding | a | treatment of <term> Montague semantics </term> | #1960 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). | |
| treatment of <term> Montague semantics </term> ) , | a | <term> parsing-as-deduction </term> in a <term> | #1967 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). | |
| , a <term> parsing-as-deduction </term> in | a | <term> resource sensitive logic </term> , | #1970 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). | |
| <term> resource sensitive logic </term> , and | a | <term> learning algorithm </term> from <term> | #1976 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). | |
| from <term> structured data </term> ( based on | a | <term> typing-algorithm </term> and <term> type-unification | #1985 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). | |
| semantics </term> which can be viewed as | a | <term> formal computation </term> of the <term> | #2004 Here we emphasize the connection to Montague semantics which can be viewed as a formal computation of the logical form. |
