文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Structural Equations in Language Learning
侵权投诉

Structural Equations in Language Learning

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 v

Structuralequationsinlanguagelearning

MichaelMoortgat

UtrechtInstituteofLinguistics—OTS

Trans10,3512JKUtrecht,TheNetherlands

Michael.Moortgat@let.uu.nl

Abstract.Incategorialsystemswitha xedstructuralcomponent,thelearningproblemcomesdownto ndingthesolutionforasetoftype-assignmentequations.Ahard-wiredstructuralcomponentisproblematicifonewanttoaddressissuesofstructuralvariation.Ourstartingpointisatype-logicalarchitecturewithseparatemodulesforthelogicalandthestructuralcomponentsofthecomputationalsystem.Thelogicalcom-ponentexpressesinvariantsofgrammaticalcomposition;thestructuralcomponentcapturesvariationintherealizationofthecorrespondencebetweenformandmeaning.Learninginthissettinginvolves ndingthesolutiontoboththetype-assignmentequationsandthestructuralequa-tionsofthelanguageathand.Wedevelopaviewonthesetwosubtaskswhichpictureslearningasaprocessmovingthroughatwo-stagecycle.Inthe rstphaseofthecycle,typeassignmentsarecomputedstaticallyfromstructures.Inthesecondphase,thelexiconisenhancedwithfa-cilitiesforstructuralreasoning.Thesemakeitpossibletodynamicallyrelatestructuresduringon-linecomputation,ortoestablisho -linelexi-calgeneralizations.Wereportontheinitialexperimentsin[15]toapplythismethodinthecontextoftheSpokenDutchCorpus.

Forthegeneraltype-logicalbackground,wereferto[12];§1hasabriefrecapofsomekeyfeatures.

1Constantsandvariation

Onecanthinkoftype-logicalgrammarasafunctionalprogramminglanguagewithsomespecialpurposefeaturestocustomizeitfornaturallanguageprocess-ingtasks.BasicconstructsaredemonstrationsoftheformΓ A,statingthatastructureΓisawell-formedexpressionoftypeA.Thesestatementsaretheoutcomeofaprocessofcomputation.Ourprogramminglanguagehasabuilt-invocabularyoflogicalconstantstoconstructthetypeformulasoversomesetofatomicformulasintermsoftheindexedunaryandbinaryoperationsof(1a).Paralleltotheformulalanguage,wehavethestructure-buildingoperationsof(1b)with(· i·)and · jascounterpartsof iand jrespectively.Theindicesiandjaretakenfromgiven, nitesetsI,Jwhichwerefertoascompositionmodes.

(1)a.Typ::=Atom| jTyp|2jTyp|Typ iTyp|Typ/iTyp|Typ\iTyp

b.Struc::=Typ| Struc j|Struc iStruc

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email