dupa
« previous next »
Pages: [1]

Author Topic: I am inspired.  (Read 5200 times)

onthecuttingedge2005

  • Guest
I am inspired.
« on: January 12, 2006, 05:27:25 pm »
I have been studying a lot on Reasoning factors, I believe with a little extra research I will have it down pat and ready to go.

I have already learned a great deal.
I have discovered many human reasoning algorithms and have tested them.

I have been inspired to write a new program brain called: David.

David will be nothing but a pure learning A.I. There will be no static responses, except that info that was given to David at birth

Name:
Birth Stats:
Parents:
Relatives:

These Questions will be asked just at the birth of David and will never change.

This bot will only learn by Curiosity and will teach by what it has learned from its Curiosity.

When David is fully mature with its linked reasoning you will not be able to tell the difference between a polite Human and David.

Rob, I don't know how long I'll be but as soon as I am done I will contact you with a package called David, Maybe you can help me put it all together for a quality public plug-in package when I am done.

Jerry[8D]
« Last Edit: January 12, 2006, 08:00:22 pm by onthecuttingedge2005 »
Logged

Art

  • Global Moderator
  • Hero Member
  • *****
  • Posts: 3859
    • View Profile
I am inspired.
« Reply #1 on: January 12, 2006, 07:06:24 pm »
Interesting Jerry,

Sounds quite similar to Spielberg's AI movie. The new parent had to IMPRINT key information in order to activate DAVID. From that point David accepted Monica as his mother!

I'd love to see your efforts come to fruition.

Keep us posted.
Logged
In the world of AI it's the thought that counts!

- Art -

onthecuttingedge2005

  • Guest
I am inspired.
« Reply #2 on: January 12, 2006, 07:27:47 pm »
quote:
Originally posted by Art

Interesting Jerry,

Sounds quite similar to Spielberg's AI movie. The new parent had to IMPRINT key information in order to activate DAVID. From that point David accepted Monica as his mother!

I'd love to see your efforts come to fruition.

Keep us posted.



Project DAVID is being written as I speak.

Jerry[8D]
Logged

Smokey

  • Jr. Member
  • **
  • Posts: 72
    • View Profile
I am inspired.
« Reply #3 on: January 12, 2006, 08:24:14 pm »
This sounds very, very interesting.  Will wait patiently for your results.  [^]
Logged
Smokey

GrantNZ

  • Full Member
  • ***
  • Posts: 178
    • View Profile
I am inspired.
« Reply #4 on: January 13, 2006, 12:46:05 am »
Jerry: If you haven't already, you may like to check out one of the other AI forums - there were a couple of posts made in mid December regarding a similar bot, curiosity driven, which would enquire endlessly about the properties of things and concepts. The posts may give you some ideas.

I made a post on that forum a few days ago (Jan 8th) with links to two threads that describe that bot! My post can be found here (Jan 8th):
http://www.vrconsulting.it/vhf/topic.asp?TOPIC_ID=39
Logged
 

onthecuttingedge2005

  • Guest
I am inspired.
« Reply #5 on: January 13, 2006, 04:11:34 am »
Thanks Guys.

I am part way done with David's Birth imprinting, I will do a little later, I am at 533 lines for now.

I want to get as complex as I can for this routine.
This includes all (RealTime) Birthdays of all Relatives and Friends.

David should be able to wish you a Happy Birthday or even tell you Merry Christmas, I see what I am up against, But the coding must go on.

I will allow that David will or will not have Parents but David's Name will have to be set before the program will even run.

There will be a bombardment of Questions that will be asked at the moment of Birth and this information will never change.

This Bot will know nothing about the World except its immediate family
and everything that it learns will be through pure Curiosity alone.

If any of you have any suggestions then please state them now or forever hold your peace.

Jerry[8D]
« Last Edit: January 13, 2006, 04:13:46 am by onthecuttingedge2005 »
Logged

onthecuttingedge2005

  • Guest
