Constrained Lexical Attraction Models

Lexical Attraction Models (LAMs) were first introduced by Deniz Yuret in (Yuret 1998) to exemplify how an algorithm can learn word dependencies from raw text. His general thesis is that lexical attraction is the likelihood of a syntactic relation. However, the lexical attraction acquisition algorithm from (Yuret 1998) does not take into account the morpho-syntactical information provided by a part-ofspeech (POS) tagger and, thus, is unable to impose certain linguistically motivated restrictions on the creation of the links. Furthermore, it does not behave well when encountering unknown words. The present article presents a new link discovery algorithm using the annotation provided by a POS-tagger. The results show an F-measure of approximately 70% when comparing the links produced by this algorithm with those produced by a fully-fledged parser.

• Type: Conference
• Year: 2006
• Where: FLAIRS
• Authors: Radu Ion, Verginica Barbu Mititelu
• Keywords: Algorithm, Artificial Intelligence, FLAIRS 2006, Lexical Attraction, Lexical Attraction Models