On Wed, Jun 7, 2017 at 1:37 PM, Linas Vepstas <[email protected]> wrote: > > Well, you've got to add some kind of length limits. How far apart do you > want the words to be?
That's a parameter one can set, it could be n=10 or n=20 ... a while ago we passed around some papers indicating the length of an average dependency link in English, Chinese and other languages... >> The above could all be done in C++ perfectly well; it doesn't require >> Guile because it doesn't require any of the fancy stuff in the current >> NLP pipeline... > > > What's the point? Why bother? why would you want to do this? what does it > accomplish? what does it solve? It would get us a way of doing Step 0 of the language learning pipeline that -- works smoothly without hitting weird hard-to-solve Guile bugs and such -- grabs possible dependencies in a way that seems less wasteful to me than generating a bunch of random parses (i.e. just building links btw words that are reasonably near each other) Obviously this is not the interesting part of the language learning algorithm ... but we need to get this first part working reliably and reasonably rapidly to get to the other parts, right? So far Ruiting hasn't been able to get to the point of experimenting with clustering and disambiguation algorithms because the Step 0 code hits these Guile bugs. But there's no need to have complex code or Guile code for Step 0, all we need is simpler stuff... -- Ben -- You received this message because you are subscribed to the Google Groups "opencog" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/opencog. To view this discussion on the web visit https://groups.google.com/d/msgid/opencog/CACYTDBeT7kUyNzDq3cqqaOKqvTF%3D6gkso%3DcjCj2YvbL25E0yRw%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
