Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Re: The (futile?) quest for an automatic paraphrase engine

by toma (Vicar)
on May 17, 2004 at 04:20 UTC ( [id://353866]=note: print w/replies, xml ) Need Help??


in reply to Re: The (futile?) quest for an automatic paraphrase engine
in thread The (futile?) quest for an automatic paraphrase engine

If you want a brute-force solution, one approach would be to first create an engine that solves the reverse problem. That is, given the set of facts, create a routine that generates examples of the type of input that you would like to be able to handle.

If you create an exhaustive list of all the possible inputs, this list could be used as a lookup table to map your desired input back to the output.

Since the list of inputs is so large, you'll want to find ways to remove the redundancies in the list. You can think of the various AI techniques as being clever ways to make the length of the list smaller by using perl code.

Take a look at all the Lingua modules, such as Lingua::Stem. Some of these modules are quite inspiring!

There is nothing wrong with working on a 'grand challenge' type of problem, even if you are an amateur. I have worked on some of these challenges. When I get something working reasonably well, people say something like, "Oh, of course, if that's all you want, it is easy. The really hard part is..."

It should work perfectly the first time! - toma
  • Comment on Re: Re: The (futile?) quest for an automatic paraphrase engine

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://353866]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others rifling through the Monastery: (4)
As of 2024-04-24 03:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found