<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content=text/html;charset=utf-8 http-equiv=Content-Type>
<META name=GENERATOR content="MSHTML 8.00.6001.23580"></HEAD>
<BODY style="PADDING-LEFT: 10px; PADDING-RIGHT: 10px; PADDING-TOP: 15px"
id=MailContainerBody leftMargin=0 topMargin=0 bgColor=#ffffff text=#000000
CanvasTabStop="true" name="Compose message area">
<DIV><FONT face=Arial><FONT size=2></FONT><FONT size=2></FONT><BR></FONT></DIV>
<DIV><FONT size=2 face=Arial></FONT></DIV>
<BLOCKQUOTE
style="BORDER-BOTTOM: 0px; BORDER-LEFT: 0px; BORDER-TOP: 0px; BORDER-RIGHT: 0px"
class=__pbForwardBlockQuote cite=mid:5359456A.6060104@lif.univ-mrs.fr
type="cite">
<DIV
style="TEXT-ALIGN: center; COLOR: #888888; MARGIN-LEFT: 24px; MARGIN-RIGHT: 24px"
class=__pbConvBody __pbrmquotes="false"><FONT color=#000000
face=Arial>Apologies for multiple
postings<BR>+++++++++++++<BR><BR></FONT></DIV>
<DIV
style="TEXT-ALIGN: center; COLOR: #888888; MARGIN-LEFT: 24px; MARGIN-RIGHT: 24px"
class=__pbConvBody __pbrmquotes="false"><FONT face=Arial><FONT
color=#000000><BIG><SPAN style="FONT-WEIGHT: bold">CogALex-IV</SPAN> <SPAN
style="FONT-WEIGHT: bold">shared task</SPAN> <BR>concerning the ‘<SPAN
style="FONT-WEIGHT: bold">lexical access problem</SPAN>’
</BIG><BR>(computing word associations when several stiimulus words are
given)<BR></FONT></FONT></DIV>
<DIV style="COLOR: #888888; MARGIN-LEFT: 24px; MARGIN-RIGHT: 24px"
class=__pbConvBody __pbrmquotes="false"><FONT color=#000000 size=2
face=Arial></FONT><BR><FONT color=#000000 face=Arial>In the framework of the
4th Workshop on Cognitive Aspects of the Lexicon (CogALex) to be held at
COLING 2014, we invite participation in a shared task devoted to the problem
of lexical access in language production, with the aim of providing a
quantitative comparison between different systems.<BR><BR> <BR><SPAN
style="FONT-WEIGHT: bold">MOTIVATION</SPAN><BR><BR>The quality of a dictionary
depends not only on coverage, but also on the accessibility of the
information. That is, a crucial point is dictionary access. Access strategies
vary with the task (text understanding vs. text production) and the knowledge
available at the very moment of consultation (words, concepts, speech sounds).
Unlike readers who look for meanings, writers start from them, searching for
the corresponding words. While paper dictionaries are static, permitting only
limited strategies for accessing information, their electronic counterparts
promise dynamic, proactive search via multiple criteria (meaning, sound,
related words) and via diverse access routes. Navigation takes place in a huge
conceptual lexical space, and the results are displayable in a multitude of
forms (e.g. as trees, as lists, as graphs, or sorted alphabetically, by topic,
by frequency).<BR><BR>To bring some structure into this multitude of
possibilities, the shared task will concentrate on a crucial subtask, namely
multiword association. What we mean by this in the context of this
workshop is the following. Suppose, we were looking for a word expressing the
following ideas: 'superior dark coffee made of beans from Arabia', but could
not remember the intended word 'mocha' due to the tip-of-the-tongue problem.
Since people always remember something concerning the elusive word, it would
be nice to have a system accepting this kind of input, to propose then a
number of candidates for the target word. Given the above example, we might
enter 'dark', 'coffee', 'beans', and 'Arabia', and the system would be
supposed to come up with one or several associated words such as 'mocha',
'espresso', or 'cappuccino'.<BR><BR> <BR><SPAN
style="FONT-WEIGHT: bold">TASK DEFINITION</SPAN><BR></FONT></DIV>
<DIV style="COLOR: #888888; MARGIN-LEFT: 24px; MARGIN-RIGHT: 24px"
class=__pbConvBody __pbrmquotes="false"><FONT color=#000000
face=Arial></FONT> </DIV>
<DIV style="COLOR: #888888; MARGIN-LEFT: 24px; MARGIN-RIGHT: 24px"
class=__pbConvBody __pbrmquotes="false"><FONT color=#000000 face=Arial>The
participants will receive lists of five given words (primes) such as 'circus',
'funny', 'nose', 'fool', and 'fun' and are supposed to compute the word which
is most closely associated to all of them. In this case, the word 'clown'
would be the expected response. Here are some more
examples:<BR><BR> given words: gin, drink, scotch, bottle,
soda<BR> target word: whisky<BR><BR> given
words: wheel, driver, bus, drive, lorry<BR> target
word: car<BR><BR> given words: neck, animal, zoo,
long, tall<BR> target word: giraffe<BR><BR>
given words: holiday, work, sun, summer, abroad<BR> target
word: vacation<BR><BR> given words: home, garden,
door, boat, chimney<BR> target word:
house<BR><BR> given words: blue, cloud, stars, night,
high<BR> target word: sky<BR><BR>We provide a training set
of 2000 sets of five input words (multiword stimuli), together with the
expected target words (associative responses). The participants will have
about five weeks to train their systems on this data. After the training
phase, we will release a test set containing another 2000 sets of five input
words, but without providing the expected target words. <BR><BR>Participants
will have five days to run their systems on the test data, thereby predicting
the target words. For each system, we will compare the results to the expected
target words and compute an accuracy. The participants will be invited to
submit a paper describing their approach and their results.<BR><BR>For the
participating systems, we will distinguish two categories: <BR></DIV></FONT>
<DIV style="COLOR: #888888; MARGIN-LEFT: 24px; MARGIN-RIGHT: 24px"
class=__pbConvBody __pbrmquotes="false">
<OL>
<LI><FONT color=#000000 face=Arial>Unrestricted systems. They can use any
kind of data to compute their results. </FONT>
<LI><FONT color=#000000 face=Arial>Restricted systems: These systems are
only allowed to draw on the freely available ukWaC corpus in order to
extract information on word associations. The ukWaC corpus comprises about 2
billion words and can be requested from </FONT><A
class=moz-txt-link-freetext
title="http://wacky.sslmit.unibo.it/doku.php?id=corpora
STRG + Klicken, um Verknüpfung zu folgen"
href="http://wacky.sslmit.unibo.it/doku.php?id=corpora"
moz-do-not-send="true"><FONT
title="http://wacky.sslmit.unibo.it/doku.php?id=corpora
STRG + Klicken, um Verknüpfung zu folgen"
color=#000000
face=Arial>http://wacky.sslmit.unibo.it/doku.php?id=corpora</FONT></A><FONT
color=#000000 face=Arial>. </FONT></LI></OL></DIV>
<DIV><BR><FONT face=Arial>Participants can compete in either category or in
both.<BR><BR><BR><SPAN style="FONT-WEIGHT: bold">VENUE</SPAN><BR><BR>The
shared task will take place as part of the CogALex workshop which is
co-located with COLING 2014 (Dublin). The workshop date is August 23, 2014. If
you wish to participate but cannot attend the workshop, please let us
know.</FONT></DIV>
<DIV><FONT face=Arial> <BR><BR><SPAN style="FONT-WEIGHT: bold">SHARED TASK
SCHEDULE</SPAN><BR></DIV></FONT>
<UL>
<LI><FONT face=Arial>Training data release: March 27, 2014 </FONT>
<LI><FONT face=Arial>Test data release: May 5, 2014 </FONT>
<LI><FONT face=Arial>Final results due: May 9, 2014 </FONT>
<LI><FONT face=Arial>Deadline for paper submission: May 31, 2014
</FONT>
<LI><FONT face=Arial>Reviewers' feedback: June, 15, 2014 </FONT>
<LI><FONT face=Arial>Camera-ready version: July 7, 2014 </FONT>
<LI><FONT face=Arial>Workshop date: August 23, 2014 </FONT></LI></UL><BR
style="FONT-WEIGHT: bold"><FONT face=Arial><SPAN
style="FONT-WEIGHT: bold">FURTHER INFORMATION</SPAN><BR></FONT>
<UL>
<LI><FONT face=Arial>CogALex workshop website: </FONT><A
class=moz-txt-link-freetext
title="http://pageperso.lif.univ-mrs.fr/~michael.zock/CogALex-IV/cogalex-webpage/index.html
STRG + Klicken, um Verknüpfung zu folgen"
href="http://pageperso.lif.univ-mrs.fr/%7Emichael.zock/CogALex-IV/cogalex-webpage/index.html"
moz-do-not-send="true"><FONT
title="http://pageperso.lif.univ-mrs.fr/~michael.zock/CogALex-IV/cogalex-webpage/index.html
STRG + Klicken, um Verknüpfung zu folgen"
color=#000000
face=Arial>http://pageperso.lif.univ-mrs.fr/~michael.zock/CogALex-IV/cogalex-webpage/index.html</FONT></A><FONT
face=Arial> </FONT>
<LI><FONT face=Arial>Data releases: To be found on the above workshop
website from the dates given in the schedule. </FONT>
<LI><FONT face=Arial>Registration for the shared task: Send e-mail to
Reinhard Rapp, with Michael Zock in copy (any time until the deadline for
final results, i.e. May 9, 2014)</FONT></LI></UL>
<DIV><FONT face=Arial></FONT> </DIV><FONT face=Arial><SPAN
style="FONT-WEIGHT: bold">WORKSHOP ORGANIZERS</SPAN><BR></FONT>
<UL>
<LI><FONT face=Arial>Michael Zock (LIF-CNRS, Marseille, France),
michael.zock AT lif.univ-mrs.fr </FONT>
<LI><FONT face=Arial>Reinhard Rapp (University of Aix Marseille, France, and
Mainz, Germany), reinhardrapp AT gmx.de </FONT>
<LI><FONT face=Arial>Chu-Ren Huang (The Hong Kong Polytechnic University,
Hong Kong), churen.huang AT inet.polyu.edu.hk </FONT></LI></UL>
<DIV class=moz-signature>
<P class=MsoNormal><FONT
face=Arial></FONT> </P></DIV></BLOCKQUOTE></BODY></HTML>