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>
.
#1930We provide alogical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program.
other,6-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>
.
#1933We provide a logical definition ofMinimalist grammars, that are Stabler's formalization of Chomsky's minimalist program.
other,11-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>
.
#1938We provide a logical definition of Minimalist grammars, that areStabler 's formalization of Chomsky's minimalist program.
other,15-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>
.
#1942We provide a logical definition of Minimalist grammars, that are Stabler's formalization ofChomsky '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>
) .
#1948Ourlogical 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>
) .
#1956Our 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,17-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>
) .
#1964Our 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).
tech,22-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>
) .
#1969Our 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,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>
) .
#1972Our 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).
tech,31-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>
) .
#1978Our 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,34-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>
) .
#1981Our 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,40-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>
) .
#1987Our 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).
tech,42-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>
) .
#1989Our 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).
other,6-3-P01-1047,ak
Here we emphasize the connection to
<term>
Montague semantics
</term>
which can be viewed as a formal computation of the logical form .
#1998Here we emphasize the connection toMontague semantics which can be viewed as a formal computation of the logical form.