Structural equations in language learning
Publication date
2001-07
Authors
Moortgat, M.J.
Editors
Advisors
Supervisors
DOI
Document Type
Preprint
Metadata
Show full item recordCollections
License
Abstract
In categorial systems with a fixed structural component, the
learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural component is problematic
if one want to address issues of structural variation. Our starting point is
a type-logical architecture with separate modules for the logical and the
structural components of the computational system. The logical component expresses invariants of grammatical composition; the structural
component captures variation in the realization of the correspondence
between form and meaning. Learning in this setting involves finding the
solution to both the type-assignment equations and the structural equations of the language at hand. We develop a view on these two subtasks
which pictures learning as a process moving through a two-stage cycle.
In the first phase of the cycle, type assignments are computed statically
from structures. In the second phase, the lexicon is enhanced with facilities for structural reasoning. These make it possible to dynamically
relate structures during on-line computation, or to establish off-line lexical generalizations. We report on the initial experiments in [15] to apply
this method in the context of the Spoken Dutch Corpus.
For the general type-logical background, we refer to [12]; §1 has a brief
recap of some key features.