YKY,

Ahh yes, I recall having studied this work a few years ago.   That project has 
parsed and applied their disambiguation methods on the WordNet glosses and I 
have a copy of that somewhere.  I thought to use their work, especially the 
higher quality entries, to prime my own project's understanding of the WordNet 
glosses.

There is a straightforward conversion from the formulas you gave to the RDF 
semantic representation that I am using for Texai:

    john(e1)
    mary(e3)
    love(e2, e1, e3)

is equivalent to the RDF:

   <texai:?e1> <owl:sameAs> <texai:John>                ?e1 is the same 
identity as John
   <texai:?e3> <owl:sameAs> <texai:Mary>               ?e3 is the same identity 
as Mary             
   <texai:?e2> <rdf:type> <texai:LoveSituation>           ?e2 is a love 
situation
   <texai:?e2> <texai:lover> <texai:?e1>                           in ?e2 (the 
love situation), ?e1 (John) is the lover
   <texai:?e2> <texai:thingLoved> <texai:?e3>                in ?e2, ?e3 (Mary) 
is the thing loved

I invented terms for loving, lover and thing loved, which Cyc lacks.  Cyc does 
have a relationship loves, but that only directly relates the agent with the 
thing loved.  After thinking about the needs of natural language, I have come 
to believe that relationships should always be represented with respect to a 
containing situation, event, or action.  Natural language verbs map nicely to 
situations, events and actions.  OpenCyc has a lot of vocabulary for these but 
they are not uniformly applied throughout its knowledge base.  I hope remedy 
that with my Texai approach.

Cheers.
-Steve


 Stephen L. Reed


Artificial Intelligence Researcher
http://texai.org/blog
http://texai.org
3008 Oak Crest Ave.
Austin, Texas, USA 78704
512.791.7860



----- Original Message ----
From: YKY (Yan King Yin) <[EMAIL PROTECTED]>
To: agi@v2.listbox.com
Sent: Wednesday, May 7, 2008 2:30:11 PM
Subject: Re: [agi] standard way to represent NL in logic?

On 5/7/08, Stephen Reed <[EMAIL PROTECTED]> wrote:

> I have not heard about Rus form.  Could you provide a link or reference?


This is one of the papers:
http://citeseer.ist.psu.edu/cache/papers/cs/22812/http:zSzzSzwww.seas.smu.eduzSz~vasilezSzictai2001.pdf/rus01high.pdf
you can find some examples in the figures.

The main thing is that (nearly) every word is "reified".

For example, for "John loves Mary", we say that there is an entity e1
which is a John, and entity e2 which is an act of loving, and an
entity e3 which is a Mary.

So we have these formulae:
    john(e1)
    mary(e3)
    love(e2, e1, e3)

Anyway, something like that....

Rus form is popularly used in text entailment programs.

YKY

-------------------------------------------
agi
Archives: http://www.listbox.com/member/archive/303/=now
RSS Feed: http://www.listbox.com/member/archive/rss/303/
Modify Your Subscription: http://www.listbox.com/member/?&;
Powered by Listbox: http://www.listbox.com



      
____________________________________________________________________________________
Be a better friend, newshound, and 
know-it-all with Yahoo! Mobile.  Try it now.  
http://mobile.yahoo.com/;_ylt=Ahu06i62sR8HDtDypao8Wcj9tAcJ

-------------------------------------------
agi
Archives: http://www.listbox.com/member/archive/303/=now
RSS Feed: http://www.listbox.com/member/archive/rss/303/
Modify Your Subscription: 
http://www.listbox.com/member/?member_id=8660244&id_secret=101455710-f059c4
Powered by Listbox: http://www.listbox.com

Reply via email to