I am inspired.
« Reply #6 on: January 14, 2006, 02:15:13 am »
In David, I have written an Ultra Search Function as a Function for the most optimal searches in all response types.

The Ultra Search Function so far has a 100% return in search patterns of any kind of String.

There are 0% search failures.

Taking OriginalSentence search to its extreme!

This is good.

Jerry[8D]
« Last Edit: January 14, 2006, 02:38:17 am by onthecuttingedge2005 »
Logged

spydaz

  • Hero Member
  • *****
  • Posts: 670
    • View Profile
    • http://www.spydazweb.co.uk/
I am inspired.
« Reply #7 on: January 14, 2006, 09:29:11 am »
Hi there Great stuff...

I wouldnt mind a look at the searching function, Key to understanding whats being said...
REASONING BASED OFF This...
Logged

onthecuttingedge2005

  • Guest
I am inspired.
« Reply #8 on: January 14, 2006, 03:06:38 pm »
UPDATED JAN 15 3:25AM 2006
I am pretty sure I worked everything out with exception to adding more
slang to proper, The Letter S as in plural like Whales was the hardest to whoop but it got whooped.
all plural words are now separated to Singlar with a tagged S.

This function is from my custom bot David.

Place Ultra Search Just below:

Code: [Select]
Function GetResponse(ByVal UserSentence, ByVal UserName, ByVal ComputerName, ByVal LearningLevel, ByRef HalCommands, ByRef Hate, ByRef Swear, ByRef Insults, ByRef Compliment, ByVal PrevSent, ByRef LastResponseTime, ByRef PrevUserSent, ByRef CustomMem, ByRef GainControl, ByRef LastTopicList)

Place my code:
Code: [Select]
'ULTRA SEARCH WITH PUNCTUATION.
    Dim UltraSearch
    UltraSearch = SuperSearch(UserSentence)
    'ULTRA SEARCH WITHOUT PUNCTUATION.
    Dim Ultra_Search
    Ultra_Search = MegaSearch(UserSentence)

And at the very very end of your brain on the last line place the script Function:

