Re: Unsupervised learning of natural languages
From: | Gary Shannon <fiziwig@...> |
Date: | Thursday, November 3, 2005, 1:21 |
--- Henrik Theiling <theiling@...> wrote:
<snip>
>
> But the algorithm is limited to finding context free
> rules, so some
> things like vowel harmony or Werner's law etc.
> cannot be found. On
> the syntax level, the same holds for word ordering
> phenomena occuring
> in German or Dutch. In the computational
> linguistics fields, context
> free grammars are insufficient for virtually
> everything. So although
> the algorithms are fun to play with, they are not
> really innovative, I
> think, for linguistics.
>
> **Henrik
>
My reading of the paper (see, in particular, Mode A
and Mode B. in the supporting text where the alogrithm
is detailed) indicates that the algorithm handles the
extraction of both context free and context sensitive
rules.
Quote: "In particular, when ADIOS is iterated, symbols
that may have been initially very far apart are
allowed to exert influence on each other, enabling it
to capture long-range syntactic dependencies such as
agreement (Fig. 2F)."
Inidcating that even long-range context is taken into
account.
--gary
Reply