nlp project
peter
convert english into logic. I think I can write a phraser to phrase
the english. My idea is to convert english into 3 basic logics :
equal, larger than, small than.
If input "cat is red" into my engine, I will store "cat = red" in my
database.
So what should I do next?
thanks
from Peter (cmk...@hotmail.com)
[ comp.ai is moderated ... your article may take a while to appear. ]
Carsten van Weelden
> A guy are paying me to develop a nature language processing eninge, to
> convert english into logic. I think I can write a phraser to phrase
> the english. My idea is to convert english into 3 basic logics :
> equal, larger than, small than.
>
> If input "cat is red" into my engine, I will store "cat = red" in my
> database.
>
> So what should I do next?
>
> thanks
> from Peter (cmk...@hotmail.com)
>
The more usual approach is to use a formal meaning representation,
first order predicate calculus is a good example based on first order
logic and lambda calculus. For instance, if you have the phrase "a red
cat" you would get something like Ex Cat(x) & HasColor(x, red).
You should start by finding out exactly what you have to represent. Do
you need to represent time or belief, then you need temporal or modal
logic. Will all the sentences concern a certain domain? Then you can
use a domain ontology to specify useful categories. Will some events
be very common? For example, if all the sentences are concerned with
making a reservation, then you know which aspect to represent and how
to store them in a database.
HaltingState
> A guy are paying me to develop a nature language processing eninge, to
> convert english into logic. I think I can write a phraser to phrase
> the english. My idea is to convert english into 3 basic logics :
> equal, larger than, small than.
>
> If input "cat is red" into my engine, I will store "cat = red" in my
> database.
>
> So what should I do next?
>
> thanks
> from Peter (cmk...@hotmail.com)
>
Notice that a relationship between objects is undirected if f(x,y) =
f(y,x); but for most relationships this is not the case.
David Kinny
>peter wrote:
>> A guy are paying me to develop a nature language processing eninge, to
>> convert english into logic. I think I can write a phraser to phrase
>> the english. My idea is to convert english into 3 basic logics :
>> equal, larger than, small than.
These are relationships, not logics. You'll need more than these 3
to capture even a small fragment of English.
>>
>> If input "cat is red" into my engine, I will store "cat = red" in my
>> database.
>>
>> So what should I do next?
Refund the guy's money?
>>
>> thanks
>> from Peter (cmk...@hotmail.com)
>>
>Notice that a relationship between objects is undirected if f(x,y) =
>f(y,x); but for most relationships this is not the case.
The usual terminology is that such a relationship is symmetric.
(Equivalence relations are reflexive, symmetric and transitive.)
Also, red is not an object but a property, and "is" doesn't usually
stand for equivalence, e.g. a dog is a mammal, today is hot, today
is Sunday, Peter is smart, Peter is 20, Peter is early, ...
David
Wolfgang Lorenz
> If input "cat is red" into my engine, I will store "cat = red" in my
> database.
>
> So what should I do next?
1) Input "rose is red" into your engine.
2) To verify that it works correctly, ask the database "cat is red?",
"rose is red?", and "blood is red?". It should answer "Yes", "Yes", and
"I don't know".
3) Ask the database "cat is rose?" What does it answer?
--
http://home.arcor.de/w.lorenz65/mlbench
No mercy for the cheaters in machine learning!
peter
> peter wrote:
> > If input "cat is red" into my engine, I will store "cat = red" in my
> > database.
>
> > So what should I do next?
>
> 1) Input "rose is red" into your engine.
>
> 2) To verify that it works correctly, ask the database "cat is red?",
> "rose is red?", and "blood is red?". It should answer "Yes", "Yes", and
> "I don't know".
>
> 3) Ask the database "cat is rose?" What does it answer?
>
> No mercy for the cheaters in machine learning!
>
Thank you guys
I think I am better to do it from the ground up. I am writing a
phraser using gcc with bison, the first goal is the define all the
english grammar rules. After that, I will input some books into the
engine, to see what logic it can collect.
thanks
from Peter