other,3-1-P01-1047,ak improvements are possible . We provide a <term> logical definition </term> of <term> Minimalist grammars </term>
other,6-1-P01-1047,ak a <term> logical definition </term> of <term> Minimalist grammars </term> , that are <term> Stabler 's formalization
other,11-1-P01-1047,ak Minimalist grammars </term> , that are <term> Stabler 's formalization </term> of <term> Chomsky 's minimalist program
other,15-1-P01-1047,ak <term> Stabler 's formalization </term> of <term> Chomsky 's minimalist program </term> . Our <term> logical definition </term>
other,1-2-P01-1047,ak 's minimalist program </term> . Our <term> logical definition </term> leads to a neat relation to <term>
other,9-2-P01-1047,ak </term> leads to a neat relation to <term> categorial grammar </term> , ( yielding a treatment of <term>
other,17-2-P01-1047,ak </term> , ( yielding a treatment of <term> Montague semantics </term> ) , a <term> parsing-as-deduction </term>
tech,22-2-P01-1047,ak <term> Montague semantics </term> ) , a <term> parsing-as-deduction </term> in a <term> resource sensitive logic
other,25-2-P01-1047,ak <term> parsing-as-deduction </term> in a <term> resource sensitive logic </term> , and a <term> learning algorithm </term>
tech,31-2-P01-1047,ak resource sensitive logic </term> , and a <term> learning algorithm </term> from <term> structured data </term> (
other,34-2-P01-1047,ak <term> learning algorithm </term> from <term> structured data </term> ( based on a <term> typing-algorithm
tech,40-2-P01-1047,ak structured data </term> ( based on a <term> typing-algorithm </term> and <term> type-unification </term> )
tech,42-2-P01-1047,ak a <term> typing-algorithm </term> and <term> type-unification </term> ) . Here we emphasize the connection
other,6-3-P01-1047,ak Here we emphasize the connection to <term> Montague semantics </term> which can be viewed as a formal computation
skrij podrobnosti