Re: [opencog-dev] Relex to DB

2016-11-07 Thread Linas Vepstas 
On Wed, Nov 2, 2016 at 6:15 AM, Vishnu Priya 
wrote:

> Hello,
>
> I am trying the following:
>
> As sentences come in, it should go through NLP pipeline i.e. parsed by
> Relex and should be stored in DB automatically.
> Because  i can't manually do all the time giving sentence to relex server
> localhost , save the results in a scheme file,  load and store in DB.
>
> How can i do this? or is there  already exists any script for doing this?
>

Not currently, not really.  There are some scripts that almost do this, but
not quite, and I've forgotten the details.

First, there is "CFF" the "common file format" and scripts to dump relex
output into that -- which seems to be what you want to do. I think there
are also scripts that convert CFF to
opencog format, but they may have bit-rotted, and need adjustment.

You can store the contents of an opencog atomspace to a DB, and restore
it.  However, if you are doing that I do NOT recommend storing the
individual sentences; instead, it would be better to store only the
abstracted stuff you want -- maybe the counts for how often certain words
occurred, etc.   But to do that you would need to "do it yourself".

--linas



>
>
>
> Thanks in advance,
> Vishnu
>
> --
> 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 opencog+unsubscr...@googlegroups.com.
> To post to this group, send email to opencog@googlegroups.com.
> 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/b4ac4c19-39cd-4472-b241-101ad43a3f4a%40googlegroups.com
> 
> .
> For more options, visit https://groups.google.com/d/optout.
>

-- 
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 opencog+unsubscr...@googlegroups.com.
To post to this group, send email to opencog@googlegroups.com.
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/CAHrUA34FWN9P6zYtG1jKbR2TS_jTo_yE%2B%3DWnGY9zUE3NatszVA%40mail.gmail.com.
For more options, visit https://groups.google.com/d/optout.

Re: [opencog-dev] question about a concept from the PLN book on Ben's site..

2016-11-07 Thread 'Nil Geisweiller' via opencog 

Hi Apil,

On 11/07/2016 03:39 PM, Apil Tamang wrote:

Hi All,
Reading through the book on 'Probabilistic Logic Networks' which is
posted on http://goertzel.org/PLN_BOOK_6_27_08.pdf.
I think I'm making okay progress on the concepts on this book so far so
good. There's just this one little area which has me completely stumped:

Chapter 3, Page 45:
'''

The Stripedog-recognizing predicate, call it FStripedog, has a
SatisfyingSet that we may denote simply as stripedog, defined by


ExtensionalEquivalence

   Member $X stripedog

   AND

 Evaluation FStripedog $X
 Evaluation isIdentifier ($X, FStripedog)

'''


Extensional equivalence means that you only consider the members of the 
concepts in consideration, as opposed to their properties, which would 
be an intensional equivalence.


I'm not sure what is the isIdentifier predicate here, but don't get 
stuck over it, it's not important, if we ignore it, this merely becomes


ExtensionalEquivalence
   Member $X Stripdog
   Evaluation FStripdog $X

which BTW in today's atomese/scheme would be written

(ExtensionalEquivalenceScope
   (Member (Variable "$X") (Concept "Stripdog"))
   (Evaluation (Predicate "FStripdog") (Variable "$X")))

The scope being used to bind the variable $X to the extensional equivalence.

Hope it's clearer.

Nil




What is this block of PLN construct (or expression) trying to say, or
what does it represent? Obviously, this is not a definition of
  FStripedog, nor is it a definition of the satisfying-set for it (which
is defined by /stripedog/). It may simply be that I don't understand
exactly what the High-Order Relationship: 'ExtensionalEquivalence'
means. I went back in the earlier pages and could not really locate how
this HOR formally defined. I feel like this expression somehow is trying
to formalize what constitutes as a satisfying-set for  predicate:
FStripedog, but I couldn't be sure.


Thanks for any help.


P.S: An added bonus would be to let me know how the concepts in the PLN
book relate to open-cog. I think most of this material maybe within the
scope of the MOSES system, but somehow I feel this material is critical
to opencog because (I think I read somewhere that) this is what gives
opencog its innate ability to reason, deduct, and infer. How does the
innate opencog reasoning/inference abilities depart from the more
complex array of PLN logics available in MOSES ? Maybe I'm not even
thinking right.. sorry about the verbosity.




--
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 opencog+unsubscr...@googlegroups.com
.
To post to this group, send email to opencog@googlegroups.com
.
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/0295afd3-af30-41d1-acae-22a85e08df9d%40googlegroups.com
.
For more options, visit https://groups.google.com/d/optout.


--
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 opencog+unsubscr...@googlegroups.com.
To post to this group, send email to opencog@googlegroups.com.
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/5820ADD5.2010704%40gmail.com.
For more options, visit https://groups.google.com/d/optout.

[opencog-dev] question about a concept from the PLN book on Ben's site..

