A probabilistic Model of Link Grammar

[IVAN FAJARDO]

Hello, I'm trying to program the model posed Lafferty, Sleator and Temperly, my main difficulty is the calculation of probabilities Inside-outside, for example when calculating Count (W, L, R, l, r) is necessary to calculate pr (s) ^ -1 and calculate Pinside (L, W, l, left (d)), which is recursive with itself, I do not know when it ends, what should I do?. I need help.

[Linas Vepstas]

I don't really understand the question.  But there are only a finite number of words in a sentence, so the recursion must stop :-)

--linas

On 9 December 2013 21:29, IVAN FAJARDO <matca...@gmail.com> wrote:

Hello, I'm trying to program the model posed Lafferty, Sleator and Temperly, my main difficulty is the calculation of probabilities Inside-outside, for example when calculating Count (W, L, R, l, r) is necessary to calculate pr (s) ^ -1 and calculate Pinside (L, W, l, left (d)), which is recursive with itself, I do not know when it ends, what should I do?. I need help.

--
You received this message because you are subscribed to the Google Groups "link-grammar" group.
To unsubscribe from this group and stop receiving emails from it, send an email to link-grammar...@googlegroups.com.
To post to this group, send email to link-g...@googlegroups.com.
Visit this group at http://groups.google.com/group/link-grammar.
For more options, visit https://groups.google.com/groups/opt_out.