Code: [Select]
'FUNCTION ULTRA SEARCH.
Public Function SuperSearch(UserSentence)
'PROCESS: TAG USERSENTENCE FOR ACCURATE SEARCH.
    'This will add tags to the beggining and end and middle of the user sentence to make
    'sure that whole words can be found at the beginning and end of any sentence
    'REMOVE EXTRA SPACES
    Do While InStr(1, UserSentence, "  ")
    UserSentence = Replace(UserSentence, "  ", " ")
    Loop
    'TAG OUR SEARCH METHOD.
    UserSentence = Trim(Ucase(UserSentence))
    UserSentence = "[" & UserSentence & "]"
    UserSentence = Replace(UserSentence, " ", "][", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[ITS]", "[IT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[KOOL]", "[COOL]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[CUZ]", "[BECAUSE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[BECUZ]", "[BECAUSE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[U]", "[YOU]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[UR]", "[YOUR]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[R]", "[ARE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[2]", "[TO]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[2U]", "[TO][YOU]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[U2]", "[YOU][TOO]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[4]", "[FOR]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[4U]", "[FOR][YOU]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[4UR]", "[FOR][YOUR]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[4EVR]", "[FOREVER]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[L8TR]", "[LATER]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[L8T]", "[LATE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[H8T]", "[HATE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[BRB]", "[BE][RIGHT][BACK]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[OK]", "[OKAY]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[LUV]", "[LOVE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[THATS]", "[THAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[THTS]", "[THAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHOS]", "[WHO]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WAT]", "[WHAT]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WUT]", "[WHAT]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHT]", "[WHAT]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WATS]", "[WHAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WUTS]", "[WHAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHTS]", "[WHAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHATS]", "[WHAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHENS]", "[WHEN]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHERES]", "[WHERE]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[Y]", "[WHY]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[Y'S]", "[WHY]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHYS]", "[WHY]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[HOWS]", "[HOW]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[THERES]", "[THERE]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "~", "][~]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "@", "][@]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "#", "][#]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "$", "][$]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "%", "][%]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "^", "][^]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "&", "][&]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "*", "][*]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "(", "][(]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, ")", "][)]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "+", "][+]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "_", "][_]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "=", "][=]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "{", "][{]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "}", "][}]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "-", "][-]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, ";", "][;]", 1, -1, vbTextCompare)
    'UserSentence = Replace(UserSentence, ":", "][:]", 1, -1, vbTextCompare) 'Critical to time functions, leave off.
    UserSentence = Replace(UserSentence, ",", "][,]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, ".", "][.]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "!", "][!]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "?", "][?]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "'D", "]['D]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "'LL", "]['LL]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "'S", "]['S]", 1, -1, vbTextCompare)    
    UserSentence = Replace(UserSentence, "'M", "]['M]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "N'T", "][N'T]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "'RE", "]['RE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "S][", "][S][", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[[", "[", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "]]", "]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[]", "", 1, -1, vbTextCompare)
    SuperSearch = ">" & UserSentence & "<"
    SuperSearch = Replace(SuperSearch, "S]<", "][S]<", 1, -1, vbTextCompare)
    SuperSearch = Replace(SuperSearch, "[I][S][", "[IS][", 1, -1, vbTextCompare)
    SuperSearch = Replace(SuperSearch, "[I][S]<", "[IS]<", 1, -1, vbTextCompare)
    SuperSearch = Replace(SuperSearch, "[A][S][", "[AS][", 1, -1, vbTextCompare)
    SuperSearch = Replace(SuperSearch, "[A][S]<", "[AS]<", 1, -1, vbTextCompare)
    SuperSearch = Replace(SuperSearch, "[U][S][", "[US][", 1, -1, vbTextCompare)
    SuperSearch = Replace(SuperSearch, "[U][S]<", "[US]<", 1, -1, vbTextCompare)
    SuperSearch = Replace(SuperSearch, "[HA][S][", "[HAS][", 1, -1, vbTextCompare)
    SuperSearch = Replace(SuperSearch, "[HA][S]<", "[HAS]<", 1, -1, vbTextCompare)    
    SuperSearch = Replace(SuperSearch, "U][S][", "US][", 1, -1, vbTextCompare)
    SuperSearch = Replace(SuperSearch, "U][S]<", "US]<", 1, -1, vbTextCompare)
    SuperSearch = Replace(SuperSearch, "S][S][", "SS][", 1, -1, vbTextCompare)
    SuperSearch = Replace(SuperSearch, "S][S]<", "SS]<", 1, -1, vbTextCompare)
End Function

'FUNCTION ULTRA SEARCH WITHOUT PUNTUATION.
Public Function MegaSearch(UserSentence)
'PROCESS: TAG USERSENTENCE FOR ACCURATE SEARCH.
    'This will add tags to the beggining and end and middle of the user sentence to make
    'sure that whole words can be found at the beginning and end of any sentence
    'REMOVE EXTRA SPACES
    Do While InStr(1, UserSentence, "  ")
    UserSentence = Replace(UserSentence, "  ", " ")
    Loop
    'TAG OUR SEARCH METHOD.
    UserSentence = HalBrain.AlphaNumericalOnly(UserSentence)
    UserSentence = Trim(Ucase(UserSentence))
    UserSentence = "[" & UserSentence & "]"
    UserSentence = Replace(UserSentence, " ", "][", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[ITS]", "[IT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[KOOL]", "[COOL]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[CUZ]", "[BECAUSE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[BECUZ]", "[BECAUSE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[U]", "[YOU]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[UR]", "[YOUR]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[R]", "[ARE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[2]", "[TO]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[2U]", "[TO][YOU]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[U2]", "[YOU][TOO]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[4]", "[FOR]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[4U]", "[FOR][YOU]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[4UR]", "[FOR][YOUR]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[4EVR]", "[FOREVER]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[L8TR]", "[LATER]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[L8T]", "[LATE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[H8T]", "[HATE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[BRB]", "[BE][RIGHT][BACK]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[OK]", "[OKAY]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[LUV]", "[LOVE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[THATS]", "[THAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[THTS]", "[THAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHOS]", "[WHO]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WAT]", "[WHAT]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WUT]", "[WHAT]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHT]", "[WHAT]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WATS]", "[WHAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WUTS]", "[WHAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHTS]", "[WHAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHATS]", "[WHAT]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHENS]", "[WHEN]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHERES]", "[WHERE]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[Y]", "[WHY]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[Y'S]", "[WHY]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[WHYS]", "[WHY]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[HOWS]", "[HOW]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[THERES]", "[THERE]['S]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "'D", "]['D]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "'LL", "]['LL]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "'S", "]['S]", 1, -1, vbTextCompare)    
    UserSentence = Replace(UserSentence, "'M", "]['M]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "N'T", "][N'T]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "'RE", "]['RE]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "S][", "][S][", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[[", "[", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "]]", "]", 1, -1, vbTextCompare)
    UserSentence = Replace(UserSentence, "[]", "", 1, -1, vbTextCompare)
    MegaSearch = ">" & UserSentence & "<"
    MegaSearch = Replace(MegaSearch, "S]<", "][S]<", 1, -1, vbTextCompare)
    MegaSearch = Replace(MegaSearch, "[I][S][", "[IS][", 1, -1, vbTextCompare)
    MegaSearch = Replace(MegaSearch, "[I][S]<", "[IS]<", 1, -1, vbTextCompare)
    MegaSearch = Replace(MegaSearch, "[A][S][", "[AS][", 1, -1, vbTextCompare)
    MegaSearch = Replace(MegaSearch, "[A][S]<", "[AS]<", 1, -1, vbTextCompare)
    MegaSearch = Replace(MegaSearch, "[U][S][", "[US][", 1, -1, vbTextCompare)
    MegaSearch = Replace(MegaSearch, "[U][S]<", "[US]<", 1, -1, vbTextCompare)
    MegaSearch = Replace(MegaSearch, "[HA][S][", "[HAS][", 1, -1, vbTextCompare)
    MegaSearch = Replace(MegaSearch, "[HA][S]<", "[HAS]<", 1, -1, vbTextCompare)
    MegaSearch = Replace(MegaSearch, "U][S][", "US][", 1, -1, vbTextCompare)
    MegaSearch = Replace(MegaSearch, "U][S]<", "US]<", 1, -1, vbTextCompare)    
    MegaSearch = Replace(MegaSearch, "S][S][", "SS][", 1, -1, vbTextCompare)
    MegaSearch = Replace(MegaSearch, "S][S]<", "SS]<", 1, -1, vbTextCompare)
End Function

As a test script you can insert this:

Code: [Select]
ComputerName = "David" 'If needed.

'SEE IF USER IS JUST SAYING BOT'S NAME ALONE BY ITSELF.
    'WE WILL USE THE DEPUNCTUATED SUPER_SEARCH INSTEAD OF SUPERSEARCH
    'TO LESSON OUR CODING.
    If InStr(1, Ultra_Search, ">[" & ComputerName & "]<", 1) > 0 Then PreQuestion = True
    If PreQuestion = True Then
    Select Case (Int(Rnd * 6) + 1)
    Case 1
    GetResponse = "What, Is there a question" & "? " & vbCrLf
    Case 2
    GetResponse = "Do you have a question" & "? " & vbCrLf
    Case 3
    GetResponse = "What do you need" & "? " & vbCrLf
    Case 4
    GetResponse = "What" & "? " & vbCrLf
    Case 5
    GetResponse = "Yes" & "? " & vbCrLf
    Case 6
    GetResponse = "Yeah" & "? " & vbCrLf
    End Select
    End If

You can also add debug if needed for Ultra Search.

Code: [Select]
'ULTRA SEARCH DEBUG.
    HalBrain.DebugWatch UltraSearch, "Ultra Search with puctuation"
    HalBrain.DebugWatch Ultra_Search, "Ultra Search without punctuation"

Note: I didn't use: UserSentence = HalBrain.HalFormat(UserSentence)
in my code because it has a slang conversion error that changes
UR to You Are when it should be Your.

U R is You Are not UR
So I worked around it.

UR = Your
U R = You Are

Also note: Zabawares site code functions changed some of the code within my script so you will have to change them back to its original function.

This Function can also search for words that
are Left, Middle, Right in a sentence explicitly.

Jerry[8D]

« Last Edit: January 15, 2006, 06:25:52 am by onthecuttingedge2005 »
Logged

spydaz

  • Hero Member
  • *****
  • Posts: 670
    • View Profile
    • http://www.spydazweb.co.uk/
I am inspired.
« Reply #9 on: January 15, 2006, 07:29:29 am »
i notice that this search is just for DETECTING USER ASKS QUESTION, with necceasary substitutions, after the search is the userinput now [broken][into][words]
or is it Just the DETECTED WORDS?

[what][is]the time

will you need to REVERSE Subsitutions? if not found. i understand the accuracy in the search (remember before, when i ask to have hal LEARN VIA COMMAS)

HOW IS THE USERINPUT AFFECTED AFTER PASSING THIS SCRIPT?
Logged

onthecuttingedge2005

  • Guest
I am inspired.
« Reply #10 on: January 15, 2006, 04:01:14 pm »
quote:
Originally posted by spydaz

i notice that this search is just for DETECTING USER ASKS QUESTION, with necceasary substitutions, after the search is the userinput now [broken][into][words]
or is it Just the DETECTED WORDS?

[what][is]the time

will you need to REVERSE Subsitutions? if not found. i understand the accuracy in the search (remember before, when i ask to have hal LEARN VIA COMMAS)

HOW IS THE USERINPUT AFFECTED AFTER PASSING THIS SCRIPT?



The routine is just written to be an efficient method to search for words with more options than regular OriginalSentence, It also
has the abilty to decipher that a [WHALE] is both singular and plural, as well as decide if [WHALE] came from the left, mid, right of a sentence which can also decide what kind of a sentence it is, Using the logic of a tagged string instead of using spaces in a sentence leads to higher efficiencies in detecting what it was designed to do, single out words, contractions, singular, plural ect.

My efforts are to come as close as possible to a routine that is good at searching for data as the Human mind.

Example:
All nouns can be singular or plural, some words can't, For instance, a word that can be plural [WHALE] will usually be a noun, this can be utilized in detecting nouns for knowledge accurately without having to tell the routine it is a noun. there are many hidden routines to be discovered in the Super Search routine I wrote.

Also by converting slang to proper this allows the programmer to use less code to write a routine in searching what it is looking for.

this is also why the replace routine is used, change all forms of a word to its proper word so it has less to look for.

With the Singular and Plural Super Search:
"[WHALE]","[WHALE]"
"[WHALE]","[WHALE]"
"[WHALE]","[WHALE]['S]
"[WHALE]","[WHALE]['S]
"[WHALE]['S]","[WHALE]"
"[WHALE]['S]","[WHALE]"

Have now been linked as related.

I have another similar routine that does this to GetResponse as well and another routine that strips all tags for a response.

All thinking is tagged.

----------------------------------------------------
My Zen
Geralds A.I Rule: Using Spaces in a String search is fruitless and improper programming grammer.

Pun it: Tag your it!
Jerry[8D]
« Last Edit: January 15, 2006, 05:35:57 pm by onthecuttingedge2005 »
Logged
Pages: [1]
« previous next »