2016-11-07 Thread Apil Tamang 
Hi All,
Reading through the book on 'Probabilistic Logic Networks' which is posted 
on http://goertzel.org/PLN_BOOK_6_27_08.pdf. 
I think I'm making okay progress on the concepts on this book so far so 
good. There's just this one little area which has me completely stumped:

Chapter 3, Page 45:
'''

The Stripedog-recognizing predicate, call it FStripedog, has a 
SatisfyingSet that we may denote simply as stripedog, defined by 


ExtensionalEquivalence 

  Member $X stripedog 

  AND 

Evaluation FStripedog $X
Evaluation isIdentifier ($X, FStripedog) 

'''


What is this block of PLN construct (or expression) trying to say, or what 
does it represent? Obviously, this is not a definition of  FStripedog, nor 
is it a definition of the satisfying-set for it (which is defined by 
*stripedog*). It may simply be that I don't understand exactly what the 
High-Order Relationship: 'ExtensionalEquivalence' means. I went back in the 
earlier pages and could not really locate how this HOR formally defined. I 
feel like this expression somehow is trying to formalize what constitutes 
as a satisfying-set for  predicate: FStripedog, but I couldn't be sure.


Thanks for any help.


P.S: An added bonus would be to let me know how the concepts in the PLN 
book relate to open-cog. I think most of this material maybe within the 
scope of the MOSES system, but somehow I feel this material is critical to 
opencog because (I think I read somewhere that) this is what gives opencog 
its innate ability to reason, deduct, and infer. How does the innate 
opencog reasoning/inference abilities depart from the more complex array of 
PLN logics available in MOSES ? Maybe I'm not even thinking right.. sorry 
about the verbosity.




-- 
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 opencog+unsubscr...@googlegroups.com.
To post to this group, send email to opencog@googlegroups.com.
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/0295afd3-af30-41d1-acae-22a85e08df9d%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

Re: [opencog-dev] A question about PM with a partial list

2016-11-07 Thread Tareq Alkhaldi 
Hi Linas,

Okay, I started adding the StarNode variable, but I have a question. So 
StarNode should work exactly like GlobNode except that it can accept a 
zero, right? What about something that will match zero or more but not 
necessarily in order? For example to match all the nodes in the pattern, 
and throw all the unmatched nodes (in any location) on that level in the 
target side to this variable. It's kind of "AllUnmatchedStuffNode" (for 
lacking a better name).

On Saturday, 29 October 2016 02:11:28 UTC+9, linas wrote:
>
> Hi Tareq,
>
> Currently, the only way to do this is is to write two different patterns, 
> one that searches for three words, and one that searches for two.
>
> Another possibility is to use a GlobNode instead of a VariableNode, this 
> will accept sequences of neighboring words, as one.  However, this might 
> not be what you want: the output of a glob is a list.
>
> You do ask an interesting question: it would be nice to have this kind of 
> matching.  Currently, VariableNode must match exactly one item, and 
> GlobNode must match one or more.   A "MaybeNode" that matches zero or one, 
> and a "StarNode" that matches zero or more could be useful.  .. But these 
> don't exist, yet.  Might not be hard to add ... 
>
> --linas
>
>
>
> On Fri, Oct 28, 2016 at 2:47 AM, Tareq Alkhaldi  > wrote:
>
>> Hi all,
>>
>> Is there a way to use the PM to match a partial list as the following?
>>
>> Atomspace has this:
>>
>> (EvaluationLink
>> (PredicateNode "pulled@463a5d30-1733-48bc-b188-cb1fcd1d3ee0")
>> (ListLink
>> (ConceptNode "James@c597a7ec-60ab-429d-b003-4782200c7a91")
>> (ConceptNode "pudding@f797c773-b58a-4136-8bad-74b4ad399c63")
>> (ConceptNode "all@3f71ac77-ef99-4499-883d-2ae3332fdb6a")  ; 
>> This may or may not exist
>> )
>> )
>>
>> Pattern I want to match is:
>>
>> (BindLink
>>   (VariableList
>>  (VariableNode "$X")
>>  (VariableNode "$Y")
>>   )
>>
>>   (EvaluationLink
>>  (VariableNode "$X")
>>  (ListLink
>> (ConceptNode "James@6c0671a2-1b11-4dd9-a787-d27d7779a0c8")
>> (VariableNode "$Y")
>>  )
>>   )
>>   (VariableNode "$Y")
>> )
>>
>> How can I match that without having to add another variable after "$Y" in 
>> the list, knowing that the (ConceptNode "all@...") may not always be there.
>>
>> Can this be done?
>>
>> Thanks
>>
>> -- 
>> 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 opencog+u...@googlegroups.com .
>> To post to this group, send email to ope...@googlegroups.com 
>> .
>> 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/764c3a00-c443-46ed-9d05-7aa11ddb4cb8%40googlegroups.com
>>  
>> 
>> .
>> For more options, visit https://groups.google.com/d/optout.
>>
>
>

-- 
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 opencog+unsubscr...@googlegroups.com.
To post to this group, send email to opencog@googlegroups.com.
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/1348cacd-a75b-4094-b31e-54a273c9e149%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.