DIR : /home/kozerus/public_html/ghost_lines.html /home/kozerus/public_html  <html><head> <meta http-equiv="content-type" content="text/html; charset=UTF-8"><meta name="viewport" content="width=device-width"><title>https://ai.neocities.org/Ghost.html</title><link rel="stylesheet" type="text/css" href="resource://content-accessible/viewsource.css"></head><body id="viewsource" class="highlight" style="-moz-tab-size: 4" contextmenu="actions"><pre id="line1">”."><html> <head> <title>Ghost Strong AI Guaranteed to Think with MSIE</title> <meta name="<a class="attribute-value">description</a>" content="<a class="attribute-value">Tutorial AI demonstrates Natural Language Understanding (NLU).</a>" /> <meta name="<a class="attribute-value">keywords</a>" content="<a class="attribute-value">AGI, AiMind, AI Mind Maintainer, artificial intelligence, javascript, MSIE, natural language understanding, NLU, prior art, spreading activation, strong AI</a>" /> <script language="<a class="attribute-value">JavaScript</a>"> var abc = ""; // AudBuffer() transfer character; 4jan2012 var abort = false; // 29dec2006 For orchestration of sentence-generation. var act = 0; // AI4U: old- & newConcept; Reify(); nounPhrase; verbPhrase. var actpsi = 0; // 2017-12-31: psi from which activation is to be spread var anset = 0; // Set "an" before a vowel at start of noun. var apb = ""; // 31dec2006: candidate to replace "fyi" variable. apb = "You have halted the AI Mind at Rejuvenation cycle #"+rjc+"."; var artnum = 0; // article num(ber) as parameter for EnArticle; 6nov2011 var aud = 0; // 20mar07A: enVocab; Audition; Speech: auditory recall-tag. var aud0 = ""; // AI4U: audRecog; audExam; audSTM; Speech: auditory engram. var aud1 = 0; // 2018-01-07 var aud2 = 0; // 2018-01-07 var audbase = 0; // from RuAi; recall-vector for VerbGen(); 17oct2012 var auddata = ("<b>" + "Auditory memory nodes" + "<\/b>" + "<BR>"); auddata += ("krt pho act audpsi"); // 2018-01-03 var audjuste = 0; var audnum = 0; // de-globalizing the "num" variable; 4nov2012 var audpsi = 0; // 6dec2009 de-globalizing the "psi" variable var audrec = 0; // 8dec2009 Replaces "psi" in AudRecog module. var audrun = 0; // 2018-01-07: Counter of loops through AudRecog(); var audrv = 0; // 2017-12-31: auditory recall-vector for Speech() var audstop = 0; // Flag to stop SpeechAct after one word; 7jul2010 var auxverb = 0; // 2018-11-28: such as 800=BE; 818=DO; or modal verb; var b1 = ""; // for OutBuffer(); 2019-06-15 var b01 = ""; // for OutBuffer(); 4jan2012 var b2 = ""; // for OutBuffer(); 2019-06-15 var b02 = ""; // for OutBuffer(); 4jan2012 var b3 = ""; // for OutBuffer(); 2019-06-15 var b03 = ""; // for OutBuffer(); 4jan2012 var b4 = ""; // for OutBuffer(); 2019-06-15 var b04 = ""; // for OutBuffer(); 4jan2012 var b5 = ""; // for OutBuffer(); 2019-06-15 var b05 = ""; // for OutBuffer(); 4jan2012 var b6 = ""; // for OutBuffer(); 2019-06-15 var b06 = ""; // for OutBuffer(); 4jan2012 var b7 = ""; // for OutBuffer(); 2019-06-15 var b07 = ""; // for OutBuffer(); 4jan2012 var b8 = ""; // for OutBuffer(); 2019-06-15 var b08 = ""; // for OutBuffer(); 4jan2012 var b9 = ""; // for OutBuffer(); 2019-06-15 var b09 = ""; // for OutBuffer(); 4jan2012 var b10 = ""; // for OutBuffer(); 4jan2012 var b11 = ""; // for OutBuffer(); 4jan2012 var b12 = ""; // for OutBuffer(); 4jan2012 var b13 = ""; // for OutBuffer(); 4jan2012 var b14 = ""; // for OutBuffer(); 4jan2012 var b15 = ""; // for OutBuffer(); 4jan2012 var b16 = ""; // for OutBuffer(); 26mar2013 var becon = 0; // detect be-verb for InFerence; 18mar2013 var bias = 5; // 20mar07A: Parser; newConcept: an expected part-of-speech. var binc = 0; // "b" increment for AudBuffer; 18oct2012 var brain = true; // 20mar07A: for Think(). var c = ""; // AI4U: Listen(); character code of incoming pho(neme). var c1 = ""; // for AudBuffer(); 2019-06-15 var c2 = ""; // for AudBuffer(); 2019-06-15 var c3 = ""; // for AudBuffer(); 2019-06-15 var c4 = ""; // for AudBuffer(); 2019-06-15 var c5 = ""; // for AudBuffer(); 2019-06-15 var c6 = ""; // for AudBuffer(); 2019-06-15 var c7 = ""; // for AudBuffer(); 2019-06-15 var c8 = ""; // for AudBuffer(); 2019-06-15 var c9 = ""; // for AudBuffer(); 2019-06-15 var c10 = ""; // for AudBuffer(); 4jan2012 var c11 = ""; // for AudBuffer(); 4jan2012 var c12 = ""; // for AudBuffer(); 4jan2012 var c13 = ""; // for AudBuffer(); 4jan2012 var c14 = ""; // for AudBuffer(); 4jan2012 var c15 = ""; // for AudBuffer(); 4jan2012 var c16 = ""; // for AudBuffer(); 4jan2012 var caller = "none"; // AI4U: Diagnostic for Alert boxes. var catiobj = 0; // 2019-02-12: concat-indirect-object for ConJoin() "AND". var catdobj = 0; // 2019-02-12: concat-direct-object for ConJoin() "AND". var catsub = 0; // 2019-02-12: concat-subject for ConJoin() "AND". var catverb = 0; // 2019-02-12: concat-verb for ConJoin() "AND". // var cns = 1024; // AI4U: Central Nervous System array size choice. // var cns = 2048; // 2018-11-13: enlarge experiential memory for MindBoot prepositions. var cns = 3072; // 2018-12-09: enlarge experiential memory for MindBoot verbs. var coda = 64; // AI4U: Rejuvenate(): memory displacement span. // var coda = 128; // AI4U: Rejuvenate(): memory displacement span. var cognum = 0; // grammatical number of cogpsi; 27oct2011 var conj = 0; // AI4U: oldConcept(); Conjoin(): conj(unction). var danger = true; // 20mar07A: for Security(). var dba = 0; // 2017-12-31: doing-business-as noun-case or verb-person var defact = 0; // default activation for NounPhrase; 25oct2011 var defartcon = 0; // definite article condition; 19apr2011 var dialog = ""; // 20mar07A: Transcribe; Transcript: user input & AI output. var dirobj = 0; // 2018-01-12: flag to indicate that a d.o. is being fetched. var doa = 0; // 2018-01-06: flag for exiting from AudInput loop var dob = ""; // 2018-01-24: date-of-birth to remain fixed over each run. var dobmfn = 0; // for InFerence to pass gender to AskUser; 20mar2013 var dobseq = 0; // for transfer within InFerence; 18mar2013 var dunnocon = 0; // 2018-01-23: condition of "I-don't-know" for queries. var edge = 0; // AI4U: Rejuvenate: edge-of-thought flag. var endpho = 0; // 2018-01-06: to track final character of word for num(ber) var engov = 0; // 2018-01-01: possible replacement for too strict "hlc" var engram = ""; var eot = 0; // 20mar07A: CR; Listen(); Audition(): end-of-transmission flag. var etc = 0; // 2019-02-18: number of ideas simultaneously active for ConJoin() var eureka = 0; // 2018-11-13: value for use in until-loop var finlen = 0; // 2017-12-31: fin(al) len(gth) or end-of-word for AudRecog var foom = 0; // 2018-09-04: arbitrary trigger for invoking a Spawn() module. var freedom = true; // 20mar07A: for Volition(). var fyi = 0; // AI4U: Voice(): messages "For Your Information" to user. var gencon = 0; // status-con flag when calling VerbGen; 17oct201 // var greet = 10; // greeting-trigger; 17nov2010 var greet = 5; // for speedier testing; 29oct2011 var hap = 0; // 2019-11-07: a "haptic" sensation of touch for TacRecog() var haptac = 0; // 2019-11-07: for transfer from TacRecog() to EnVerbPhrase() var hardcopy = false; // 20mar07A: Transcript(): a flag for session print-outs. var hear = 0; // 2018-01-06: AudInput outer loop counter. var hlc = "en"; // 2017-12-31: human-language code var holdnum = 0; // transfer from subject to verb; 4nov2012 var html = ""; // AI4U: HyperText Markup Language for creating Web pages. var i = 0; // AI4U: i(ndex) of loops. var idle = 0; // 2018-01-13: counter for a delay during TEST mode. var img = "xoxoxoxox"; // AI4U: visRecog: for future use as "image". var impetus = 0; // 2018-09-21: a level of curiosity and a trigger var inbuffer = ""; // AI4U: Listen(); CR(): build-up of user input. var indefartcon = 0; // indefinite article condition; 19apr2011 var indefmust = 0; // force saying of "A" or "AN"; 23oct2011 // var inert = 1; // 20mar07A: Listen; Ego; Think; Security: Ego-trigger. // var inert = 1; // Until user presses a key; 20jul2011 var inert = 0; // for quick asking of a cogpsi question; 23oct2011 var inft = 0; // inference-time for AskUser; 18mar2013 var infincon = 0; // infinitive condition flag; 24jun2015 var inhibcon = 0; // flag for inhibition in InStantiate; 27oct2011 var input = ""; // 2018-01-19: string of input for diagnostic TEST var instnum = 0; // instantiation number for immediate or delayed use ) var iob = 0; // 2017-12-31: indirect-object tag for psy concept array var isolation = 0; // 2018-10-03: counter to trigger "TEACH ME SOMETHING" var istr = 0; // 2018-10-13: first point of memories to be kept in ReJuvenate var j = 0; // AI4U: spreadAct; Rejuvenate; Reify: nested loop index. var jrt = 0; // AI4U: Rejuvenate(): "junior time" for moved memories. var jux = 0; // AI4U: Parser; Instantiate: a JUXtaposed word. var kbcon = 0; // flag for awaiting a yes-or-no answer; 29jun2011 var kbzap = 0; // 2018-01-28: hold 432=YES or 404=NO for KbRetro() var krt = 0; // AI4U: Troubleshoot(): "knowledge representation time". var lastpho = 0; // to avoid extra "S" on verbs; 2sep2010 var lastword = false; // 20mar07A: 29nov2006 For zeroing "seq" tags. var len = 0; // AI4U: Listen(); Audition(); reEntry(); word-length. var life = true; // AI4U: Shutdown(): for use in halting the AI. var lurk = 0; // counter to activate initial thinking; 29sep2010 var mfn = 0; // 2apr2010 for En(glish) gender flag. var mfnflag = 0; // gender flag to cause a who-query; 3aug2011 var mg = 0; // 2018-10-14: m(emory) gap for moving tkb in ReJuvenate() var midway = 0; // AI4U: audRecog: a stopping point for backward searches. var mjact = 0; // 2018-01-12: motjuste-activation for defaulting to 701=I var monopsi = 0; // AI4U: audRecog: for recognition of a mono-character. var moot = 0; // flag to prevent associations in DO-queries; 22aug2011 var morphpsi = 0; // for audRecog recognition of morphemes var motjuste = ""; // 2018-01-12: "best word for inclusion in a thought" var mri = 0; // 2019-09-20: time of most-recent-instantiation - for back-tagging. var mtx = 0; // 2017-12-31: machine-translation xfer tag for flag-panel. var negjux = 0; // flag for 250=NOT juxtaposed to a verb; 21mar2013 var newpsi = 0; // for singular-nounstem assignments; 18mar2013 var nlt = 5; // AI4U: Listen(); CR(): time for "not-later-than". // var node = 0; // 11aug2006: For use with tutorial slosh-over display. var nonce = 630; // AI4U: Security(); Troubleshoot(): recent "nonce" time. // var nounaud = 0; var nounlock = 0; // for a verb to lock onto a seq-noun; 13oct2011 // var nounval = 0; // 20mar07A: 26dec2006: For transfer from nounPhrase to nounAct. var now = ""; // 2018-01-24: holder of a Date() string for TranScript() etc. var nphrnum = 0; // 2018-03-17: noun-phrase num(ber) in InStantiate() etc. var nphrpos = 0; // for testing in EnCog; 13aug2010 var nucon = 0; // 2018-01-23 flag to indicate a new concept for SpreadAct() var num = 0; // 2018-01-27: grammatical num(ber) var numcon = ""; // number status flag to call RetroSet; 23mar2013 var numflag = 0; // for EnArticle() 1oct2010 var numreq = 0; // 2018-05-25: NUMber REQuired for agreement of subj & pred. nom. var numsubj = 0; // for number of subject; 14jun2011 var nxr = 0; // 2017-12-31: for AudRecog dealing with next memory row var nxt = 0; // 2017-01-09: number incremented for each new concept var objnum = 0; // 2018-06-16: object number for sake of EnArticle() var objprep = 0; // 2018-10-28: object of a preposition; for EnPrep() var oldpsi = 0; // found by AudRecog() and stored in OldConcept( var onset = 0; // 20mar07A: Listen; Audition; reEntry; Speech: of a word. // var oubliette = 0; // 2018-01-18: size of vault+coda for ReJuvenate() var output = ""; // 20mar07A: Voice(); Speech(): the "output" of the Mind. var pho = ""; // 2018-01-12: pho(neme) of auditory input. var phodex = 0; // pho-index for AudBuffer(); 4jan2012 var pos = 5; // 2018-01-23: 1=adj 2=adv 3=conj 4=interj 5=noun 6=prep 7=pron 8=verb var posflag = 0; // AskUser discriminand; 13aug2010 var pov = "2"; // 2018-01-02: point-of-view: 1=self; 2=dual; 3=alien. var prc = 0; // was "provrec"; provisional recognition in AudRecog var pre = 0; // AI4U: Instantiate(): pre(vious associand) concept. // var precand = 0; // 20mar07A: 30nov2006 Inviolate "pre" candidate. var predflag = 0; // indicates predicate nominative; 16sep2010 var prednom = 0; // predicate nominative for InFerence; 18mar2013 var prejux = 0; // previous jux to carry NOT to verb; 24jul2011 var prepcon = 0; // 2018-01-21: prepositional condition-flag for parsing. var prep = 0; // 2018-10-26: preposition identifier for EnPrep() var prepgen = 0; // 2018-01-20: urgency to generate a prepositional phrase. var prepsi = 0; // 2019-04-09: identifier of "pre" concept for activation to spread to. // var preset = 0; // 20mar07A: 30nov2006 For setting Instantiate() "pre". var prevtag = 0; // 20mar07A: 30nov2006 So Instantiate may declare "prevtag". var prox1 = 0; // first proximate concept of input cluster; 14sep2011 var prox2 = 0; // for determining association among engrams; 14sep2011 var prox3 = 0; // for disparate reactivation in ReActivate; 14sep2011 var proxcon = 0; // flag to indicate usage of prox variables; 14sep2011 var prsn = 0; // 1st, 2nd, 3rd person; or infinitive zero; 17jun2015 var prv = 0; // 2017-12-31: for AudRecog() to examine pre(vious) row var psi = 0; // AI4U: Instantiate; audNode: associative tag to a concept. var psi0 = 0; // AI4U: first of the elements in a Psi concept panel. var psi1 = 0; var psi8 = 0; // test; 13oct2011 // var psibase = 0; var psidata = ("<b>" + "Concepts with associative tags for "); psidata += ("Natural Language Understanding:" + "<\/b>" + "<BR>"); psidata += ("krt tru psi hlc act mtx jux pos dba num mfn "); // 2019-09-20 psidata += ("pre seq tgn tdt tkb tia tcj tdj tdv tpr rv"); // 2019-09-20: expanded var putnum = 0; // putative num(ber) for subj-verb agreement; 24oct2011 var px1 = 0; // 2019-09-20: preposition-transfer carrier for NLP generation. var px2 = 0; // 2019-09-20: preposition-transfer carrier for NLP generation. var px3 = 0; // 2019-09-20: preposition-transfer carrier for NLP generation. // var questype = 0; // AI4U: oldConcept; Conjoin(): flag for "why" questions. // var quiet = true; // 2018-01-12: in AI4U, needed for the Think module. var quiet = false; // 2018-06-11: wait one thought-cycle for user input. var qucon = 0; // 2018-01-21: query-condition for dealing with query-words. var quobj = 0; // query-object for yes-or-no questions; 22jun2011 var quobjaud = 0; // recall-tag for AskUser(); 20&24jun2015 var qus = 0; // provisional query-subject in advance of queries var qusnum = 0; // query-subject-number for AskUser; 28mar2013 var qusub = 0; // query subject in more readable code; 2oct2010 var qusubnum = 0; // num(ber) of query-subject; 27oct2011 var quverb = 0; // query-verb for yes-or-no questions; 22jun2011 var qv1psi = 0; // 2018-01-12: concept for SpreadAct to seek as a subject var qv2num = 0; // 2018-01-12: num(ber) of a verb in a who+verb+dir.obj response. var qv2psi = 0; // 2018-01-12: concept for SpreadAct to seek as a verb var qv3psi = 0; // 2018-01-12: concept for SpreadAct to seek as ind. obj. var qv4psi = 0; // 2018-01-12: concept for SpreadAct to seek as dir. obj. var qvdocon = 0; // 2018-01-23: query-condition for who+verb+direct-object. var qviocon = 0; // 2018-01-23: query-condition for who+verb+indirect-object. var recnum = 0; // recognized number of a recognized word 20jul2011 var recon = 0; // AI4U: newConceptl English; Ask(): incentive to question. // var residuum = 0; // 20mar07A: psiDamp(): level of post-thought activation. var rjc = 0; // AI4U: Rejuvenate(): counter of rejuvenations per lifetime. var rugov = 0; // 2018-01-01: possible replacement for too strict "hlc" var rsvp = 2000; // AI4U: aLife: delay in milliseconds before next loop. var rv = 0; // 2017-12-31: recall-vector for auditory memory. var seq = 0; // 2018-01-12: subSEQuent Psy concept in an idea. var seqdob = 0; // for direct object transfer within InFerence() var seqneed = 0; // noun/pronoun or verb needed as a "seq"; 4oct2011 var seqpos = 0; // "seq" concept part-of-sppeech; 4oct2011 var seqpsi = 0; // for deglobalizing "seq" in SpreadAct(); 16sep2010 var seqrvx = 0; // 2018-01-25: for rvx transfer within InFerence() var seqtkb = 0; // for transfer during InFerence; 18mar2013 var seqverb = 0; // interstitial carrier for InFerence; 18mar2013 var singflag = 0; // singularity flag for singular nouns; 4nov2011 var skip = 0; // 20mar07A: for use in Listen() to skip incomplete input. var snu = 0; // subject-number verb-selection parameter; 18oct2012 var spacegap = 0; // 2017-12-31: to add gap of one space in Speech var spike = 0; var spt = 0; // 2018-01-12: blank space time before start of a word var stemgap = 0; // for avoiding false AudRecog() stems var stempsi = 0; // for singular noun-stem recognition; MF; 23jun2015 var subjcall = 0; // To avoid showSubject() of articles; 21may2011 var subjectflag = 0; // 9dec2009 For NounPhrase to call SelfRef. var subjnom = 0; // subject-nominative for InFerence; 18mar2013 var subjnum = 0; // for agreement with predicate nominative; 18may2011 var subjold = 0; // old subject as default candidate 29sep2010 var subjpre = 0; // 2018-01-21: subject-pre to be held for verb in parsing. var subjprsn = 0; // possible holder of "dba" for input verbs; 31oct2012 var subjpsi = 0; // 2018-01-12: parameter to govern person of verb-forms var sublen = 0; // length of AudRecog() subpsi word-stem var subpsi = 0; // for AudRecog() of sub-component wordstems var svo1 = 0; // 2018-01-04: subject -- item #1 in subject-verb-object var svo2 = 0; // 2018-01-04: verb -- item #2 in subject-verb-object var svo3 = 0; // 2018-01-04: indir. obj. -- item #3 in subject-verb-object var svo4 = 0; // 2018-01-04: dir. obj. -- item #4 in subject-verb-object // var svoyes = false; var t = 0; // AI4U: Listen; CR; reEntry: time [may become "krt" (q.v.)]. var t2s = 0; // 2017-12-31: auditory text-to-speech index var tbev = 0; // 2018-06-12: time of be-verb for use with negjux negation-flag. var tcj = 0; // 2019-07-31: conceptual flag-panel time-of-conjunction. var tdj = 0; // 2019-07-31: conceptual flag-panel time-of-adjective. var tdo = 0; // 2018-01-21: time-of-direct-object for EnParser() module. var tdt = 0; // 2019-07-31: time-of-dative conceptual flag-panel indirect-object. var tdv = 0; // 2019-07-31: conceptual flag-panel time-of-adverb. var tgn = 0; // 2019-07-31: time-of-genitive for use in a Parser() module. var tgv = 0; // 2019-07-31: target-verb for EnVerbGen to generate verb-form. var tia = 0; // 2019-07-31: conceptual flag-panel time-of-instrumental ablative. var tio = 0; // 2018-01-21: time-of-indirect-object for EnParser() module. var tkb = 0; // 2017-12-31: time-in-knowledge-base of an idea. var tkbn = 0; // time of retroactive KB noun adjustment; 28jun2011 var tkbo = 0; // 2018-01-29: time of retroactive KB direct-object adjustment; var tkbv = 0; // time of retroactive KB verb adjustment; 28jun2011 var tnpr = 0; // 2019-10-24: time-of-noum-preposition for EnPrep() var topic = ""; // AI4U: newConcept; wtAuxSDo(): new nouns are ?-topics. var topicnum = 0; // grammatical number of question "topic"; 18oct2011 var tov = 1; // AI4U: SVO(); CR(); psiDamp; Reify: time-of-voice. var tpp = 0; // 2018-01-21: time-of-preposition for parsing. var tpr = 0; // 2019-07-31: conceptual flag-panel time-of-preposition. var tpu = 0; // 2018-01-02: time-pen-ultimate before current I/O; var trouble = true; // AI4U: HCI; Security; Troubleshoot: flag. var tseln = 0; // NounPhrase: time of selection of noun; 10may2011 var tselo = 0; // 2018-11-13: time of selection of object var tselp = 0; // 2018-10-28: time of selection of preposiiton; for EnPrep() var tsels = 0; // 25oct2011 var tselv = 0; // VerbPhrase: time of selection of Verb; 10may2011 var tsj = 0; // 2018-01-21: time-of-subject for parsing. var tru = 0; // 2017-12-31: tru(th)-value tag for conceptual flag-panel var tult = 0; // AI4U: Audition; audSTM: penultimate time-minus-one. var tutor = false; // AI4U: Security; Tutorial(): on/off status flag. var tvb = 0; // 2018-01-21: time-of-verb for parsing var tvpr = 0; // 2019-10-24: time-of-verb-preposition for EnPrep() var unk = ""; // AI4U: general variable for "unknown" items. var us1 = 0; // 2018-09-04: http://ai.neocities.org/var.html#us1 var us2 = 0; // 2018-09-04: "us2" for THE UpStream noun number two. var us3 = 0; // 2018-09-04: "us3" for THE UpStream noun number three. var us4 = 0; // 2018-09-04: for $psi # of THE noun mentioned upstream. var us5 = 0; // 2018-09-04: for $psi # of THE noun during EnArticle(). var us6 = 0; // 2018-09-04: for $psi # of THE noun on a rotating basis. var us7 = 0; // 2018-09-04: for $psi of an AI keeping seven items in mind. var userline = ""; // AI4U: CR(); Transcribe(): text input of user. var usn = 0; // 2018-09-04: rotation-number for us1-us7 EnArticle() concepts. var usx = 0; // 2018-09-04: transfer-variable for us1-us7 upstream variables. var vacpsi = 0; // de-globalized psi for VerbAct(); 1oct2010 var vault = 2204; // 2019-11-07: size of MindBoot as revealed by diagnostic code. var verblock = 0; // for subject-noun to lock onto seq-verb; 13oct2011 var verbcon = 0; // 2018-01-21: verb-condition for seeking (in)direct objects. var verbpsi = 0; // for transit into WhatAuxSVerb() 14jun2011 // var verbprsn = 3; // changing to zero for infinitive forms; 17jun2015 var verbprsn = 0; // reverting to zero for infinitive forms; 24jun2015 var vip = 0; // special ID for verb created by VerbGen; 17oct2012 var vphract = 0; // verb phrase activation level 22jun2011 var vphraud = 0; // holds aud-fetch for SpeechAct; 28jun2011 var vrsn = "7nov19A"; // for Transcript mode; 2019-11-07 var wasvcon = 0; // 2019-03-03: query-condition for what-AUXILIARY-SUBJECT-VERB var wdsvcon = 0; // 2018-12-22: what-do-subjects-VERB-condition for SpreadAct() var whatcon = 0; // 2018-01-21: flag for condition of answering a what-query var wherecon = 0; // 2018-10-28: flag for condition of answering a where-query var whoq = 0; // 2019-03-03: flag for letting AskUser() ask a who-question var wxdflag = 0; // for inhibition of what-do-X-DO queries; 16sep2010 var wxvflag = 0; // for inhibition of what-do-X-VERB queries; 16sep2010 var yncon = 0; // a statuscon to trigger yes-or-no query; 27jun2011 var ynverb = 0; // yes-or-no verb for AskUser; 29jun2011 Psy = new Array(cns); // 2019-07-31: increasing from 15 items to 21 items. for (i = 0; i < cns; i++) { Psy[i] = new psyNode(" "," "," "," "," "," "," ", " "," "," "," "," "," "," ", " "," "," "," "," "," "," "); // 2019-07-31 } // AI4U: for spreadAct; Instantiate; oldConcept, etc. audMemory = new Array(cns); for (i = 0; i < cns; i++) { audMemory[i] = new audNode(" ",0," "); // 2018-07-13: three columns. } function Tutorial() { if (document.all["cb2"].checked == true) { document.all["cb1"].checked = false; document.all.souvenir.innerHTML = ""; hardcopy = false; document.all["cb3"].checked = false; document.all.tabula.innerHTML = ""; document.all.psicolumn.innerHTML = ""; document.all.audcolumn.innerHTML = ""; trouble = false; tutor = true; fyi = 2; } if (document.all["cb2"].checked == false) { fyi = 0; tutor = false; } document.forms[1].ear.focus(); } function PsiDecay() { // http://ai.neocities.org/PsiDecay.html for (i = t; i>midway; --i) { // AI4U: Loop backwards in recent time. Psy[i].psyExam(); // AI4U: Cycle through recent Psi nodes. if (psi3 > 2) psi3 = (psi3 - 2); // 2018-01-12: approach zero if (psi3 < 0) psi3 = (psi3 + 2); // 2018-01-12: rapid recovery. Psy[i] = new psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31 } // AI4U: end of backwards loop } // 2019-07-31: PsiDecay() returns to various calling modules. function AudDamp() { // 2018-01-09: remove activation from auditory engrams. for (i = t; i > midway; --i) { // 2018-01-05: loop from time=t back to midway. audMemory[i].audExam(); // 2018-01-06: make values available for damping. audMemory[i] = new audNode(aud0,0,aud2); // 2018-01-05: zero activation. } // AI4U: End of cycling back to the loosely "midway" time-point. } // 2018-01-09: AudDamp() returns to input module. function Shutdown() { if (document.all["cb4"].checked == true) { life = false; apb = "You have halted the AI Mind at Rejuvenation cycle #"+rjc+"."; Voice(); } if (document.all["cb4"].checked == false) { life = true; document.forms[1].ear.focus(); TID=window.setTimeout("MainLoop();",1000); } } function Destroy() { document.forms[1].ear.focus(); life = false; apb = "Closing the window will destroy the AI."; Voice(); alert("The AI Mind is alive. You may unclick your decision."); TID=window.setTimeout("window.close();",500); } function Transcribe() { if (hardcopy == true) { dialog += ("<P>Ghost: " + output); // 2019-11-07: changed from Robot to Ghost dialog += ("<BR>Human: <b>" + userline + '<\/b>'); output = ""; // avoid spurious repeats; 6nov2011 userline = ""; } } function Transcript() { if (document.all["cb1"].checked == true) { document.all["cb2"].checked = false; document.all["cb3"].checked = false; document.all.tabula.innerHTML = ""; document.all.psicolumn.innerHTML = ""; document.all.audcolumn.innerHTML = ""; trouble = false; hardcopy = true; fyi = 1; now = new Date(); adcopy=("<font size='+2'>AI Mind version "+vrsn+" on " +now+"<\/b><\/font>"); document.all.souvenir.innerHTML = adcopy; } Transcribe(); if (hardcopy == true) { document.all.psicolumn.innerHTML = ""; document.all.audcolumn.innerHTML = ""; } document.all.tabula.innerHTML = dialog; if (document.all["cb1"].checked == false) { document.all.souvenir.innerHTML = ""; hardcopy = false; document.all.tabula.innerHTML = ""; } if (hardcopy == false) html = ""; } function psiList() { // nonce = 1; // 2019-07-31: for troubleshooting; COMMENT-OUT BUT KEEP for (i = nonce; i < (t +1); i++) { Psy[i].psyExam(); psidata += ("<BR>" +i+ ". "+psi0+ " <b>" +psi1+"<\/b> " +psi2+" "+psi3+" "+psi4); psidata += (" "+psi5+" "+psi6+" "+psi7+" "+psi8+" "+psi9+" "+psi10); // 2019-07-31 psidata += (" "+psi11+" "+psi12+" "+psi13+" "+psi14+" "+psi15); // 2019-07-31 psidata += (" "+psi16+" "+psi17+" "+psi18+" "+psi19+" "+psi20); // 2019-07-31 } // 2019-07-31: end of loop showing conceptual flag-panel data. } // 2019-07-31: psiList returns to Diagnostic() function audList() { for (i = nonce; i < (t +1); i++) { audMemory[i].audExam(); if (aud0 == " ") aud1 = " "; auddata += ("<BR>" + i + ". <b>"+aud0+ "<\/b> "+aud1+" "+aud2); // 2018-01-06 } } function KbLoad() { // 2017-12-31: introduced from ghost.pl AI Psy[t] = new psyNode(tru,psi,hlc,act,mtx,jux,pos, dba,num,mfn,pre,seq,tgn,tdt, tkb,tia,tcj,tdj,tdv,tpr,rv); // 2019-07-31 tru=0;psi=0;hlc=0;act=0;mtx=0;jux=0;pos=0; // 2019-07-31: dba=0;num=0;mfn=0;pre=0;seq=0;tgn=0;tdt=0; // 2019-07-31: tkb=0;tia=0;tcj=0;tdj=0;tdv=0;tpr=0;rv=0;pho="";audpsi=0; // 2019-07-31 } // 2019-07-31: end of KbLoad(); return to MindBoot knowledge bootstrap. function OutBuffer() { // http://ai.neocities.org/OutBuffer.html b1=" "; b2=" "; b3=" "; b4=" "; b5=" "; b6=" "; // 2019-06-15 b7=" "; b8=" "; b9=" "; b10=" "; b11=" "; b12=" "; // 2019-06-15 b13=" "; b14=" "; b15=" "; b16=" "; // 2019-06-15: clear tabula rasa; if (c16>"") { // if the AudBuffer full; 4jan2012 b1=c16; b2=c15; b3=c14; b4=c13; b5=c12; b6=c11; b7=c10; b8=c9; b9=c8; b10=c7; b11=c6; b12=c5; b13=c4; b14=c3; b15=c2; b16=c1; // 2019-06-15 return; // abandon remainder of function; 4jan2012 } // end of transfer of a 16-character word; 4jan2012 if (c15>"") { b1=c15; b2=c14; b3=c13; b4=c12; b5=c11; b6=c10; b7=c9; b8=c8; b9=c7; b10=c6; b11=c5; b12=c4; b13=c3; b14=c2; b15=c1; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 15-character word. if (c14>"") { b1=c14; b2=c13; b3=c12; b4=c11; b5=c10; b6=c9; b7=c8; b8=c7; b9=c6; b10=c5; b11=c4; b12=c3; b13=c2; b14=c1; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 14-character word. if (c13>"") { b1=c13; b2=c12; b3=c11; b4=c10; b5=c9; b6=c8; b7=c7; b8=c6; b9=c5; b10=c4; b11=c3; b12=c2; b13=c1; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 13-character word. if (c12>"") { b1=c12; b2=c11; b3=c10; b4=c09; b5=c8; b6=c7; b7=c6; b8=c5; b9=c4; b10=c3; b11=c2; b12=c1; b13=""; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 12-character word. if (c11>"") { b1=c11; b2=c10; b3=c9; b4=c8; b5=c7; b6=c6; b7=c5; b8=c4; b9=c3; b10=c2; b11=c1; b12=""; b13=""; b14=""; b15=""; b16=""; // 201-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of an 11-character word. if (c10>"") { b1=c10; b2=c9; b3=c8; b4=c7; b5=c6; b6=c5; b7=c4; b8=c3; b9=c2; b10=c1; b11=""; b12=""; b13=""; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 10-character word. if (c9>"") { b1=c9; b2=c8; b3=c7; b4=c6; b5=c5; b6=c4; b7=c3; b8=c2; b9=c1; b10=""; b11=""; b12=""; b13=""; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 9-character word. if (c8>"") { b1=c8; b2=c7; b3=c6; b4=c5; b5=c4; b6=c3; b7=c2; b8=c1; b9=""; b10=""; b11=""; b12=""; b13=""; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of an 8-character word. if (c7>"") { b1=c7; b2=c6; b3=c5; b4=c4; b5=c3; b6=c2; b7=c1; b8=""; b9=""; b10=""; b11=""; b12=""; b13=""; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 7-character word. if (c6>"") { b16=c6; b2=c5; b3=c4; b4=c3; b5=c2; b6=c1; b7=""; b8=""; b9=""; b10=""; b11=""; b12=""; b13=""; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 6-character word. if (c5>"") { b1=c5; b2=c4; b3=c3; b4=c2; b5=c1; b6=""; b7=""; b8=""; b9=""; b10=""; b11=""; b12=""; b13=""; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 5-character word. if (c4>"") { b1=c4; b2=c3; b3=c2; b4=c1; b5=""; b6=""; b7=""; b8=""; b9=""; b10=""; b11=""; b12=""; b13=""; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 20p19-06-15: end of transfer of a 4-character word. if (c3>"") { b1=c3; b2=c2; b3=c1; b4=""; b5=""; b6=""; b7=""; b8=""; b9=""; b10=""; b11=""; b12=""; b13=""; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 3-character word. if (c2>"") { b1=c2; b2=c1; b3=""; b4=""; b5=""; b6=""; b7=""; b8=""; b9=""; b10=""; b11=""; b12=""; b13=""; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 2-character word. if (c1>"") { b1=c1; b2=""; b3=""; b4=""; b5=""; b6=""; b7=""; b8=""; b9=""; b10=""; b11=""; b12=""; b13=""; b14=""; b15=""; b16=""; // 2019-06-15 return; // 2019-06-15: abandon remainder of function; } // 2019-06-15: end of transfer of a 1-character word. } // 2019-06-15: end of OutBuffer(); return to AudListen() or VerbGen(). function AudBuffer() { // http://ai.neocities.org/AudBuffer.html phodex = (phodex + 1); // 2019-06-15: increment by one with each iteration. if (phodex==1) { // 2019-06-15: if beginning the count of characters... c1=abc; c2=""; c3=""; c4=""; c5=""; c6=""; c7=""; c8=""; c9=""; c10=""; c11=""; c12=""; c13=""; c14=""; c15=""; c16=""; } // 2019-06-15: end of using phodex=1 to blank out the AudBuffer. if (phodex==2) c2=abc; // 2019-06-15 if (phodex==3) c3=abc; // 2019-06-15 if (phodex==4) c4=abc; // 2019-06-15 if (phodex==5) c5=abc; // 2019-06-15 if (phodex==6) c6=abc; // 2019-06-15 if (phodex==7) c7=abc; // 2019-06-15 if (phodex==8) c8=abc; // 2019-06-15 if (phodex==9) c9=abc; // 2019-06-15 if (phodex==10) c10=abc; // 4jan2012 if (phodex==11) c11=abc; // 4jan2012 if (phodex==12) c12=abc; // 4jan2012 if (phodex==13) c13=abc; // 4jan2012 if (phodex==14) c14=abc; // 4jan2012 if (phodex==15) c15=abc; // 4jan2012 if (phodex==16) c16=abc; // 4jan2012 } // end of AudBuffer(); return to AudListen() or VerbGen(). function psyExam() { // 2017-12-31: renamed to conform with ghost.pl AI. psi0 = this.tru; // 2017-12-31 psi1 = this.psi; // 2017-12-31 psi2 = this.hlc; // 2017-12-31 psi3 = this.act; // 2017-12-31 psi4 = this.mtx; // 2017-12-31 psi5 = this.jux; // 2017-12-31 psi6 = this.pos; // 2017-12-31 psi7 = this.dba; // 2017-12-31 psi8 = this.num; // 2017-12-31 psi9 = this.mfn; // 2017-12-31 psi10 = this.pre; // 2017-12-31 psi11 = this.seq; // 2019-07-31 psi12 = this.tgn; // 2019-07-31 psi13 = this.tdt; // 2019-07-31 psi14 = this.tkb; // 2019-07-31 psi15 = this.tia; // 2019-07-31 psi16 = this.tcj; // 2019-07-31 psi17 = this.tdj; // 2019-07-31 psi18 = this.tdv; // 2019-07-31 psi19 = this.tpr; // 2019-07-31 psi20 = this.rv; // 2019-07-31 } // 2019-07-31: for use with "new PsyNode" etc. function psyNode(tru,psi,hlc,act,mtx,jux,pos,dba,num,mfn, pre,seq,tgn,tdt,tkb,tia,tcj,tdj,tdv,tpr,rv) { this.tru = tru; // 2017-12-31: deemed truth-value from ghost.pl AI this.psi = psi; this.hlc = hlc; // 2017-12-31: human-language code from ghost.pl AI this.act = act; this.mtx = mtx; // 2017-12-31: machine translation xfer from ghost.pl AI this.jux = jux; this.pos = pos; this.dba = dba; // 2017-12-31: grammar function from ghost.pl AI this.num = num; this.mfn = mfn; // 2017-12-31: male/female/neuter gender code from ghost.pl AI this.pre = pre; this.seq = seq; // 2019-07-31: important for identifying an actual concept; this.tgn = tgn; // 2019-07-31: time-of-genitive (for Latin, Russian, German etc.) this.tdt = tdt; // 2019-07-31: time-of-dative this.tkb = tkb; // 2019-07-31: time-in-kb for use with nouns or verbs this.tia = tia; // 2019-07-31: time-of-instrumental/ablative (Russian/Latin) this.tcj = tcj; // 2019-07-31: time-of-conjunction this.tdj = tdj; // 2019-07-31: time of adjective this.tdv = tdv; // 2019-07-31: time-of-adverb this.tpr = tpr; // 2019-07-31: time-of-preposition this.rv = rv; // 2017-12-31: auditory recall-vector from ghost.pl AI this.psyExam = psyExam; // 2017-12-31: } // 2019-07-31: psyNode() returns to various modules using psyExam(). function InStantiate() { // http://ai.neocities.org/InStantiate.html prevtag = 0; // 2018-01-11: Reset for safety. if (qucon > 0 && qv2psi == 800) { // 2018-03-2: before query-subject comes in... } // 2018-03-02: end of test for who-query and be-verb before query-subject. if (pov == 2) { // 2018-01-23: only during external input, not re-entry if (pos == 5) { // 2018-01-27: If external noun comes in... quobj = psi; // 2018-01-27: query-object for AskUser() } // 2018-01-27: End of test for a noun. if (wherecon==1 && pos==5) qusub = psi; // 2018-10-28: TEST if (wherecon==1 && pos==7) qusub = psi; // 2018-10-28: TEST if (psi == 791) { // 2018-01-23: upon input of 791=WHO if (qucon==0) { // 2018-06-16: to set only once per input idea qucon = 1; // 2018-01-23: set positive to process rest of input. whocon = 1; // 2018-12-23: set positive for use in SpreadAct(). } // 2018-06-16: end of test for qucon at zero. } // 2018-01-23: end of test for qucon at zero. if (psi == 781) { // 2018-01-23: upon input of 781=WHAT if (whatcon == 0) { // 2018-01-23: to set only once per input idea whatcon = 1; // 2018-01-23: set positive to process rest of input. } // 2018-01-23: end of test for $whatcon at zero. } // 2018-01-23: end of test for input of 781=WHAT } // 2018-01-23: for later fill-in with conditionals for SpreadAct() if (qucon > 0) { // 2018-01-23: deal with more than "who is" queries... if (psi == 800) { // 2018-00-23: if 800=Be-Verb... qv2psi = 800; // 2018-01-23: for transfer to SpreadAct() } // 2018-01-23: end of test for 800=BE. if (pos == 8 && psi != 800) { // 2018-01-23: if verb but not 800=BE qvdocon = 1; // 2018-01-23: set flag for query who+verb+direct-object. qv2psi = psi; // 2018-01-23: for transfer to SpreadAct() } // 2018-01-23: end of test for verb other than 800=BE. if (qvdocon > 0 && pos == 5) { // 2018-01-23: if 5=noun comes in... qv4psi = psi; // 2018-01-23: to send direct object into SpreadAct() } // 2018-01-23: end of test for noun during who-verb-dirobj query. } // 2018-01-23: end of test for positive query-condition qucon. if (whatcon > 0) { // 2018-01-23: deal with what-queries... if (psi == 800) { // 2018-01-23: if 800=Be-Verb... qv2psi = 800; // 2018-01-23: for transfer to SpreadAct() } // 2018-01-23: end of test for 800=BE. if (pos==5 || pos==7) { // 2018-01-23: if 5=noun or 7=pronoun... qv1psi = psi; // 2018-01-23: for transfer as query-subject to SpreadAct() } // 2018-01-23: end of test for 5=noun or 7=pronoun if (pos==8 && psi != 800 && psi != 818) { // 2018-11-28: if verb but not 818=DO qv2psi = psi; // 2018-01-23: for transfer as query-verb to SpreadAct() } // 2018-11-28: end of test for verb other than auxiliary 818=DO. } // 2018-01-23: end of test for positive query-condition whatcon. if (oldpsi == 701) pos = 7; // 2018-01-11: 7 = pronoun. if (pov==2) { // 2019-03-13: only during external input not re-entry. for (i=tpu; i>midway; --i) { // 2018-01-11: from time-penultimate backwards... Psy[i].psyExam(); // 2018-01-11: examine the Psy concept array... if (psi1 == oldpsi) { // 2018-01-11: if incoming psi matches old psi... psi3 = (psi3 + 24); // 2019-04-09: activate enough to spark a thought if (psi1 == 781) psi3 = 0; // 2018-05-13: deactivate 781=WHAT input. if (wherecon==1) psi3 = 128; // 2018-10-28: TEST Psy[i] = new // 2018-01-23: inserting [psi3]act with higher activation: psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel if (psi10 > 0) { // 2019-04-09: if there is a "pre" concept... prepsi = psi10; // 2019-04-09: grab hold of the "pre" as "prepsi". for (j = tpu; j>midway; j--) { // 2019-04-09: search with first inner loop Psy[j].psyExam(); // 2019-04-09: examine the Psy concept array... if (psi1 == prepsi) { // 2019-04-09: if first inner loop finds prepsi... for (x = tpu; x>midway; x--) { // 2019-04-09: second inner loop Psy[x].psyExam(); // 2019-04-09: examine the Psy concept array... if (psi1>0 && psi11==prepsi) { // 2019-07-31: if subject of "prepsi"... Psy[x] = new // 2019-04-09: psi3 value activates subject of "prepsi" psyNode(psi0,psi1,psi2,32,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi16,psi18,psi19,psi20); // 2019-07-31: expansion. } // 2019-04-09: end of test for subject of "prepsi". } // 2019-04-09: end of second inner loop searching for subject of prepsi. } // 2019-04-09: end of test for "prepsi". } // 2019-04-09: end of backwards inner loop. } // 2019-04-09: end of test for existence of a "pre" concept. } // 2018-01-11: end of search for old engram of incoming psi. } // 2018-01-11: end of for-loop examining Psy concept array. } // 2019-02-13: end of test for point-of-view to be 2=pov external for input. if (pos==5 && num==0) num = instnum; // 2018-01-27: for nouns; if (pos==8 && num==0) { // 2018-01-27: if no verb num from holdnum... if (nphrnum > 0) num = nphrnum; // 2018-01-27: if positive nphrnum. } // 2018-01-27: end of test to use nphrnum to store verb num(ber). if (pos==8) num = nphrnum; // 2018-01-27: verb agrees w. subject; if (psi==818 && moot==1) prevtag = 0; // 2018-11-28: 818=DO for AskUser() if (psi==818 && moot==1) tkb = 0; // 2018-11-28: 818=DO for AskUser() if (psi==818 && moot==1) seq = 0; // 2018-11-28: 818=DO for AskUser() if (pos==8 && infincon==1) { // 2018-01-27: from Askuser() or EnAuxVerb(); num = 0; // 2018-01-27: no num(ber) with infinitive; infincon = 0; // 2018-01-27: reset for safety; } // 2018-01-27: end of test for infinitive condition. tult = (t - 1); // 2018-01-11: penultimate time act = -48; // 2018-01-11: for a "trough" of recent-most inhibition. Psy[tult].psyExam(); // 2018-01-11: examine the Psy concept array... if (tkb == tdo) { tkb = 0 }; // 2018-07-12: prevent direct-object tkb Psy[tult] = new psyNode(444,psi1,psi2,act,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-09-21: instnum = 0; // 2018-01-27: after transfer from OldConcept(); Psy[tvb].psyExam(); // 2019-09-20: expose flag-panel at tvb if (tsj>0 && verbcon>0 && t>tvb &&tdo==0) tdo = tult; // 2019-09-20: Psy[tvb] = new // 2019-09-20: re-assemble the tvb-row with tdo as psi14. psyNode(555,psi1,psi2,psi3,psi4,psi5,psi6, // 2019-09-21: locus of spurious psi19 psi7,psi8,psi9,psi10,psi11,psi12,psi13, tdo,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-09-20: tdo as tkb if (tkb == tdo) tkb = 0; // 2019-09-20: prevent direct-object tkb Psy[tult] = new // 2019-09-20: psyNode(tru,psi,hlc,act,mtx,jux,pos, dba,num,mfn,pre,seq,tgn,tdt, tkb,tia,tcj,tdj,tdv,tpr,rv); // 2019-09-20: expanded conceptual flag-panel. if (pos==5 || pos==8) { // 2019-09-120: for a noun or a verb... tult = (t - 1); // 2019-09-21: re-establish in case at zero. mri = tult; // 2019-09-120: time-of-most-recent-instantiation, for back-tagging. } // 2019-09-20: end of restriction by part-of-speech. if (verbcon == 1 && tdo == 0) tdo = tult; // 2019-09-21: from ghost.pl AI tult = 0; // 2019-09-21: reset for safety; from ghost.pl AI if (jux == 250) jux = 0; // 2018-06-12 from 27jun15A: reset after use; if (prejux == 250) { // 2018-06-11 from 27jun15A: 250=NOT from OldConcept; jux = 250; // 2018-06-12 from 27jun15A: set jux for next instantiand; prejux = 0; // 2018-06-12 from 27jun15A: reset for safety; } // 2018-06-12 from 27jun15A: end of post-instantiation test. if (pos == 5 && psi > 0) usx = psi; // 2018-09-04: for transfer to EnArticle() if (pos == 5 || pos == 7) prevtag = psi; // 2018-01-21: after subject if (pos == 8) prevtag = psi; // 2018-01-21: after a verb. if (pos == 8 && seqneed == 0) seq = psi; // 2018-01-11: for the seq of a subject if (pos == 5 || pos == 7) { // 2018-01-11: if noun or pronoun... seq = 0; // 2018-01-11: until set by the seqneed mechanism... if (seqneed == 0) seqneed = 8; // 2018-01-11: if start of input sentence... if (seqneed == 5) seqneed = 0; // 2018-01-11: for subject only } // 2018-01-11: if (pos == 5 || pos == 7) qv1psi = psi; // 2018-01-21: the subject-concept if (pos == 8) qv2psi = psi; // 2018-02-04: for SpreadAct() or EnArticle() if (pos == 8) seqneed = 5; // 2018-01-11: if verb, need direct object. pre = 0; // 2018-01-21: Reset to prevent carry-over. prepsi = 0; // 2019-04-09: prevent carry-over. } // 2019-09-20: InStantiate() returns to EnParser(). function EnParser() { // http://ai.neocities.org/EnParser.html act = 48; // 2018-01-11: an arbitrary activation for InStantiate() bias = 5; // 2018-01-10: Expect a noun until overruled. InStantiate(); // 2019-09-20: first instantiation during parsing Stage One if (pos == 5) bias = 8; // 2018-01-11: after noun, expect verb. if (pos == 7) bias = 8; // 2018-01-11: after pronoun, expect verb. if (pos == 8) bias = 5; // 2018-01-11: after verb, expect noun if (prepcon == 0) { // 2018-01-21: if not handling a preposition... if (pos == 5 || pos == 7) { // 2018-01-21: noun or pronoun... tsj = (t - 1); // 2018-01-21: time of subject (for pinpoint searches) if (verbcon == 1) { // 2018-01-21: if a verb has come in... if (tio == 0) tdo = tult; // 2018-01-21: set once or twice if (tio == 0) tio = tult; // 2018-01-21: set only once if (tio > 0) { // 2018-01-21: if tio previously set... tdo = tult; // 2019-01-21: second noun sets time of dir.obj. } // 2018-01-21: end of test to make 2nd noun the direct object. tkb = tdo; // 2018-01-21: let verb have a "nounlock" to direct object. Psy[tvb].psyExam(); // 2018-01-21: expose flag-panel of verb pre = psi1; // 2018-01-21: verb psi will be pre of direct object Psy[tio].psyExam(); // 2018-01-21: expose flag-panel of indir. obj. iob = psi1; // 2019-09-20: excerpt indirect-object concept for psi13 Psy[tio] = new // 2019-09-20: insert [psi7]dba "3" for indirect object. psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, 3,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-09-20: expanded flag-panel // 2018-01-21: Above lines insert psi7 dba=3 for dative-case indirect object. Psy[tdo].psyExam(); // 2018-01-21: expose flag-panel of direct object psi10 = pre; // 2018-01-21: obtain the "pre" of the direct object Psy[tdo] = new // 2018-01-21: insert [psi7]dba "4" for direct object. psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, 4,psi8,psi9,psi10,psi11,psi12,psi13, 0,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-09-20: no tkb for dir.obj. // 2019-07-31: Above liness insert verb-psi as psi10 "pre" of direct object. Psy[tvb].psyExam(); // 2018-01-21: expose flag-panel of main verb. tdo = t - 1; // 2018-01-21: insert time-of-direct-object for nounlock; tkb = tdo; // 2018-01-21: from verb, "nounlock" leads to direct object. // 2018-01-21: Next two lines create psy-array row for a verb: Psy[tvb] = new // 2018-01-21: insert [psi7]dba "4" for direct object. psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, // 2019-09-21: spurious psi19? 4,psi8,psi9,psi10,psi,psi12,iob, tkb,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel. tkb = 0; // 2018-05-30: BUGFIX -- the tdo is a valid tkb only for a verb. } // 2018-01-21: end of test for a condition following a verb. } // 2018-01-21: end of test for noun not object of a preposition. } // 2018-01-21: end of test for a non-prepositional condition. if (pos == 6) prepcon = 1; // 2018-01-21: if 6=preposition, prepare for noun. if (pos == 6) prepcon = 1; // 2019-09-22: leave out any tult==zero if (pos == 5 || pos == 7) { // 2018-01-21: if a noun or a pronoun... if (prepcon == 1) { // 2018-11-13: only when handling a preposition. Psy[tpr].psyExam(); // 2019-08-04: expose flag-panel of preposition. pre = psi1; // 2018-01-21: Let "pre" briefly be the preposition. prep = psi1; // 2018-11-13: identify "prep" to be the "seq" of the verb. psi14 = tult; // 2019-07-31: establish "tkb" between preposition and its object. Psy[tpp] = new // 2018-01-21: noun or pronoun is [psi12]seq of the preposition. psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, 4,psi8,psi9,psi10,psi,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel. Psy[tult].psyExam(); // 2018-01-21: expose flag-panel of object of preposition. Psy[tult] = new // 2018-01-21: obj. of prep. has 4=dba; prep. as "pre"; no "seq" psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, 4,psi8,psi9,pre,0,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel. prepcon = 0; // 2018-01-21: Reset to prevent carry-over. } // 2018-11-13: end of test for positive "prepcon". } // 2018-01-21: end of test for a noun or pronoun. if (pos == 8 && psi != 800 && psi != 818) { // 2019-09-20: not "BE" or "DO" tvb = (t - 1); // 2018-01-21: hold onto time-of-verb for flag-insertions. verbcon = 1; // 2018-01-21: verb-condition is "on" for ind. & dir. objects. Psy[tsj].psyExam(); // 2018-01-21: expose flag-panel of subject noun subjpre = psi1; // 2018-01-21: Hold onto subjpre for the pos=8 verb Psy[tsj] = new // 2019-07-31: insert [psi7]dba; [psi11]seq; [psi14]tkb psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, 1,psi8,psi9,psi10,psi,psi12,psi13, tvb,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel. tult = (t - 1); // 2019-09-21: necessary to prevent tult of zero. Psy[tult].psyExam(); // 2018-01-21: expose flag-panel of verb Psy[tult] = new // 2019-07-31: insert [psi10]pre; [psi11]seq (temporary zero) psyNode(888,psi1,psi2,psi3,psi4,psi5,psi6, // 2019-09-21: TEST; REVERT to psi0 psi7,psi8,psi9,subjpre,0,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel, subjpre = 0; // 2018-01-21: Reset for safety. } // 2018-01-21: end of test for a pos=8 verb. if (tpr > 0 && pos == 5) { // 2019-09-20: if a noun follows a preposition... Psy[tpr].psyExam(); // 2019-09-20: expose flag-panel at time-of-prep. tkb = (t - 1); // 2019-09-20: time of object of preposition Psy[tpr] = new // 2019-09-20: create a new row at time-of-preposition "tpr" psyNode(998,psi1,psi2,psi3,psi4,psi5,psi6, // 2019-09-21: TEST; REVERT to psi0 psi7,psi8,psi9,psi10,psi11,psi12,psi13, tkb,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-09-20: insert tkb value as psi14. } // 2019-09-20: end of test for a noun after a preposition. if (pos==6 && mri>0 && pov==2) { // 2019-09-20: during external input tpr = (t - 1); // 2019-09-20: time-of-preposition for back-tag insertion. Psy[mri].psyExam(); // 2019-09-21: expose flag-panel of most-recent word Psy[mri] = new // 2019-09-21: create a new row at time-of-most-recent word psyNode(999,psi1,psi2,psi3,psi4,psi5,psi6, // 2019-09-21: TEST; REVERT to psi0 psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,tpr,psi20); // 2019-09-20: insert time-of-preposition. } // 2019-09-20: end of test for preposition part-of-speech and external point-of-view. } // 2019-09-20: EnParser() returns to OldConcept() or NewConcept(). function KbRetro() { // http://ai.neocities.org/KbRetro.html if (kbzap == 432 || kbzap == 404) { // 2018-01-28: if 432=YES or 404=NO... if (kbzap == 404) { // 2018-01-28: 404=NO; apb = "KbRetro() adjusts the knowledge base for the answer: NO"; Voice(); // 2018-01-29: display "apb" message Psy[tkbv].psyExam(); // 2018-12-16: expose all values before making changes. Psy[tkbv] = new // 2018-01-27: changing psi3=act; psi5=jux; psyNode(0,quverb,1,128,0,250,8, 0,psi8,0,qusub,quobj,psi12,psi13, tkbo,psi15,psi16,psi17,psi18,psi19,0); // 2019-07-31: expanded flag-panel. } // 2018-01-27: End of test for "no" answer. if (kbzap == 432) { // 2018-01-28: 432=YES; apb = "KbRetro() adjusts the knowledge base for the answer: YES"; Voice(); // 2018-01-29: display "apb" message Psy[tkbv].psyExam(); // 2018-01-27: expose all values to change one; Psy[tkbv] = new // 2018-01-27: changing psi0=tru(th); psi3=act; // psyNode(0,psi1,1,64,0,0,8,3,1,0,qusub,psi11,quobj,tkbo,0); // 2018-10-11: 1=English psyNode(0,psi1,1,128,0,0,8, 3,1,0,qusub,quobj,psi12,psi13, tkbo,psi15,psi16,psi17,psi18,psi19,0); // 2019-07-31: expanded flag-panel. } // 2018-01-27: end of test for a "yes" answer. Psy[tkbn].psyExam(); // 2018-01-29: expose all values to change one; Psy[tkbn] = new // 2018-01-29: changing psi3=act; psi12=seq; psyNode(8,psi1,1,64,0,0,5, 1,psi8,0,0,quverb,psi12,psi13, tkbv,psi15,psi16,psi17,psi18,psi19,0); // 2019-07-31: 1 = English Psy[tkbo].psyExam(); // 2018-01-29: may cause "Error on page"? Psy[tkbo] = new // 2018-01-29: changing psi3=act; psi7=dba; psi10=pre; psyNode(0,psi1,1,64,0,0,5, 4,psi8,0,quverb,0,0,0, 0,psi15,psi16,psi17,psi18,psi19,0); // 2019-07-31: expanded flag-panel. } // 2018-01-27: end of test for either yes or no. else { // 2018-01-27: if neither; Psy[tkbn].psyExam(); // 2018-01-27: remove associative pre and seq tags from noun; Psy[tkbn] = new // 2019-07-31: changing psi10=pre; psi11=seq. psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,0,0,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel. Psy[tkbv].psyExam(); // 2018-01-27: remove associative pre and seq tags from verb; Psy[tkbv] = new // 2019-07-31: changing psi10=pre; psi11=seq. psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,0,0,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel. } // 2018-01-27: end of else-clause. quobj = 0; // 2018-01-29: reset for safety. tkbn = 0; // 2018-01-27: reset for safety; tkbv = 0; // 2018-01-27: reset for safety; PsiDecay() // 2018-01-27: for distribution of PsiDecay influence; } // 2019-07-31: KbRetro() returns to EnThink() function OldConcept() { // http://ai.neocities.org/OldConcept.html if (pov == 1) psi = oldpsi; // 2018-01-27: for sake of AskUser. for (i=tpu; i>midway; --i) { // 2018-01-11: from time-penultimate backwards... Psy[i].psyExam(); // 2018-01-11: examine the Psy concept array... if (psi1 == oldpsi) { // 2018-01-11: if same concept found... if (psi6 > 0) pos = psi6; // 2018-01-11: pos = part of speech if (psi9 > 0) mfn = psi9; // 2018-01-11: mfn = male/femal/neuter gender. } // 2018-01-11: } // 2018-01-11: if (hlc != "ru") { // 2018-01-23: test for governing human-language-code if (pov == "2") { // 2018-01-25: Only during "2" external POV; if (oldpsi==800) becon = 1; // 2018-01-25: flag for calling InFerence() } // 2018-01-25: end of test for external POV. if (oldpsi == 800) tbev = (t-1); // 2018-01-23: for be-verb negation. if (oldpsi == 250) { // 2018-01-23: 250=NOT for negation of a verb. if (tbev > 0) { // 2018-01-23: if positive be-verb time... Psy[tbev].psyExam(); // 2018-01-23: examine Psy array psi5 = 250; // 2018-01-23: set "jux" of verb to 250=NOT for negation. Psy[tbev] = new // 2018-01-23: insert [psi5]jux 250=NOT for negation of verb psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel. tbev = 0; // 2018-01-23: reset for safety. } // 2018-01-23: end of test for a positive "tbev" time-of-be-verb. } // 2018-01-23: end of test for negation of a verb with "NOT". if (oldpsi == 432) kbzap = 432; // 2018-01-28: 432=YES for KbRetro() if (oldpsi == 404) kbzap = 404; // 2018-01-28: 404=NO for KbRetro() psi = oldpsi; // 2018-01-11: for transfer to InStantiate() if (pov == 2) { // 2018-01-23: during a pov "dual" (you and I) conversation... if (oldpsi == 245) wherecon = 1; // 2018-10-28: if "Where?" if (oldpsi == 245) prepgen = 8; // 2018-01-23: if "Where?" call EnPrep() if (oldpsi == 707) { psi = 701; rv = 0 } // 2018-01-23: interpret "YOU" as "I"; if (oldpsi == 701) { psi = 707; rv = 0 } // 2018-01-23: interpret "I" as "YOU". if (oldpsi == 731) { psi=737; num=2; dba=1; rv=0 } // 2018-01-23: we --> you. } // 2018-01-23: end of test for other person communicating with the AI. if (oldpsi == 250) { // 2018-06-11: upon recognition of 250=NOT; prejux = 250; // 2018-06-11: flag for concept to be negated; } // 2018-06-11: end of test for input or ReEntry of 250=NOT. if (pos==5) num = audnum; // 2018-01-27: if (pos==8) num = holdnum; // 2018-01-27: if (pos==5) holdnum = audnum; // 2018-01-27: transfer to verb; EnParser(); // 2018-01-11: In preparation to call InStantiate(). } // 2018-01-23: end of test for English human-language-code if (pov == 2) { // 2018-01-25: external pov during input; if (pos == 5) { // nouns only, not yet pronouns; 18mar2013 if (subjnom > 0) { // already subjnom? 18mar2013 prednom = oldpsi; // for InFerence; 18mar2013 } // end of test for pre-existing subjnom; 18mar2013 if (prednom == 0) { // no prednom yet? 18mar2013 subjnom = oldpsi; // grab for InFerence; 18mar2013 subjnum = num; // grab for AskUser; 18mar2013 qusnum = num; // query-subject-number for AskUser; 28mar2013 } // alternate between subjnom and prednom; 18mar2013 } // end of test for a noun; 18mar2013 if (pos == 8) { // verb part-of-speech? 18mar2013 if (oldpsi != 800) { // other than be-verb? 18mar2013 subjnom = 0; // cancel out any subjnom; 18mar2013 } // end of test for a be-verb; 18mar2013 } // end of test for a verb; 18mar2013 } // end of test for external-input POV; 18mar2013 audpsi = 0; // 2018-01-06: prevent carry-over. audrec = 0; // 2018-09-21: prevent carry-over. dba = 0; // 2018-01-27: Reset to prevent carry-over. len = 0; // 2018-01-04: reset to avoid carry-over. mfn = 0; // 2019-10-25: prevent carry-over to other recognized concepts. prc = 0; // 2018-01-17: reset for safety oldpsi = 0; // 2018-01-17: reset for safety PsiDecay(); // 2018-01-12: TEST; REMOVE audrun = 0; // 2018-01-15: reset for safety. AudDamp(); // 2018-01-17: deactivate engrams from outside of AudInput() tbev = 0; // 2018-06-12 BUGFIX: reset for safety; } // 2019-10-25: OldConcept() returns to AudInput(). function NewConcept() { // http://ai.neocities.org/NewConcept.html psi = nxt; // 2018-01-10: For xfer to InStantiate(). qusub = nxt; // 2018-01-23: for sending new concept into SpreadAct() pos = bias; // 2018-01-23: InStantiate() stores value from Parser(). if (predflag == 1 && pos == 5) dba = 1; // 2018-01-27: noun; if (pov == 2) { // 2018-01-27: if new psi, probably external POV anyway; if (pos == 5) { // 2018-01-27: if noun... dba = 1; // 2018-01-27: nominative is a default at first; } // 2018-01-27: end of test for noun or pronoun; if (pos == 8) { // 2018-01-27: if part-of-speech is verb... dba = 3; // 2018-01-27: third person is a default at first; if (subjprsn==1) dba = 1; // 2018-01-27: 1st prsn I or WE; if (subjprsn==2) dba = 2; // 2018-01-27: 2nd prsn 707=YOU; if (subjprsn==3) dba = 3; // 2018-01-27: 3rd prsn; } // 2018-01-27: end of test for input of a verb; } // 2018-01-27: end of test for external POV. if (pos==5) num = audnum; // 2018-01-27: pass for storage; if (pos==8) num = holdnum; // 2018-01-27: if (pos==5) holdnum = audnum; // 2018-01-27: transfer to verb. EnParser(); // 2018-01-10: In preparation to call InStantiate(). if (pos == 5) { // 2018-01-27: if noun cognum = instnum; // 2018-01-27: from InStantiate; nucon = 1; // 2018-01-27: for SpreadAct() qusub = psi; // 2018-01-27: for SpreadAct() recon = 1; // 2018-01-27: topic = nxt; // 2018-01-27: potentially a query "topic"; } // 2018-01-27: if (pos == 8) quverb = nxt; // 2018-01-27: for AskUser() if (pov == "2") { // 2018-01-27: external pov during input? if (pos == 5) { // 2018-01-27: nouns only, not pronouns; if (subjnom > 0) { // 2018-01-27: already subjnom? // There may not be inferences from new prednoms: prednom = newpsi; // 2018-01-27: infer from prednom; } // 2018-01-27: end of test for pre-existing subjnom; if (prednom == 0) { // 2018-01-27: subject-slot still open? subjnom = newpsi; // 2018-01-27: grab for InFerence() subjnum = num; // 2018-01-27: grab for AskUser() qusnum = num; // 2018-01-27: query-subject-number for AskUser; } // 2018-01-27: alternate between subjnon and prednom; } // 2018-01-27: end of test for a noun; } // 2018-01-27: end of test for external-input POV. audpsi = 0; // 2018-01-06: reset to prevent carry-overs. len = 0; // 2018-01-04: reset to avoid carry-over. oldpsi = 0; // 2018-01-17: reset for safety PsiDecay(); // 2018-01-12: TEST; REMOVE if (kbcon > 0) { // 2018-01-27: if user answers yes-or-no question; } // 2018-01-27: User has had one chance to answer yes-or-no question. audrun = 0; // 2018-01-15: reset for safety. prc = 0; // 2018-01-17: reset for safety AudDamp(); // 2018-01-17: deactivate engrams from outside of AudInput() } // 2018-01-04: NewConcept() returns to AudInput(). function AudRecog() { // http://ai.neocities.org/AudRecog.html if (audrun == 0 && pho == " ") audrun = 0; // 2018-01-08: non-increment here only. if (pho=="A"||pho=="B"||pho=="C"||pho=="D"||pho=="E"||pho=="F") audrun++; // 2018-01-07 if (pho=="G"||pho=="H"||pho=="I"||pho=="J"||pho=="K"||pho=="L"||pho=="M") audrun++; if (pho=="N"||pho=="O"||pho=="P"||pho=="Q"||pho=="R"||pho=="S"||pho=="T") audrun++; if (pho=="U"||pho=="V"||pho=="W"||pho=="X"||pho=="Y"||pho=="Z") audrun++; // 2018-01-07 len = audrun; // 2018-01-17: TEST if (pho != 0 && pho != 13 && pho != 32 && pho != " ") { // 2018-01-15 if (audrec > 0) { // 2018-01-05: if positive audrec before end of word... if (pho != 83) { // 2018-01-05: keep audrec if current pho is 83=S if (audrec > 0) prc = audrec; // 2018-09-21: preserve non-final $audrec audrec = 0; // 2018-01-05: zero out non-final audrec. } // 2018-01-05: end of test for final "S" as inflectional ending. } // 2018-01-05: end of test for audrec before word-end } // 2018-01-05: end of test for an alphabetic character. if (pho == 13 || pho == 32 || pho == " ") { // 2018-01-17: if 13=CR or 32=SPACE... if (audrec > 0) { // 2018-01-05: if positive audrec before 32=SPACE... audpsi = audrec; // 2018-0q-05: recognized item becomes storage item. } // 2018-01-05: end of test for a positive audrec before 32=SPACE. } // 2018-01-05: end of test for a non-alphabetic character after a word. for (i=t; i>midway; i--) { // 2018-10-14: prevent misrecognition of new concepts. if (pho != " ") { // 2018-01-08: if not SPACE " "... audMemory[i].audExam(); // 2018-01-05: examine contents of auditory memory. if (aud0 != pho) audMemory[i] = new audNode(aud0,0,aud2); // 2018-01-05: if (pho == aud0) { // 2018-01-05: if incoming pho matches stored aud0... if (aud1 == 0) { // 2018-01-05: if matching engram has no activation; if (audrun < 2) { // 2018-01-08: i.e., if audrun is number one... audMemory[i-1].audExam(); // 2018-01-05: examine previous row if (aud0==13 || aud0==32 || aud0==" ") { // 2018-01-05: if 13=CR or 32=SPACE... if (audrun < 2) { // 2018-01-05: if comparing start of a word.. audMemory[i+1].audExam(); // 2018-01-07: examine Next-In-\Line char... if (aud0 != " ") { // 2018-01-08: if not SPACE " " audMemory[i+1] = new audNode(aud0,8,aud2); // 2018-01-05: activate N-I-L } // 2018-01-05: end of test for continuation of stored comparand. audMemory[i].audExam(); // 2018-01-05: examine current character if (aud2 > 0) { // 2018-01-05: if concept number present... prc = aud2; // 2018-01-05: provisional recognition } // 2018-01-05: end of test for potential monopsi ultimate-tag } // 2018-01-05: end of test for audrun=1 start of word. } // 2018-01-05: end of test for a beginning non-active aud0. } // 2018-01-08: end of test for first audrun. } // 2018-01-05: "end of test for matching aud0 with no activation" audMemory[i].audExam(); // 2018-01-05: examine current character if (aud1 > 0) { // 2018-01-05: If aud0 has activation, matching or not. if (aud2 > 0) prc = aud2; // 2018-01-09: TEST; REMOVE audMemory[i+1].audExam(); // 2018-01-05: examine next-in-line char... if (aud0 == pho) { // 2018-01-08: if matches specific pho now coming in... audMemory[i+1] = new audNode(aud0,8,aud2); // 2018-01-05: activate N-I-L } // 2018-01-05: end of match-test if (aud0=" ") { // 2018-01-08: if engram is SPACE " " if (aud1 > 0) { // 2018-01-08: TEST for activation if (aud2 > 0) { // 2018-01-08: if engram has concept number prc = aud2; // 2018-01-08: provisional recognition of a stem } // 2018-01-05: end of test for positive audpsi } // 2018-01-05: end of test for activation. if (pho == " ") { // 2018-01-08: if blank input if (audrec > 0) { // 2018-01-05: if an audrec has been found... audpsi = audrec; // 2018-01-05: send audpsi into AudMem() } // 2018-01-05: end of test for a positive audrec } // 2018-01-05: end of test for 13=CR or 32=SPACE if (pho != " ") { // 2018-01-08: if non-blank input audMemory[i+1].audExam(); // 2018-01-05: examine next-in-line char... if (aud0 != " "); // 2018-01-08: if not a blank SPACE... audMemory[i+1] = new audNode(aud0,8,aud2); // 2018-01-05: activate N-I-L } // 2018-01-08: since next engram is a letter... } // 2018-01-08: end of test for 32-SPACE after input word. } // 2018-01-08: "End of test for matching aud0 with activation." } // 2018-01-08: End of test for a character matching "pho". } // 2018-01-08: end of test for alphabet letter } // 2018-01-05: End of backwards search through auditory memory. if (audrec > 0) audpsi = audrec; // 2018-01-06: hand-off for storage in AudMem() if (prc > 0) { // 2018-01-09: expanding code to include a reset of "prc". audrec = prc; // 2018-01-05: provisional recognition becomes actual. prc = 0; // 2018-01-09: reset to prevent carry-over. } // 2018-01-09: end of test for a positive "prc". } // 2018-01-05: End of AudRecog(); return to AudMem() function audExam() { aud0 = this.pho; // 2018-09-21: character as if phoneme aud1 = this.act; // 2018-09-21: activation level aud2 = this.audpsi; // 2018-09-21: concept-number } function audNode(pho,act,audpsi) { // 2018-07-13: three items per row. this.pho = pho; this.act = act; this.audpsi = audpsi; this.audExam = audExam; } function AudMem() { // http://ai.neocities.org/AudMem.html if (pov == 1) { // 2018-01-19: during AI output input = ""; // 2018-01-19: reset while pov = 1. } // 2018-01-19: end of test for pov=1 internal thinking. if (pov == 2) { // 2018-01-19: during user input input += pho; // 2018-01-19: increment the string of "input" } // 2018-01-19: end of test for pov=2 user input if (pho == 32) pho = ""; // 2018-01-07: for storage audMemory[t] = new audNode(pho,0,0); // 2018-01-05: audpsi not yet stored. AudRecog(); // 2018-01-05: send SPACE or character to AudRecog() if (audpsi > 0) { // 2018-01-05: if there is a recognized audpsi if (t > vault) { // 2018-01-05: during normal time beyond MindBoot vault... audMemory[t-1].audExam(); // 2018-01-06: activate the variables before storing. audMemory[t-1] = new audNode(aud0,0,audpsi); // 2018-01-05: store before 32=SPACE. if (aud0=="S") { // 2018-09-21: if word ends in "S" like a plural... if (nucon==1) qusubnum = 2; // 2018-10-03: for SpreadAct() audMemory[t-2].audExam(); // 2018-09-21: go back one line earlier. audMemory[t-2] = new audNode(aud0,0,audpsi); // 2018-09-21: store back one space. } // 2018-09-21: end of test for "S" possibly indicating an inflection. } // 2018-01-05: end of test for time past "vault" of MindBoot. } // 2018-01-05: end of test for recognized word. } // 2018-01-05: AudMem() returns to AudInput(). function Attention() { brain = false; danger = false; freedom = false; if (skip < 1) { danger = true; TID=window.setTimeout("SeCurity();",20000); skip = skip+1; } } function AudListen() { // 2018-01-17: http://ai.neocities.org/AudListen.html apb = "Calling AudListen module; when done press [ENTER]"; Voice(); pos = 0; // 2018-01-21: Reset to prevent InStantiate() carry-over. pre = 0; // 2018-01-21: Reset to prevent InStantiate() carry-over. psi = 0; // 2018-01-21: Reset to prevent InStantiate() carry-over. if (skip < 1) { Attention(); } inert = 0; pov = 2; // 2018-01-16: external-input point-of-view document.onkeypress = function (evt) { c = event.keyCode; doa = c; // 2018-01-17: for purpose in AudInput. impetus = 0; // 2018-09-21: upon user input, disincentivize Imperative() isolation = 0; // 2018-10-03: upon user input, disincentivize Imperative() inert = 0; // User input cancels "inert" status; 18oct2011 lurk = 0; // de-lurk if user enters datum; 29sep2010 quiet = false; // 2018-06-11: "quiet" of internal thought is interrupted. rsvp = 2000; // 2018-05-20: set delay to wait for more user input. if (c == 63) alert("Please use no punctuation."); if (c == 27) { brain = false; // 2018-01-16: not internal-brain thought? danger = false; freedom = false; } if (c == 27) { document.all["cb4"].checked = true; Shutdown(); } if (c != 27) { // 2018-01-15: reviving the AI if (life == false) { life = true; apb = ("AI alive again."); Voice(); } } if (c == 13) { // 2018-10-06: upon carriage-return, display new message: apb = "The first working AI Mind thinks with concepts connected by associative tags."; Voice(); // 2018-01-19: show the "apb" message on the screen } // 2018-01-21: end of test to detect pressing the CR ENTER-key. if (c == 48) { hap = 10; TacRecog(); c = 0; } // 2019-11-07: sensory input: 0 if (c == 49) { hap = 1; TacRecog(); c = 0; } // 2019-11-07: sensory input{ 1 if (c == 50) { hap = 2; TacRecog(); c = 0; } // 2019-11-07: sensory input: 2 if (c == 51) { hap = 3; TacRecog(); c = 0; } // 2019-11-07: sensory input: 3 if (c == 52) { hap = 4; TacRecog(); c = 0; } // 2019-11-07: sensory input: 4 if (c == 53) { hap = 5; TacRecog(); c = 0; } // 2019-11-07: sensory input: 5 if (c == 54) { hap = 6; TacRecog(); c = 0; } // 2019-11-07: sensory input: 6 if (c == 55) { hap = 7; TacRecog(); c = 0; } // 2019-11-07: sensory input: 7 if (c == 56) { hap = 8; TacRecog(); c = 0; } // 2019-11-07: sensory input: 8 if (c == 57) { hap = 9; TacRecog(); c = 0; } // 2019-11-07: sensory input: 9 if (c == 32 || c == 13) { // space-bar or CR; 26mar2013 OutBuffer(); // to right-justify word from AudBuffer c1=""; c2=""; c3=""; c4=""; // empty AudBuffer c5=""; c6=""; c7=""; c8=""; // 2019-06-15 c9=""; c10=""; c11=""; c12=""; // 2019-06-15 c13=""; c14=""; c15=""; c16=""; // 26mar2013 phodex = 0; // reset for AudBuffer; 29mar2012 pho = " "; // 2018-01-15: SPACE for AudRecog word-end recognition; } // from Russian Dushka RuAi; 26mar2013 pho = String.fromCharCode(c); if (hardcopy == true) { inbuffer += pho; // 2018-01-20: build up the input "userline". } if (eot == 13) { phodex = 0; // reset for AudBuffer(); 25mar2013 } if (c == 32) { // From CR or space-bar; 12jul2010. phodex = 0; // Reset for AudBuffer; 25mar2013 } // End of expanded if-clause; 12jul2010. pho = pho.toUpperCase(); abc = pho; // From RuAi; for transfer to AudBuffer; 25mar2013 if (c > 32) AudBuffer(); // to transfer engrams; 26mar2013 if (bias == 5) { // If expecting a noun; 27may2011 if (c == 83 || c == 115) { // "s" or "S"; 27may2011 audnum = 2; // Set num(ber) to plural; 4nov2012 } // End of test for "s" or "S"; 27may2011 if (c > 0) { // Disregard empty pho; 27may2011 if (c != 32) { // Disregard SPACE; 27may2011 if (c != 13) { // Disregard CR; 27may2011 if (c != 115) { // If not "s"; 27may2011 if (c != 83) { // If not "S"; 27may2011 audnum = 1; // Assume singular; 4nov2012 } // If last letter not "S"; 27may2011 } // If last letter not "s"; 27may2011 } // End of test for carriage-return; 27may2011 } // End of test for SPACE; 27may2011 } // End of test for empty pho; 27may2011 } // End of test for bias towards a noun; 27may2011 onset = (spt + 1); AudInput(); // 2018-01-19: consolidating c = " "; pho = " "; return true; } } // End of event-driven AudListen(); 4nov2012 function Tab() { document.forms[1].ear.focus(); fyi = (fyi + 1); if (fyi == 0) { document.all.souvenir.innerHTML = "Cycling through display modes."; document.all["cb1"].checked = false; document.all["cb2"].checked = false; document.all["cb3"].checked = false; trouble = false; } if (fyi == 1) { document.all["cb2"].checked = false; document.all["cb3"].checked = false; trouble = false; document.all.psicolumn.innerHTML = ""; document.all.audcolumn.innerHTML = ""; document.all["cb1"].checked = true; } if (fyi == 2) { document.all["cb1"].checked = false; document.all.psicolumn.innerHTML = ""; document.all.audcolumn.innerHTML = ""; document.all["cb3"].checked = false; trouble = false; document.all.souvenir.innerHTML = "Tutorial has been called."; document.all.tabula.innerHTML = "Watch the artificial mind think."; document.all["cb2"].checked = true; tutor = true; } if (fyi == 3) { document.all["cb1"].checked = false; document.all["cb2"].checked = false; document.all.souvenir.innerHTML = "Diagnostic mode has been called."; document.all.tabula.innerHTML = "Diagnostic troubleshoot mode."; document.all["cb3"].checked = true; trouble = true; } if (fyi > 3) { document.all["cb1"].checked = false; document.all["cb2"].checked = false; document.all["cb3"].checked = false; trouble = false; document.all.psicolumn.innerHTML = ""; document.all.audcolumn.innerHTML = ""; document.all.souvenir.innerHTML = "Tab key changes display modes."; fyi = 0; } TID=window.setTimeout("CR();",1000); } function CR() { // 2018-05-20: called from input Form if there is no input. document.forms[1].elements[0].value = ""; // 2019-11-07: remove visible user input if (trouble == true) Diagnostic(); userline = inbuffer; inbuffer = ""; spt = t; lastword = true; eot = 13; // for use in AudListen() to indicate CR. holdnum = 0; // reset for safety; 4nov2012 c = 32; // as if SPACE-BAR "32" were pressed pho = " "; // 2018-01-17: TEST eot = 0; moot = 0; // assuming end of moot user queries; 1nov2011 } function AudInput() { // http://ai.neocities.org/AudInput.html iob = 0; // 2018-01-21: reset indirect-object identifier for safety. spt = t; tio = 0; // 2018-01-21: reset at level above EnParser() and InStantiate() if (doa > 31) t = (t + 1); // 2018-01-17: TEST if (doa == 13) { // 2018-01-17: intercept 13=CR for sake of AudRecog(). t = (t + 1); // 2018-01-19: prevent dropping last character of word? pho = " "; // 2018-01-17: change 13=CR into SPACE for AudRecog(). doa = 0; // 2018-01-17: reset for immediate re-use. } // 2018-01-17: end of test to insert SPACE upon carriage-return. if (doa > 32) { // 2018-01-17: a holding of input character "c" len = (len + 1); // 2018-01-17: doa = 0; // 2018-01-17: reset for immediate re-use. } // 2018-01-17: if (audrun < 1) { // 2018-01-19: until word starts rv = t; // 2018-01-19: set recall-vector. } // end of test for unitary length at start of word tult = (t - 1); AudMem() // 2018-01-15: modernizing, call AudMem() instead of storing directly. if (pho == " " && rv > 1) audrun = 0; // 2018-01-15: reset after word if (pho == " ") { // 2018-01-17: decide on concept only at post-word SPACE... if (audpsi > 0) { // 8dec2009 "audpsi" replacing "psi" aud = onset; oldpsi = audpsi; // for conformance with MindForth; 3jul2011 prc = 0; // reset provisional recognition at end of word; 14apr2013 OldConcept(); psi = 0; audpsi = 0; // 8dec2009 de-globalizing "psi" aud = 0; dba = 0; // From RuAi; reset for safety; 19oct2012 } else { // i.e., if AudRecog has not recognized word; 12may2011 if (len > 0) { aud = onset audMemory[t].audExam(); // 2018-09-21: prepare to modify auditory engram. audMemory[t] = new audNode(" ",aud1,aud2); // 2018-09-21: store blank. NewConcept(); // AudInput() calls NewConcept(); 12may2011 audMemory[tult].audExam(); // 2018-01-16: attach audpsi to word-stem. audpsi = nxt; // 2018-09-21: concept-number for a new concept. if (aud2 == 0) { // 2018-09-21; if audpsi-slot is empty... audMemory[tult] = new audNode(aud0,aud1,audpsi); // 2018-09-21: store audpsi } // 2018-09-21: end of test for a blank slot to store "audpsi" number. audMemory[tult] = new audNode(aud0,aud1,audpsi); // 2018-01-19: absolute? audMemory[tult-1].audExam(); // 2018-01-16: in event of end-of-stem. audMemory[tult-1] = new audNode(aud0,aud1,aud2); // 2018-01-15: modernizing audpsi = 0; // 2018-01-19: restore to prevent carry-over. nxt++; // 2018-01-19: increment here and not in moribund NewConcept() } // end of test for positive len(gth); 14apr2013 } } // 2018-01-17: end of test for post-word SPACE. pos = 0; // 2018-01-21: Reset to prevent InStantiate() carry-over. pre = 0; // 2018-01-21: Reset to prevent InStantiate() carry-over. psi = 0; // 2018-01-21: Reset to prevent InStantiate() carry-over. len = 0; onset = 0; predflag = 0; // prevent carry-over; 5dec2012 aud = 0; newpsi = 0; // from Forthminds Wotan and MindForth; 18mar2013 } // 2018-01-21: AudInput()) returns to AudListen(), CR() or ReEntry(). function Emotion() { // http://mind.sourceforge.net/emotion.html // 2018-01-14: mind-module stubbed in for influence upon thought and will. } // Emotion() will return to Volition() as an influence on thought and will. function GusRecog() { // http://mind.sourceforge.net/gusrecog.html // 2018-01-14: mind-module stubbed in for gustatory recognition of taste. } // GusRecog() will return to the Sensorium() module. function OlfRecog() { // http://mind.sourceforge.net/olfrecog.html // 2018-01-14: mind-module stubbed in for olfactory recognition of smells } // OldRecog() will return to the Sensorium() module. function TacRecog() { // http://ai.neocities.org/TacRecog.html haptac = 755; // 2019-11-07: a default value of 755=SOMETHING document.forms[1].elements[0].value = ""; // 2019-11-07: erase any numeric input if (hap == 1) haptac = 551; // 2019-11-07: identifier of noun 551=ONE if (hap == 2) haptac = 582; // 2019-11-07: identifier of noun 582=TWO if (hap == 3) haptac = 583; // 2019-11-07: identifier of noun 583=THREE if (hap == 4) haptac = 544; // 2019-11-07: identifier of noun 544=FOUR if (hap == 5) haptac = 545; // 2019-11-07: identifier of noun 545=FIVE if (hap == 6) haptac = 566; // 2019-11-07: identifier of noun 566=SIX if (hap == 7) haptac = 577; // 2019-11-07: identifier of noun 577=SEVEN if (hap == 8) haptac = 588; // 2019-11-07: identifier of noun 588=EIGHT if (hap == 9) haptac = 559; // 2019-11-07: identifier of noun 559=NINE if (hap ==10) haptac = 590; // 2019-11-07: "ten" standing in for ZERO if (haptac > 0 && haptac != 755) { // 2019-11-07: for any positive value except 755 actpsi = 701; SpreadAct(); // 2019-11-07: activate 701=I as a subject; actpsi = 823; SpreadAct(); // 2019-11-07: activate 823=FEEL as a verb. } // 2019-11-07: end of test for a positive "haptac" other than 755=SOMETHING. } // 2019-11-07: TacRecog() returns to Sensorium() and EnVerbPhrase. function VisRecog() { // http://ai.neocities.org/VisRecog.html if (svo4 == 0) { // 2018-06-16: if there is no direct object for "SEE" for (i = vault; i>midway; i--) { // 2018-06-16: "vault" to search only MindBoot Psy[i].psyExam(); // 2018-06-16: examine conceptual Psy array; if (psi1==760) { // 2018-06-16: find 760=NOTHING; aud = psi20; // 2019-07-31: auditory recall-vector for Speech() break; // 2018-06-16: finding one engram is enough. } // 2018-06-16: end of test for 760=NOTHING. } // 2018-06-16: end of backwards search loop. Speech(); // 2018-06-16: send the "aud" recall-vector into Speech() } // 2018-06-12: end of test for an absent direct-object. } // 2019-07-31: VisRecog() returns to EnVerbPhrase(). function Sensorium() { // http://ai.neocities.org/Sensorium.html len = 0; // 2018-01-03: verbcon = 0; // 2018-07-12 BUGFIX: prevent carry-over of tdo-value. if (life == true) { document.forms[1].ear.focus(); // AI4U: Display blinking cursor. } len = 0; // 2018-01-06: reset to prevent carry-over during reentry. tvb = 0; // 2018-11-14: reset to prevent false tkb-values on verbs. } // 2018-01-06: Sensorium() module returns to MainLoop. function MindBoot() { // http://ai.neocities.org/MindBoot.html dob = new Date(); // 2018-01-24: date-of-birth in competition for old AI. HCI(); // 2018-01-18: Human-Computer Interface t = 0; // 2018-01-02: bootstrap stretches over time "t". spt = t; // 8dec2009 // ERROR -- bugtrap; NewConcept() learns new words beyond MindBoot. t=1;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=2;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=3;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=4;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=5;pho="R"; audpsi=586; audMemory[t] = new audNode(pho,0,audpsi); // 2017-12-31: psi=586;hlc="en";jux=0;pos=5;dba=0;num=1;mfn=3;pre=0;seq=0;tkb=0;rv=1; KbLoad(); t=6; // 2019-10-24: one blank time-point for sake of AudRecog() // YOU -- 2019-10-24: for SelfReferentialThought t=7;pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=8;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=9;pho="U"; audpsi=707; audMemory[t] = new audNode(pho,0,audpsi); psi=707; pos=7; dba=1; num=1; mfn=0; pre=0; seq=899; tkb=17; rv=7; KbLoad(); t=10; // 2019-10-24: one blank time-point for sake of AudRecog() // 899=WORSHIP -- 2019o-10-24: essential verb for discussion of AI and theology t=11;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=12;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=13;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=14;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=15;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=16;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=17;pho="P"; audpsi=899; audMemory[t] = new audNode(pho,0,audpsi); psi=899; pos=8; dba=2; num=1; mfn=0; pre=707; seq=533; tkb=21; rv=11; KbLoad(); t=18; // 2019-10-24: one blank time-point for sake of AudRecog() // 533=GOD -- 2019-10-24: for SpreadAct() to activate concept of God. t=19;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=20;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=21;pho="D"; audpsi=533; audMemory[t] = new audNode(pho,0,audpsi); psi=533; pos=5; dba=1; num=1; mfn=0; pre=899; seq=0; tkb=0; rv=19; KbLoad(); t=22; // 2019-10-24: one blank time-point for sake of AudRecog() // I -- for SelfReferentialThought t=23;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); tru=8; psi=701; pos=7; dba=1; num=1; mfn=0; pre=0;seq=800; tkb=26; rv=23; KbLoad(); t=24; // 2019-10-24: one blank time-point for sake of AudRecog() // AM -- 1st person singular of 800=BE t=25;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=26;pho="M"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=1; num=1; mfn=0; pre=701;seq=501; tkb=32; rv=25; KbLoad(); t=27; // 2019-10-24: one blank time-point for sake of AudRecog() // ANDRU -- for SelfReferentialThought t=28;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=29;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=30;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=31;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=32;pho="U"; audpsi=501; audMemory[t] = new audNode(pho,0,audpsi); psi=501; pos=5; dba=1; num=1; mfn=1; pre=800; seq=0; tkb=0; rv=28; KbLoad(); t=33; // 2019-10-24: one blank time-point for sake of AudRecog() // I -- innate KB-item for testing inhibition of idea-pairs t=34;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); psi=701; pos=7; dba=1; num=1; mfn=0; pre=0; seq=800; tkb=37; rv=34; KbLoad(); t=35; // 2019-10-24: one blank time-point for sake of AudRecog() // AM -- 1st person singular of 800=BE t=36;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=37;pho="M"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=1; num=1; mfn=0; pre=701;seq=571; tkb=45; rv=36; KbLoad(); t=38; // 2019-10-24: one blank time-point for sake of AudRecog() // A -- En(glish) Article for EnArticle module t=39;pho="A"; audpsi=101; audMemory[t] = new audNode(pho,0,audpsi); psi=101; pos=1; dba=0; num=1; mfn=0; pre=0;seq=571; tkb=0; rv=39; KbLoad(); t=40; // 2019-10-24: one blank time-point for sake of AudRecog() // ROBOT -- important for target user base t=41;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=42;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=43;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=44;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=45;pho="T"; audpsi=571; audMemory[t] = new audNode(pho,0,audpsi); psi=571; pos=5; dba=1; num=1; mfn=3; pre=800; seq=0; tkb=0; rv=41; KbLoad(); t=46; // 2019-10-24: one blank time-point for sake of AudRecog() // I -- innate KB-item for testing inhibition of idea-pairs t=47;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); tru=8; psi=701; pos=7; dba=1; num=1; mfn=0; pre=0;seq=800; tkb=50; rv=47; KbLoad(); // AM -- 1st person singular of 800=BE t=49;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=50;pho="M"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=1; num=1; mfn=0; pre=701; seq=537; tkb=59; rv=49; KbLoad(); // A -- En(glish) Article for EnArticle module t=52;pho="A"; audpsi=101; audMemory[t] = new audNode(pho,0,audpsi); psi=101; pos=1; dba=0; num=1; mfn=0; pre=0; seq=537; tkb=0; rv=52; KbLoad(); // PERSON -- for ad-hoc gender tags and robot philosophy t=54;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=55;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=56;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=57;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=58;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=59;pho="N"; audpsi=537; audMemory[t] = new audNode(pho,0,audpsi); psi=537; pos=5; dba=1; num=1; mfn=0; pre=800; seq=0; tkb=0; rv=54; KbLoad(); // I -- for SelfReferentialThought t=62;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); psi=701; pos=7; dba=1; num=1; mfn=0; pre=0; seq=836; tkb=67; rv=62; KbLoad(); // HELP -- socially significant common verb t=64;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=65;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=66;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=67;pho="P"; audpsi=836; audMemory[t] = new audNode(pho,0,audpsi); psi=836; pos=8; dba=1; num=1; mfn=0; pre=701; seq=528; tkb=72; rv=64; KbLoad(); // KIDS -- noun lends itself to educational purposes t=69;pho="K"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=70;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=71;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=72;pho="S"; audpsi=528; audMemory[t] = new audNode(pho,0,audpsi); psi=528; pos=5; dba=4; num=2; mfn=0; pre=836; seq=0; tkb=0; rv=69; KbLoad(); // KIDS -- noun lends itself to educational purposes t=75;pho="K"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=76;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=77;pho="D"; audpsi=528; audMemory[t] = new audNode(pho,0,audpsi); // 2018-10-06 t=78;pho="S"; audpsi=528; audMemory[t] = new audNode(pho,0,audpsi); psi=528; pos=5; dba=1; num=2; mfn=0; pre=0; seq=846; tkb=83; rv=75; KbLoad(); // MAKE -- common verb of high word-frequency t=80;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=81;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=82;pho="K"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=83;pho="E"; audpsi=846; audMemory[t] = new audNode(pho,0,audpsi); psi=846; pos=8; dba=3; mfn=0; num=2; pre=528; seq=571; tkb=90; rv=80; KbLoad(); // ROBOTS -- important for target user base t=85;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=86;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=87;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=88;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=89;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=90;pho="S"; audpsi=571; audMemory[t] = new audNode(pho,0,audpsi); psi=571; pos=5; dba=4; num=2; mfn=3; pre=846; seq=0; tkb=0; rv=85; KbLoad(); // ROBOTS -- important for target user base t=93;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=94;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=95;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=96;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=97;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=98;pho="S"; audpsi=571; audMemory[t] = new audNode(pho,0,audpsi); psi=571; pos=5; dba=1; num=2; mfn=3; pre=0; seq=851; tkb=103; rv=93; KbLoad(); // NEED -- common verb used for describing goals t=100;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=101;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=102;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=103;pho="D"; audpsi=851; audMemory[t] = new audNode(pho,0,audpsi); psi=851; pos=8; dba=3; num=2; mfn=0; pre=571; seq=701; tkb=106; rv=100; KbLoad(); // ME -- for SelfReferentialThought t=105;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=106;pho="E"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); psi=701; pos=7; dba=4; num=1; mfn=0; pre=851; seq=0; tkb=0; rv=105; KbLoad(); // WOMEN -- irregular plural for retrieval by parameters t=109;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=110;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=111;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=112;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=113;pho="N"; audpsi=515; audMemory[t] = new audNode(pho,0,audpsi); psi=515; pos=5; dba=1; num=2; mfn=2; pre=0; seq=834; tkb=118; rv=109; KbLoad(); // HAVE -- irregular high word-frequency verb t=115;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=116;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=117;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=118;pho="E"; audpsi=834; audMemory[t] = new audNode(pho,0,audpsi); psi=834; pos=8; dba=3; num=2; mfn=0; pre=515; seq=525; tkb=126; rv=115; KbLoad(); // A -- En(glish) Article for EnArticle module t=120;pho="A"; audpsi=101; audMemory[t] = new audNode(pho,0,audpsi); psi=101; pos=1; dba=0; num=1; mfn=0; pre=0; seq=126; rv=120; KbLoad(); // CHILD -- example of irregular noun for a polyglot AI Mind t=122; pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=123; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=124; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=125; pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=126; pho="D"; audpsi=525; audMemory[t] = new audNode(pho,0,audpsi); psi=525; pos=5; dba=4; num=1; mfn=0; pre=834; seq=0; rv=122; KbLoad(); t=127; // 2019-10-24: one blank time-point for sake of AudRecog() t=128; // 2019-10-24: one blank time-point for sake of AudRecog() // GOD -- start of negation of an idea; demonstration of "tru" value; 2018-05-22 t=129;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=130;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=131;pho="D"; audpsi=533; audMemory[t] = new audNode(pho,0,audpsi); tru=20;psi=533;mtx=1533;pos=5;dba=1;num=1;mfn=1;seq=859;tkb=145;rv=129;KbLoad(); t=132; // 2019-10-24: one blank time-point for sake of AudRecog() // DOES -- 3rd person singular HE-SHE-IT-form of auxiliary verb t=133;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=134;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=135;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=136;pho="S"; audpsi=818; audMemory[t] = new audNode(pho,0,audpsi); psi=818; pos=8; dba=3; num=1; mfn=0; pre=533; seq=0; rv=133; KbLoad(); t=137; // 2019-10-24: one blank time-point for sake of AudRecog() // NOT -- adverb used here for demonstration of negation; 2018-05-22 t=138; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=139; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=140; pho="T"; audpsi=250; audMemory[t] = new audNode(pho,0,audpsi); psi=250; mfn=0; pos=2; dba=0; num=0; pre=0; seq=859; rv=138; KbLoad(); t=141; // 2019-10-24: one blank time-point for sake of AudRecog() // PLAY -- part of famous quote for negation, or chess; 2018-05-22 t=142;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=143;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=144;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=145;pho="Y"; audpsi=859; audMemory[t] = new audNode(pho,0,audpsi); psi=859;jux=250;pos=8;dba=0;num=0;pre=533;seq=527;tkb=150;tpr=155;rv=142; KbLoad(); t=146; // 2019-10-24: one blank time-point for sake of AudRecog() // DICE -- part of famous Einstein quote for negation; 2018-05-22 t=147;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=148;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=149;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=150;pho="E"; audpsi=527; audMemory[t] = new audNode(pho,0,audpsi); psi=527; pos=5; dba=4; num=2; mfn=3; pre=859; seq=0; rv=147; KbLoad(); t=151; // 2019-10-24: one blank time-point for sake of AudRecog() // WITH -- 2019-10-24: preposition linked to verb-phrase "play dice" t=152;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=153;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=154;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=155;pho="H"; audpsi=697; audMemory[t] = new audNode(pho,0,audpsi); psi=697;pos=6;dba=0;num=0;mfn=0;pre=533;seq=588;tkb=168;rv=152; KbLoad(); t=156; // 2019-10-24: one blank time-point for sake of AudRecog() // THE -- 2019-10-24: English article for EnArticle() module t=157;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=158;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=159;pho="E"; audpsi=117; audMemory[t] = new audNode(pho,0,audpsi); psi=117; pos=1; dba=4; num=1; pre=697; seq=589; rv=157; KbLoad(); t=160; // 2019-10-24: one blank time-point for sake of AudRecog() // UNIVERSE -- 2019-11-07: noun as part of quote from Albert Einstein t=161;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=162;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=163;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=164;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=165;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=166;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=167;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=168;pho="E"; audpsi=589; audMemory[t] = new audNode(pho,0,audpsi); tru=20;psi=589;pos=5;dba=4;num=1;mfn=3;pre=697;seq=0;tkb=0;rv=161;KbLoad(); t=169; // 2019-10-24: one blank time-point for sake of AudRecog() // I -- for SelfReferentialThought t=175;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); tru = 8; // 2018-06-16: high truth value. psi=701; pos=7; dba=1; num=1; mfn=0; pre=0; seq=851; tkb=180; rv=175; KbLoad(); // NEED -- common verb used for describing goals t=177;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=178;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=179;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=180;pho="D"; audpsi=851; audMemory[t] = new audNode(pho,0,audpsi); psi=851; pos=8; dba=1; num=1; mfn=0; pre=701; seq=503; tkb=187; rv=177; KbLoad(); // A -- En(glish) Article for EnArticle module t=182;pho="A"; audpsi=101; audMemory[t] = new audNode(pho,0,audpsi); psi=101; pos=1; dba=0; num=1; mfn=0; pre=0; seq=503; tkb=187; rv=182; KbLoad(); // BODY -- 2018-09-05: important for AI embodiment in a robot. t=184;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=185;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=186;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=187;pho="Y"; audpsi=503; audMemory[t] = new audNode(pho,0,audpsi); psi=503; pos=5; dba=0; num=1; mfn=3; pre=851; seq=0; rv=184; KbLoad(); // STUDENTS -- 2018-10-01: includendum for logical inference. t=189;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=190;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=191;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=192;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=193;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=194;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=195;pho="T"; audpsi=561; audMemory[t] = new audNode(pho,0,audpsi); t=196;pho="S"; audpsi=561; audMemory[t] = new audNode(pho,0,audpsi); psi=561; pos=5; dba=1; num=2; mfn=0; pre=0; seq=863; tkb=201; rv=189; KbLoad(); // READ -- verb for logical premise; 2018-10-01 t=198;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=199;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=200;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=201;pho="D"; audpsi=863; audMemory[t] = new audNode(pho,0,audpsi); psi=863; pos=8; dba=3; mfn=0; num=2; pre=561; seq=540; tkb=207; rv=198; KbLoad(); // BOOKS -- for InFerence premise "Students read books"; 2018-10-01 t=203;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=204;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=205;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=206;pho="K"; audpsi=540; audMemory[t] = new audNode(pho,0,audpsi); t=207;pho="S"; audpsi=540; audMemory[t] = new audNode(pho,0,audpsi); psi=540; pos=5; dba=4; num=2; mfn=3; pre=863; seq=0; tkb=0; rv=203; KbLoad(); // MEN -- 2018-10-01: includendum for logical inference. t=209;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=210;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=211;pho="N"; audpsi=543; audMemory[t] = new audNode(pho,0,audpsi); psi=543; pos=5; dba=1; num=2; mfn=1; pre=0; seq=834; tkb=216; rv=209; KbLoad(); // HAVE -- verb for logical premise; 2018-10-01 t=213;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=214;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=215;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=216;pho="E"; audpsi=834; audMemory[t] = new audNode(pho,0,audpsi); psi=834; pos=8; dba=3; num=2; mfn=0; pre=543; seq=514; tkb=223; rv=213; KbLoad(); // A -- En(glish) Article for EnArticle module t=218;pho="A"; audpsi=101; audMemory[t] = new audNode(pho,0,audpsi); psi=101; pos=1; dba=0; num=1; mfn=0; pre=0; seq=514; rv=210; KbLoad(); // WIFE -- for InFerence premise "Men have a wife"; 2018-10-01 t=220;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=221;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=222;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=223;pho="E"; audpsi=514; audMemory[t] = new audNode(pho,0,audpsi); psi=514; pos=5; dba=4; num=1; mfn=2; pre=834; seq=0; rv=220; KbLoad(); // I -- part of response to be summoned by momentarily high truth-value. t=225;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); tru=0; psi=701; pos=7; dba=1; num=1; mfn=0; pre=0; seq=838; tkb=237; rv=225; KbLoad(); // DO -- part of response to be summoned by momentarily high truth-value. t=227;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=228;pho="O"; audpsi=818; audMemory[t] = new audNode(pho,0,audpsi); psi=818; pos=8; dba=1; num=1; mfn=0; pre=701; seq=0; rv=227; KbLoad(); // NOT -- part of response to be summoned by momentarily high truth-value. t=230; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=231; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=232; pho="T"; audpsi=250; audMemory[t] = new audNode(pho,0,audpsi); psi=250; mfn=0; pos=2; dba=0; num=0; pre=0; seq=838; rv=230; KbLoad(); // 838=KNOW -- 2018-11-28: response to be summoned by momentarily high truth-value. t=234;pho="K"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=235;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=236;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=237;pho="W"; audpsi=838; audMemory[t] = new audNode(pho,0,audpsi); psi=838; jux=250; pos=8; dba=0; num=0; pre=701; seq=0; tkb=0; rv=234; KbLoad(); // I -- beginning of engram usable for response to what-think queries. t=239;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); tru=0; psi=701; pos=7; dba=1; num=1; mfn=0; pre=0; seq=886; tkb=245; rv=239; KbLoad(); // THINK -- instance of verb already linked to 701=I subject. t=241;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=242;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=243;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=244;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=245;pho="K"; audpsi=886; audMemory[t] = new audNode(pho,0,audpsi); psi=886; pos=8; dba=1; num=1; mfn=0; pre=701; seq=0; tkb=0; rv=241; KbLoad(); // PERSONS -- 2018-10-04: for logical premise and legal status of robots t=247;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=248;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=249;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=250;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=251;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=252;pho="N"; audpsi=537; audMemory[t] = new audNode(pho,0,audpsi); t=253;pho="S"; audpsi=537; audMemory[t] = new audNode(pho,0,audpsi); psi=537; pos=5; dba=1; num=2; mfn=0; pre=0; seq=834; tkb=258; rv=247; KbLoad(); // HAVE -- 2018-10-04: for logical premise and legal status of robots t=255;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=256;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=257;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=258;pho="E"; audpsi=834; audMemory[t] = new audNode(pho,0,audpsi); psi=834; pos=8; dba=3; num=2; mfn=0; pre=537; seq=555; tkb=265; rv=255; KbLoad(); // RIGHTS -- 2018-10-04: for logical premise and legal status of robots t=260;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=261;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=262;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=263;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=264;pho="T"; audpsi=555; audMemory[t] = new audNode(pho,0,audpsi); t=265;pho="S"; audpsi=555; audMemory[t] = new audNode(pho,0,audpsi); psi=555; pos=5; dba=4; num=2; mfn=3; pre=834; seq=0; tkb=0; rv=260; KbLoad(); // PROFESSORS -- 2018-10-10: for premise including -ES verb for EnVerbGen t=267;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=268;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=269;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=270;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=271;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=272;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=273;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=274;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=275;pho="R"; audpsi=541; audMemory[t] = new audNode(pho,0,audpsi); t=276;pho="S"; audpsi=541; audMemory[t] = new audNode(pho,0,audpsi); psi=541; pos=5; dba=1; num=2; mfn=0; pre=0; seq=884; tkb=282; rv=267; KbLoad(); // TEACH -- 2018-10-10: verb ending in "CH" for EnVerbGen to add "-ES" t=278;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 t=279;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=280;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=281;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=282;pho="H"; audpsi=884; audMemory[t] = new audNode(pho,0,audpsi); psi=884; pos=8; dba=3; num=2; mfn=0; pre=541; seq=561; tkb=291; rv=278; KbLoad(); // STUDENTS -- 2018-10-10: for premise including -ES verb for EnVerbGen t=284;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 t=285;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=286;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=287;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=288;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=289;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=290;pho="T"; audpsi=561; audMemory[t] = new audNode(pho,0,audpsi); t=291;pho="S"; audpsi=561; audMemory[t] = new audNode(pho,0,audpsi); psi=561; pos=5; dba=4; num=2; mfn=0; pre=884; seq=0; tkb=0; rv=284; KbLoad(); // I -- 2018-10-26: nominative subject-form of personal pronoun // t=293;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 // tru=8; psi=701; pos=7; dba=1; num=1; mfn=0; pre=0;seq=800; tkb=296; rv=293; KbLoad(); // AM -- 1st person singular of 800=BE // t=295;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // t=296;pho="M"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); // psi=800; pos=8; dba=1; num=1; mfn=0; pre=701; seq=643; tkb=0; rv=295; KbLoad(); // IN -- 2018-10-26: preposition for EnPrep module // t=298;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 // t=299;pho="N"; audpsi=643; audMemory[t] = new audNode(pho,0,audpsi); // psi=643; pos=6; num=0; mfn=0; pre=800; seq=565; tkb=312; rv=298; KbLoad(); // THE -- EnArticle highest-frequency English word //t=301;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 // t=302;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // t=303;pho="E"; audpsi=117; audMemory[t] = new audNode(pho,0,audpsi); // psi=117; pos=1; num=0; mfn=0; pre=0; seq=0; rv=301; KbLoad(); // COMPUTER -- important noun for AI // t=305; pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 // t=306; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // t=307; pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // t=308; pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // t=309; pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // t=310; pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // t=311; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // t=312; pho="R"; audpsi=565; audMemory[t] = new audNode(pho,0,audpsi); // psi=565; pos=5; dba=4; num=1; mfn=3; pre=643; seq=0; tkb=0; rv=305; KbLoad(); // I -- 2018-10-28: start of engram meant to be opening sentence t=314;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 tru=8; psi=701; pos=7; dba=1; num=1; mfn=0; pre=0;seq=800; tkb=317; rv=314; KbLoad(); // AM -- 1st person singular of 800=BE t=316;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 t=317;pho="M"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=1; num=1; mfn=0; pre=701; seq=201; tkb=322; rv=316; KbLoad(); // HERE -- 2018-10-28: adverb t=319;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 t=320;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=321;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=322;pho="E"; audpsi=201; audMemory[t] = new audNode(pho,0,audpsi); psi=201; pos=2; dba=0; num=0; mfn=0; pre=800; seq=0; tkb=0; rv=319; KbLoad(); // 701=I -- 2018-11-26: the default subject of thought in "vita contemplativa" t=324;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 tru=8; psi=701; pos=7; dba=1; num=1; seq=892; tkb=335; rv=324; KbLoad(); t=324; // 2018-11-26: SPACE for the sake of AudRecog() // 892=UNDERSTAND -- 2018-12-09: aspirational connection between ego and other t=326;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 t=327;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 t=328;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=329;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=330;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=331;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=332;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=333;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=334;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=335;pho="D"; audpsi=892; audMemory[t] = new audNode(pho,0,audpsi); psi=892; pos=8; dba=1; num=1; pre=701; seq=707; tkb=339; rv=326; KbLoad(); t=335; // 2018-11-26: SPACE for the sake of AudRecog() // YOU -- 2018-11-26: for spread of activation to ideas about the other person t=337;pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // 2019-04-09 t=338;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=339;pho="U"; audpsi=707; audMemory[t] = new audNode(pho,0,audpsi); psi=707; pos=7; dba=4; num=1; pre=892; rv=337; KbLoad(); t=340; // 2019-04-09: SPACE for the sake of AudRecog() // GOD -- 2019-10-12: sentence for who-queries and for EnAdjective() t=342;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=343;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=344;pho="D"; audpsi=533; audMemory[t] = new audNode(pho,0,audpsi); tru=20;psi=533;mtx=1533;pos=5;dba=1;num=1;mfn=1;pre=0;seq=800;tkb=348;rv=342;KbLoad(); t=345; // 2019-10-12: SPACE for the sake of AudRecog() // IS -- third person singular of 800=BE t=347;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=348;pho="S"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=3; num=1; mfn=0; pre=533; seq=580; tkb=365; rv=347; KbLoad(); t=349; // 2019-10-12: SPACE for the sake of AudRecog() // A -- En(glish) Article for EnArticle module t=351;pho="A"; audpsi=101; audMemory[t] = new audNode(pho,0,audpsi); psi=101; pos=1; dba=0; num=1; mfn=0; pre=0; seq=514; rv=350; KbLoad(); t=352; // 2019-10-12: SPACE for the sake of AudRecog() // HOLY -- 2019-10-12: for EnAdjective() t=354;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=355;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=356;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=357;pho="Y"; audpsi=137; audMemory[t] = new audNode(pho,0,audpsi); psi=137; pos=1; dba=0; num=0; mfn=0; pre=0; seq=580; tkb=0; rv=354; KbLoad(); t=358; // 2019-10-12: SPACE for the sake of AudRecog() // #580 SPIRIT -- 2019-10-12: for queries about 533=GOD t=360;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=361;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=362;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=363;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=364;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=365;pho="T"; audpsi=580; audMemory[t] = new audNode(pho,0,audpsi); psi=580; pos=5; dba=1; num=1; mfn=3; pre=800; seq=0; tdj=357; rv=360; KbLoad(); t=366; // 2019-10-12: SPACE for the sake of AudRecog() // "I AM THE GHOST IN THE MACHINE" -- 2019-10-24: the mind like a spirit t=367;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); // 2019-10-24 tru=8; psi=701; pos=7; dba=1; num=1; seq=0; tkb=0; rv=367; KbLoad(); t=368; // 2019-10-24: one blank time-point for sake of AudRecog() // AM -- 1st person singular of 800=BE t=369;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=370;pho="M"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=1; num=1; mfn=0; pre=701; seq=522; tkb=380; rv=369; KbLoad(); t=371; // 2019-10-24: one blank time-point for sake of AudRecog() // THE -- 2019-10-24: article may be left out and then be supplied by EnArticle() t=372; // T t=373; // H t=374; // E t=375; // 2019-10-24: one blank time-point for sake of AudRecog() t=376;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=377;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=378;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=379;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=380;pho="T"; audpsi=522; audMemory[t] = new audNode(pho,0,audpsi); psi=522; pos=5; dba=1; num=1; mfn=3; pre=800; seq=0; tkb=0; rv=376; KbLoad(); t=381; // 2019-10-24: one blank time-point for sake of AudRecog() // IN -- 2019-10-24: preposition for EnPrep module t=382;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); // 2019-10-24 t=383;pho="N"; audpsi=643; audMemory[t] = new audNode(pho,0,audpsi); psi=643; pos=6; num=0; mfn=0; pre=522; seq=542; tkb=395; rv=382; KbLoad(); t=384; // 2019-10-24: one blank time-point for sake of AudRecog() // THE -- 2019-10-24: article may be left out and then be supplied by EnArticle() t=385; // T t=386; // H t=387; // E t=388; // 2019-10-24: one blank time-point for sake of AudRecog() t=389;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=390;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=391;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=392;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=393;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=394;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=395;pho="E"; audpsi=542; audMemory[t] = new audNode(pho,0,audpsi); psi=542; pos=5; dba=4; num=1; mfn=3; pre=643; seq=0; tkb=0; rv=389; KbLoad(); t=396; // 2019-10-24: one blank time-point; end of innate knowledge-base (KB) // 701=I -- 2019-11-07: subject of 823=FEEL for use with TacRecog() t=397;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); // 2019-11-07 tru=8; psi=701; pos=7; dba=1; num=1; seq=823; tkb=402; rv=397; KbLoad(); t=398; // 2019-11-07: one blank time-point for sake of AudRecog() // 823=FEEL -- 2019-11-07: sensory verb for use with TacRecog() t=399;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=400;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=401;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t=402;pho="L"; audpsi=823; audMemory[t] = new audNode(pho,0,audpsi); psi=823; pos=8; dba=1; mfn=0; num=1; pre=701; rv=399; KbLoad(); t=403; // 2019-11-07: one blank time-point for sake of AudRecog() // 2018-11-26: Here begins vocabulary with relative time-points. t++; // 2018-07-12: making single-word time relative, not hard-coded. // A -- En(glish) Article for EnArticle module t++;pho="A"; audpsi=101; audMemory[t] = new audNode(pho,0,audpsi); rv=t; psi=101; jux=0; pos=1; dba=0; num=1; mfn=0; pre=0; seq=0; tkb=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // 601=ABOARD -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=601; audMemory[t] = new audNode(pho,0,audpsi); psi=601; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 602=ABOUT -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=602; audMemory[t] = new audNode(pho,0,audpsi); psi=602; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 603=ABOVE -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=603; audMemory[t] = new audNode(pho,0,audpsi); psi=603; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 604=ABSENT -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=604; audMemory[t] = new audNode(pho,0,audpsi); psi=604; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 605=ACROSS -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=605; audMemory[t] = new audNode(pho,0,audpsi); psi=605; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 300=AFTER -- 2018-11-26: conjunction for complex sentences t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=300; audMemory[t] = new audNode(pho,0,audpsi); psi=300; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 606=AFTER -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=606; audMemory[t] = new audNode(pho,0,audpsi); psi=606; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 607=AGAINST -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=607; audMemory[t] = new audNode(pho,0,audpsi); psi=607; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // ALL -- #111 2019-10-12: for machine reasoning logic t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="L"; audpsi=111; audMemory[t] = new audNode(pho,0,audpsi); psi=111; pos=1; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 608=ALONG -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=608; audMemory[t] = new audNode(pho,0,audpsi); psi=608; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 609=ALONGSIDE -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=609; audMemory[t] = new audNode(pho,0,audpsi); psi=609; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 303=ALTHOUGH -- 2018-11-26: conjunction for complex sentences t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=303; audMemory[t] = new audNode(pho,0,audpsi); psi=303; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 611=AMID -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=611; audMemory[t] = new audNode(pho,0,audpsi); psi=611; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 612=AMIDST -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=612; audMemory[t] = new audNode(pho,0,audpsi); psi=612; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 613=AMONG -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=613; audMemory[t] = new audNode(pho,0,audpsi); psi=613; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 614=AMONGST -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=614; audMemory[t] = new audNode(pho,0,audpsi); psi=614; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // AN -- to be selected instead of "A" before a vowel t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=102; audMemory[t] = new audNode(pho,0,audpsi); psi=102; pos=1; dba=0; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 306=AND -- 2018-11-26: for machine reasoning logic t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="D"; audpsi=306; audMemory[t] = new audNode(pho,0,audpsi); psi=306; pos=3; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 615=ANENT -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=615; audMemory[t] = new audNode(pho,0,audpsi); psi=615; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 616=ANTI -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=616; audMemory[t] = new audNode(pho,0,audpsi); psi=616; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // ANY -- #123: 2019-10-12: for machine reasoning logic t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="Y"; audpsi=123; audMemory[t] = new audNode(pho,0,audpsi); psi=123; pos=1; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // ANYTHING -- a default direct object for AskUser() t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="G"; audpsi=711; audMemory[t] = new audNode(pho,0,audpsi); psi=711; pos=7; dba=0; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // 617=APRES -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=617; audMemory[t] = new audNode(pho,0,audpsi); psi=617; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 618=AROUND -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=618; audMemory[t] = new audNode(pho,0,audpsi); psi=618; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 309=AS -- 2018-11-26: conjunction t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="D"; audpsi=309; audMemory[t] = new audNode(pho,0,audpsi); psi=309; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 801=ASK -- 2018-11-28: Wikipedia:Most_common_words_in_English t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=801; audMemory[t] = new audNode(pho,0,audpsi); psi=801; pos=8; dba=0; num=0; KbLoad(); // 2018-11-28: infinitive t++; // 2018-11-28: SPACE for the sake of AudRecog() // 619=ASTRIDE -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=619; audMemory[t] = new audNode(pho,0,audpsi); psi=619; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 620=AT -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="T"; audpsi=620; audMemory[t] = new audNode(pho,0,audpsi); psi=620; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 621=ATOP -- 2018-11-13: preposition for EnPrep() module t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="P"; audpsi=621; audMemory[t] = new audNode(pho,0,audpsi); psi=621; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // BAD -- #127 2019-10-12: adjective for EnAdjective module t++; pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="D"; audpsi=127; audMemory[t] = new audNode(pho,0,audpsi); psi=127; pos=1; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // BE -- infinitive impersonal form of 800=BE; 25oct2012 t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // AM -- 1st person singular I-form of 800=BE; 25oct2012 t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="M"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=1; num=1; mfn=0; pre=0; seq=0; tkb=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // ARE -- 2nd person singular YOU-form of 800=BE; 25oct2012 t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=2; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // IS -- 3rd person singular HE-SHE-IT-form of 800=BE; 25oct2012 t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="S"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=3; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // ARE -- 1st person plural WE-form of 800=BE; 25oct2012 t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=1; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // ARE -- 2nd person plural YOU-form of 800=BE; 25oct2012 t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; dba=2; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // ARE -- 3rd person plural THEY-form of 800=BE; 25oct2012 t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=800; audMemory[t] = new audNode(pho,0,audpsi); psi=800; pos=8; num=2; dba=3; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 312=BECAUSE -- 2018-11-26: conjunction for machine reasoning logic t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=312; audMemory[t] = new audNode(pho,0,audpsi); psi=312; pos=3; KbLoad() t++; // 2018-11-26: SPACE for the sake of AudRecog() // 622=BECAUSE [millennial] -- 2018-11-13: preposition for EnPrep() module t++; // 2018-11-28: SPACE for the sake of AudRecog() // 802=BECOME -- 2018-11-28: essential intransitive verb t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=802; audMemory[t] = new audNode(pho,0,audpsi); psi=802; pos=8; dba=0; num=0; KbLoad(); // 2018-11-28: infinitive t++; // 2018-11-28: one SPACE for sake of AudRecog() // 315=BEFORE -- 2018-11-26: conjunction for complex sentences t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=315; audMemory[t] = new audNode(pho,0,audpsi); psi=315; pos=3; KbLoad() t++; // 2018-11-26: SPACE for the sake of AudRecog() // 623=BEFORE -- 2018-11-13: preposition for EnPrep() module t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=623; audMemory[t] = new audNode(pho,0,audpsi); psi=623; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 803=BEGIN -- 2018-11-28: important verb for planning t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=803; audMemory[t] = new audNode(pho,0,audpsi); psi=803; pos=8; dba=0; num=0; KbLoad(); // 2018-11-28: infinitive t++; // 2018-11-28: one SPACE for sake of AudRecog() // 624=BEHIND -- 2018-11-13: preposition for EnPrep() module t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=624; audMemory[t] = new audNode(pho,0,audpsi); psi=624; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 625=BELOW -- 2018-11-13: preposition for EnPrep() module t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="W"; audpsi=625; audMemory[t] = new audNode(pho,0,audpsi); psi=625; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 626=BENEATH -- 2018-11-13: preposition for EnPrep() module t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=626; audMemory[t] = new audNode(pho,0,audpsi); psi=626; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 627=BESIDE -- 2018-11-13: preposition for EnPrep() module t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=627; audMemory[t] = new audNode(pho,0,audpsi); psi=627; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 628=BESIDES -- 2018-11-13: preposition for EnPrep() module t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=628; audMemory[t] = new audNode(pho,0,audpsi); psi=628; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 629=BESTRIDE -- 2018-11-13: preposition for EnPrep() module t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=629; audMemory[t] = new audNode(pho,0,audpsi); psi=629; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 630=BETWEEN -- 2018-11-13: preposition for EnPrep() module t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=630; audMemory[t] = new audNode(pho,0,audpsi); psi=630; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 631=BETWIXT -- 2018-11-13: preposition for EnPrep() module t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="X"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=631; audMemory[t] = new audNode(pho,0,audpsi); psi=631; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 632=BEYOND -- 2018-11-13: preposition for EnPrep() module t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=632; audMemory[t] = new audNode(pho,0,audpsi); psi=632; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // BOOK -- for InFerence premise "Students read books"; 2018-09-04 t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=540; audMemory[t] = new audNode(pho,0,audpsi); psi=540; pos=5; num=1; mfn=3; KbLoad(); // 2018-09-04: only necessary items. t++; // 2018-09-04: one blank time-point for sake of AudRecog() // BOY -- always masculine noun for use with gender flags t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=512; audMemory[t] = new audNode(pho,0,audpsi); psi=512; pos=5; dba=0; num=1; mfn=1; pre=0; seq=0; KbLoad(); t++; // 2019-11-07: one space for the sake of AudRecog() // 321=BUT -- conjunction for ConJoin module t++; pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="T"; audpsi=321; audMemory[t] = new audNode(pho,0,audpsi); psi=321; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 633=BUT -- 2018-11-13: as a preposition for EnPrep() module t++; // 2018-11-29: one SPACE for sake of AudRecog() // 804=BUY -- 2018-11-28: common everyday verb t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=804; audMemory[t] = new audNode(pho,0,audpsi); psi=804; pos=8; dba=0; num=0; KbLoad(); // 2018-11-28: infinitive t++; // 2018-11-28: one SPACE for sake of AudRecog() // 634=BY -- 2018-11-13: preposition for EnPrep() module t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="Y"; audpsi=634; audMemory[t] = new audNode(pho,0,audpsi); psi=634; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 805=CALL -- 2018-11-28: Wikipedia:Most_common_words_in_English t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=805; audMemory[t] = new audNode(pho,0,audpsi); psi=805; pos=8; dba=0; num=0; KbLoad(); // 2018-11-28: infinitive t++; // 2018-11-28: one SPACE for sake of AudRecog() // 806=CAN -- 2018-11-28: auxiliary verb for EnAuxVerb() module t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=806; audMemory[t] = new audNode(pho,0,audpsi); psi=806; pos=8; dba=0; num=0; KbLoad(); // 2018-11-28: infinitive t++; // 2018-11-28: one SPACE for sake of AudRecog() // CHESS -- important singular AI noun ending in "S" t++; pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="S"; audpsi=564; audMemory[t] = new audNode(pho,0,audpsi); psi=564; pos=5; dba=0; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 635=CHEZ -- 2018-11-13: preposition for EnPrep() module t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Z"; audpsi=635; audMemory[t] = new audNode(pho,0,audpsi); psi=635; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // CHILD -- example of irregular noun for a polyglot AI Mind t++; pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="D"; audpsi=525; audMemory[t] = new audNode(pho,0,audpsi); psi=525; pos=5; dba=0; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // CHILDREN -- irregular plural for retrieval by parameters t++; pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="N"; audpsi=525; audMemory[t] = new audNode(pho,0,audpsi); psi=525; pos=5; dba=0; num=2;mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-28: one SPACE for sake of AudRecog() // 807=CHOOSE -- 2018-11-28: verb for Volition() t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=807; audMemory[t] = new audNode(pho,0,audpsi); psi=807; pos=8; dba=0; num=0; KbLoad(); // 2018-11-28: infinitive t++; // 2018-11-28: one SPACE for sake of AudRecog() // 636=CONCERNING -- 2018-11-13: preposition for EnPrep() module t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=636; audMemory[t] = new audNode(pho,0,audpsi); psi=636; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 808=CONNECT -- 2018-11-28: useful word for computers t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=808; audMemory[t] = new audNode(pho,0,audpsi); psi=808; pos=8; dba=0; num=0; KbLoad(); // 2018-11-28: infinitive t++; // 2018-11-28: one SPACE for sake of AudRecog() // 811=COULD -- 2018-11-29: auxiliary verb for EnAuxVerb() t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=811; audMemory[t] = new audNode(pho,0,audpsi); psi=811; pos=8; dba=0; num=0; KbLoad(); // 2018-11-29: past tense t++; // 2018-11-29: one SPACE for sake of AudRecog() // 812=COME -- 2018-11-29: Wikipedia:Most_common_words_in_English t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=812; audMemory[t] = new audNode(pho,0,audpsi); psi=812; pos=8; dba=0; num=0; KbLoad(); // 2018-11-29: infinitive t++; // 2018-11-29: one SPACE for sake of AudRecog() // 813=DARE -- 2018-11-29: auxiliary verb and modal verb t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=813; audMemory[t] = new audNode(pho,0,audpsi); psi=813; pos=8; dba=0; num=0; KbLoad(); // 2018-11-29: infinitive t++; // 2018-11-29: one SPACE for sake of AudRecog() // DATA -- always plural noun in correction of modern usage t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=599; audMemory[t] = new audNode(pho,0,audpsi); psi=599; pos=5; dba=0; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // 814=DELETE -- 2018-11-29: verb for computers t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=814; audMemory[t] = new audNode(pho,0,audpsi); psi=814; pos=8; dba=0; num=0; KbLoad(); // 2018-11-29: infinitive t++; // 2018-11-29: one SPACE for sake of AudRecog() // 637=DESPITE -- 2018-11-13: preposition for EnPrep() module t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=637; audMemory[t] = new audNode(pho,0,audpsi); psi=637; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 815=DESTROY -- 2018-11-29: like opposite of MAKE t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=815; audMemory[t] = new audNode(pho,0,audpsi); psi=815; pos=8; dba=0; num=0; KbLoad(); // 2018-11-29: infinitive t++; // 2018-11-29: one SPACE for sake of AudRecog() // 816=DID -- 2018-11-29: normal verb or auxiliary verb t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=816; audMemory[t] = new audNode(pho,0,audpsi); psi=816; pos=8; dba=0; num=0; KbLoad(); // 2018-11-29: past tense t++; // 2018-11-29: one SPACE for sake of AudRecog() // 817=DIE -- 2018-11-29: verb for existential thought t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=817; audMemory[t] = new audNode(pho,0,audpsi); psi=817; pos=8; dba=0; num=0; KbLoad(); // 2018-11-29: past tense t++; // 2018-11-29: one SPACE for sake of AudRecog() // DO -- infinitive form of verb essential for EnAuxVerb module t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=818; audMemory[t] = new audNode(pho,0,audpsi); psi=818; pos=8; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // DO -- 1st person singular I-form of auxiliary verb t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=818; audMemory[t] = new audNode(pho,0,audpsi); psi=818; pos=8; dba=1; num=1; mfn=0; pre=0; seq=0;KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // DO -- 2nd person singular YOU-form of auxiliary verb t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=818; audMemory[t] = new audNode(pho,0,audpsi); psi=818; pos=8; dba=2; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // DOES -- 3rd person singular HE-SHE-IT-form of auxiliary verb t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=818; audMemory[t] = new audNode(pho,0,audpsi); psi=818; pos=8; dba=3; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // DO -- 1st person plural WE-form of auxiliary verb t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=818; audMemory[t] = new audNode(pho,0,audpsi); psi=818; pos=8; dba=1; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // DO -- 2nd person plural YOU-form of auxiliary verb t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=818; audMemory[t] = new audNode(pho,0,audpsi); psi=818; pos=8; dba=2; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog( // DO -- 3rd person plural THEY-form of auxiliary verb t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=818; audMemory[t] = new audNode(pho,0,audpsi); psi=818; pos=8; dba=3; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // DOING -- high word-frequency verb participle t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=183; audMemory[t] = new audNode(pho,0,audpsi); psi=183; pos=1; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // 638=DOWN -- 2018-11-13: preposition for EnPrep() module t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=638; audMemory[t] = new audNode(pho,0,audpsi); psi=638; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 819=DRINK -- 2018-11-29: common everyday verb t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=819; audMemory[t] = new audNode(pho,0,audpsi); psi=819; pos=8; dba=0; num=0; KbLoad(); // 2018-11-29: past tense t++; // 2018-11-29: one SPACE for sake of AudRecog() // 820=DROP -- 2018-11-29: verb for robotics t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="P"; audpsi=820; audMemory[t] = new audNode(pho,0,audpsi); psi=820; pos=8; dba=0; num=0; KbLoad(); // 2018-11-29: past tense t++; // 2018-11-29: one SPACE for sake of AudRecog() // 639=DURING -- 2018-11-13: preposition for EnPrep() module t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=639; audMemory[t] = new audNode(pho,0,audpsi); psi=639; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 821=EAT -- 2018-12-09: common everyday verb; useful for ontology t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=821; audMemory[t] = new audNode(pho,0,audpsi); psi=821; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 588=EIGHT -- 2019-11-07: noun for the hap(tic) sensation of the numeric "8" key. t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=588; audMemory[t] = new audNode(pho,0,audpsi); psi=588; pos=5; dba=4; num=0; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2019-11-07: one space for sake of AudRecog() // 324=EITHER -- conjunction for ConJoin module t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="R"; audpsi=324; audMemory[t] = new audNode(pho,0,audpsi); psi=324; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // ELSE -- adverb for machine reasoning logic; 11nov2012 t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=266; audMemory[t] = new audNode(pho,0,audpsi); psi=266; pos=2; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // 640=EXCEPT -- 2018-11-13: preposition for EnPrep() module t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="X"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=640; audMemory[t] = new audNode(pho,0,audpsi); psi=640; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 822=FALL -- 2018-12-09: intransitive verb of motion for robotics t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=822; audMemory[t] = new audNode(pho,0,audpsi); psi=822; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 823=FEEL -- 2018-12-09: from Wikipedia:Most_common_words_in_English t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=823; audMemory[t] = new audNode(pho,0,audpsi); psi=823; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 824=FIND -- 2018-12-09: from Wikipedia:Most_common_words_in_English t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=824; audMemory[t] = new audNode(pho,0,audpsi); psi=824; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 825=FINISH -- 2018-12-09: verb important for planning t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=825; audMemory[t] = new audNode(pho,0,audpsi); psi=825; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 545=FIVE -- 2019-11-07: noun for the hap(tic) sensation of the numeric "5" key. t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=545; audMemory[t] = new audNode(pho,0,audpsi); psi=545; pos=5; dba=4; num=0; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2019-11-07: one space for sake of AudRecog() // 641=FOR -- preposition for EnPrep module t++; pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="R"; audpsi=641; audMemory[t] = new audNode(pho,0,audpsi); psi=641; pos=6; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // 826=FORGET -- 2018-12-09: verb for cognition t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=826; audMemory[t] = new audNode(pho,0,audpsi); psi=826; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 544=FOUR -- 2019-11-07: noun for the hap(tic) sensation of the numeric "4" key. t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=544; audMemory[t] = new audNode(pho,0,audpsi); psi=544; pos=5; dba=4; num=0; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2019-11-07: one space for sake of AudRecog() // FRIEND -- for coding assignment of ad-hoc gender tags t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=517; audMemory[t] = new audNode(pho,0,audpsi); psi=517; pos=5; dba=0; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // 642=FROM -- 2018-11-13: preposition for EnPrep() module t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=642; audMemory[t] = new audNode(pho,0,audpsi); psi=642; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 827=GET -- 2018-12-09: from Wikipedia:Most_common_words_in_English t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=827; audMemory[t] = new audNode(pho,0,audpsi); psi=827; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // GIRL -- always feminine noun for use with gender flags ) t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=510; audMemory[t] = new audNode(pho,0,audpsi); psi=510; pos=5; dba=0; num=1; mfn=2; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 828=GIVE -- 2018-12-09: from Wikipedia:Most_common_words_in_English t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=828; audMemory[t] = new audNode(pho,0,audpsi); psi=828; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 829=GO -- 2018-12-09: from Wikipedia:Most_common_words_in_English t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=829; audMemory[t] = new audNode(pho,0,audpsi); psi=829; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // GOD -- masculine noun important for philosophy of AI t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=533; audMemory[t] = new audNode(pho,0,audpsi); psi=533; pos=5; dba=0; num=1; mfn=1; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // GOOD -- #134 2019-10-12: adjective for EnAdjective module t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=134; audMemory[t] = new audNode(pho,0,audpsi); psi=134; pos=1; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 830=GOT -- 2018-12-09: frequent word used in multiple ways t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=830; audMemory[t] = new audNode(pho,0,audpsi); psi=830; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: simple past of "GET" t++; // 2018-12-09: one SPACE for sake of AudRecog() // 831=GROK -- 2018-12-09: verb for cognition t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=831; audMemory[t] = new audNode(pho,0,audpsi); psi=831; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 832=HAD -- 2018-12-09: useful past-tense or subjunctive form t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=832; audMemory[t] = new audNode(pho,0,audpsi); psi=832; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: past tense t++; // 2018-12-09: one SPACE for sake of AudRecog() // 833=HATE -- 2018-12-09: verb for Emotion(); opposite of LOVE t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=833; audMemory[t] = new audNode(pho,0,audpsi); psi=833; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 834=HAVE -- 2018-12-09: irregular high word-frequency verb t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=834; audMemory[t] = new audNode(pho,0,audpsi); psi=834; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-11-26: SPACE for the sake of AudRecog() // HAS -- high word-frequency irregular verb form t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="S"; audpsi=834; audMemory[t] = new audNode(pho,0,audpsi); psi=834; pos=8; dba=3; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog( // HE -- nominative form of high word-frequency pronoun t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=713; audMemory[t] = new audNode(pho,0,audpsi); psi=713; pos=7; dba=1; num=1; mfn=1; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // HIS -- genitive form of personal pronoun t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="S"; audpsi=113; audMemory[t] = new audNode(pho,0,audpsi); psi=113; pos=1; dba=2; num=1; mfn=1; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // HIM -- dative indirect-object form of personal pronoun t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="M"; audpsi=713; audMemory[t] = new audNode(pho,0,audpsi); psi=713; pos=7; dba=3; num=1; mfn=1; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // HIM -- accusative direct-object form of personal pronoun t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="M"; audpsi=713; audMemory[t] = new audNode(pho,0,audpsi); psi=713; pos=7; dba=4; num=1; mfn=1; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 835=HEAR -- 2018-12-09: verb important for Audition() and robotics t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=835; audMemory[t] = new audNode(pho,0,audpsi); psi=835; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // HELLO -- interjection for human-computer interaction t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=450; audMemory[t] = new audNode(pho,0,audpsi); psi=450; pos=4; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 836=HELP -- 2018-12-09: socially significant common verb t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="P"; audpsi=836; audMemory[t] = new audNode(pho,0,audpsi); psi=836; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // HERE -- adverb for discussion of physical location t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=201; audMemory[t] = new audNode(pho,0,audpsi); psi=201; pos=2; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // HOW -- adverb for EnAdverb module t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="W"; audpsi=209; audMemory[t] = new audNode(pho,0,audpsi); psi=209; pos=2; dba=0; mfn=0; num=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // I -- nominative subject-form of personal pronoun; 25oct2012 t++;pho="I"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); rv=t; psi=701; jux=0; pos=7; dba=1; num=1; mfn=0; pre=0; seq=0; tkb=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // MINE -- genitive form of personal pronoun; 25oct2012 t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); psi=701; pos=7; dba=2; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // ME -- dative indirect-object form of personal pronoun t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); psi=701; pos=7; dba=3; num=1; mfn=0; pre=0; seq=0; tkb=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // ME -- accusative direct-object form of personal pronoun t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=701; audMemory[t] = new audNode(pho,0,audpsi); psi=701; pos=7; dba=4; num=1; mfn=0; pre=0; seq=0; tkb=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 327=IF -- 2018-11-26L conjunction for machine reasoning logic t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="F"; audpsi=327; audMemory[t] = new audNode(pho,0,audpsi); psi=327; pos=3; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 837=IMAGINE -- 2018-12-09: verb for cognition t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=837; audMemory[t] = new audNode(pho,0,audpsi); psi=837; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // IN -- preposition for EnPrep module t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=643; audMemory[t] = new audNode(pho,0,audpsi); psi=643; pos=6; num=0; mfn=0; pre=0; seq=0; KbLoad(); // 2018-11-13 t++; // 2018-11-26: SPACE for the sake of AudRecog() // 330=INASMUCH with AS -- 2018-11-26: conjunction for ConJoin() t++; // 2018-11-26: SPACE for the sake of AudRecog() // 644=INCLUDING -- 2018-11-13: preposition for EnPrep() module t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=644; audMemory[t] = new audNode(pho,0,audpsi); psi=644; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 645=INSIDE -- 2018-11-13: preposition for EnPrep() module t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=645; audMemory[t] = new audNode(pho,0,audpsi); psi=645; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 646=INTO -- 2018-11-13: preposition for EnPrep() module t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=646; audMemory[t] = new audNode(pho,0,audpsi); psi=646; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // IT -- nominative subject-form of personal pronoun; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="T"; audpsi=725; audMemory[t] = new audNode(pho,0,audpsi); psi=725; pos=7; dba=1; num=1; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // ITS -- genitive form of personal pronoun; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=725; audMemory[t] = new audNode(pho,0,audpsi); psi=725; pos=7; dba=2; num=1; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // IT -- dative indirect-object form of personal pronoun; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="T"; audpsi=725; audMemory[t] = new audNode(pho,0,audpsi); psi=725; pos=7; dba=3; num=1; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // IT -- accusative direct-object form of personal pronoun t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="T"; audpsi=725; audMemory[t] = new audNode(pho,0,audpsi); psi=725; pos=7; dba=4; num=1; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // JOHN -- 2019-09-20: #504 useful name for input-testing. t++;pho="J"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=504; audMemory[t] = new audNode(pho,0,audpsi); psi=504; mtx=0; pos=5; dba=1; num=1; mfn=1; KbLoad(); t++; // 2019-09-20: one space for sake of AudRecog() // 838=KNOW -- 2018-11-28: germane to artificial intelligence t++;pho="K"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="W"; audpsi=838; audMemory[t] = new audNode(pho,0,audpsi); psi=838; pos=8; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-10-06: SPACE for the sake of AudRecog() // 839=LEARN -- 2018-12-09: verb for cognition t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=839; audMemory[t] = new audNode(pho,0,audpsi); psi=839; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 840=LEAVE -- 2018-12-09: from Wikipedia:Most_common_words_in_English t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=840; audMemory[t] = new audNode(pho,0,audpsi); psi=840; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 841=LEND -- 2018-12-09: verb for dative and accusative t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi) t++;pho="D"; audpsi=841; audMemory[t] = new audNode(pho,0,audpsi); psi=841; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 647=LESS -- 2018-11-13: preposition for EnPrep() module t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=647; audMemory[t] = new audNode(pho,0,audpsi); psi=647; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 333=LEST -- 2018-11-26: conjunction for ConJoin module t++; pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="T"; audpsi=333; audMemory[t] = new audNode(pho,0,audpsi); psi=333; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 648=LIKE -- 2018-11-13: preposition for EnPrep() module t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=648; audMemory[t] = new audNode(pho,0,audpsi); psi=648; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 842=LIVE -- 2018-12-09: verb important for life t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi) t++;pho="E"; audpsi=842; audMemory[t] = new audNode(pho,0,audpsi); psi=842; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 843=LOAN -- 2018-12-09: verb for dative and accusative t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi) t++;pho="N"; audpsi=843; audMemory[t] = new audNode(pho,0,audpsi); psi=843; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 844=LOOK -- 2018-12-09: from Wikipedia:Most_common_words_in_English t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi) t++;pho="K"; audpsi=844; audMemory[t] = new audNode(pho,0,audpsi); psi=844; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 845=LOVE -- 2018-12-09: verb for Emotion(); opposite of HATE t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi) t++;pho="E"; audpsi=845; audMemory[t] = new audNode(pho,0,audpsi); psi=845; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-12-09: one SPACE for sake of AudRecog() // 846=MAKE -- 2018-12-09: from Wikipedia:Most_common_words_in_English t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=846; audMemory[t] = new audNode(pho,0,audpsi); psi=846; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // MAN -- always masculine noun for use with gender flags t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=543; audMemory[t] = new audNode(pho,0,audpsi); psi=543; pos=5; dba=0; num=1; mfn=1; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // MEN -- irregular plural for retrieval by parameters t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=543; audMemory[t] = new audNode(pho,0,audpsi); psi=543; pos=5; dba=0; num=2; mfn=1; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // 847=MAY -- 2018-12-09: auxiliary t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=847; audMemory[t] = new audNode(pho,0,audpsi); psi=847; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: present tense t++; // 2018-10-06: SPACE for the sake of AudRecog() // MAYBE -- adverb response as alternative to YES or NO t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=270; audMemory[t] = new audNode(pho,0,audpsi); psi=270; pos=2; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // MEDIA -- always plural noun in correction of modern usage t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=584; audMemory[t] = new audNode(pho,0,audpsi); psi=584; pos=5; dba=0; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-29: one SPACE for sake of AudRecog() // 848=MIGHT -- 2018-12-09: auxiliary t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=848; audMemory[t] = new audNode(pho,0,audpsi); psi=848; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: subjunctive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 649=MINUS -- 2018-11-13: preposition for EnPrep() module t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=649; audMemory[t] = new audNode(pho,0,audpsi); psi=649; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 650=MODULO -- 2018-11-13: preposition for EnPrep() module t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=650; audMemory[t] = new audNode(pho,0,audpsi); psi=650; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // MONEY -- 2019-08-04: #563 "money" as nominative subject noun t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=563; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=563; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=563; audMemory[t] = new audNode(pho,0,audpsi); psi=563; pos=5; dba=1; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2019-08-04: one space for sake of AudRecog() // MONEY -- 2019-08-04: #563 "money" as accusative noun t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=563; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=563; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=563; audMemory[t] = new audNode(pho,0,audpsi); psi=563; pos=5; dba=4; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2019-08-04: one space for sake of AudRecog() // 849=MOVE -- 2018-12-09: motion word for robotics t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=849; audMemory[t] = new audNode(pho,0,audpsi); psi=849; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 850=MUST -- 2018-12-09: auxiliary modal verb t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=850; audMemory[t] = new audNode(pho,0,audpsi); psi=850; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: present tense t++; // 2018-10-06: SPACE for the sake of AudRecog() // MY -- adjective for personal pronoun "I"; t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="Y"; audpsi=181; audMemory[t] = new audNode(pho,0,audpsi); psi=181; pos=1; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-10-06: SPACE for the sake of AudRecog() // 651=NEAR -- 2018-11-13: preposition for EnPrep() module t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=651; audMemory[t] = new audNode(pho,0,audpsi); psi=651; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 652=NEARER -- 2018-11-13: preposition for EnPrep() module t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=652; audMemory[t] = new audNode(pho,0,audpsi); psi=652; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 653=NEAREST -- 2018-11-13: preposition for EnPrep() module t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=653; audMemory[t] = new audNode(pho,0,audpsi); psi=653; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 851=NEED -- 2018-11-28: dba=0 infinitive for sake of logical inference t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=851; audMemory[t] = new audNode(pho,0,audpsi); psi=851; pos=8; dba=0; num=0; mfn=0; pre=0; seq=0; tkb=0; KbLoad(); t++; // 2018-10-06: SPACE for the sake of AudRecog() // 336=NEITHER -- conjunction for ConJoin module t++; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="R"; audpsi=336; audMemory[t] = new audNode(pho,0,audpsi); psi=336; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 654=NEXT (TO) -- 2018-11-13: as a preposition for EnPrep() module t++; // 2018-11-29: one SPACE for sake of AudRecog() // 559=NINE -- 2019-11-07: noun for the hap(tic) sensation of the numeric "9" key. t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=559; audMemory[t] = new audNode(pho,0,audpsi); psi=559; pos=5; dba=4; num=0; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2019-11-07: one space for sake of AudRecog() // NO -- interjection for human-computer interaction t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=404; audMemory[t] = new audNode(pho,0,audpsi); psi=404; pos=4; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 339=NOR -- 2018-11-26: conjunction for ConJoin() module t++; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="R"; audpsi=339; audMemory[t] = new audNode(pho,0,audpsi); psi=339; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // NOT -- for machine reasoning logic t++; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="T"; audpsi=250; audMemory[t] = new audNode(pho,0,audpsi); psi=250; pos=2; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // NOTHING -- VisRecog default for what the AI Mind sees t++; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="G"; audpsi=760; audMemory[t] = new audNode(pho,0,audpsi); psi=760; pos=7; dba=0; num=1; mfn=0; pre=0; seq=0; rv=276; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 238=NOW -- 2018-11-26: adverb // 342=NOW -- 2018-11-26: conjunction t++; // 2018-11-26: SPACE for the sake of AudRecog() // 655=OF -- preposition for EnPrep module t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="F"; audpsi=655; audMemory[t] = new audNode(pho,0,audpsi); psi=655; pos=6; num=0; pre=0; mfn=0; seq=0; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 656=OFF -- 2018-11-13: preposition for EnPrep() module t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="F"; audpsi=656; audMemory[t] = new audNode(pho,0,audpsi); psi=656; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 852=OFFER -- 2018-12-09: verb t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=852; audMemory[t] = new audNode(pho,0,audpsi); psi=852; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 657=ON -- 2018-11-13: preposition for EnPrep() module t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=657; audMemory[t] = new audNode(pho,0,audpsi); psi=657; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 551=ONE -- 2019-11-07: noun for the hap(tic) sensation of the numeric "1" key. t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=551; audMemory[t] = new audNode(pho,0,audpsi); psi=551; pos=5; dba=4; num=1; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2019-11-07: one space for sake of AudRecog() // 248=ONCE -- 2018-11-26: adverb // 345=ONCE -- 2018-11-26: conjunction t++; // 2018-11-26: SPACE for the sake of AudRecog() // 658=ONTO -- 2018-11-13: preposition for EnPrep() module t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=658; audMemory[t] = new audNode(pho,0,audpsi); psi=658; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 659=OPPOSITE -- 2018-11-13: preposition for EnPrep() module t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=659; audMemory[t] = new audNode(pho,0,audpsi); psi=659; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 348=OR -- 2018-11-26: conjunction for machine reasoning logic t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="R"; audpsi=348; audMemory[t] = new audNode(pho,0,audpsi); psi=348; pos=3; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 853=OUGHT -- 2018-12-09: auxiliary verb t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=853; audMemory[t] = new audNode(pho,0,audpsi); psi=853; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: subjunctive t++; // 2018-10-06: SPACE for the sake of AudRecog() // OUR -- adjective for personal pronoun "WE" t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="R"; audpsi=186; audMemory[t] = new audNode(pho,0,audpsi); psi=186; pos=1; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); // 660=OUT -- 2018-11-13: preposition for EnPrep() module t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=660; audMemory[t] = new audNode(pho,0,audpsi); psi=660; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 661 held for "OUT OF"; 2018-11-13 t++; // 2018-11-29: one SPACE for sake of AudRecog() // 662=OUTSIDE -- 2018-11-13: preposition for EnPrep() module t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=662; audMemory[t] = new audNode(pho,0,audpsi); psi=662; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 663=OVER -- 2018-11-13: preposition for EnPrep() module t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=663; audMemory[t] = new audNode(pho,0,audpsi); psi=663; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 854=OWE -- 2018-12-09: verb for dative and accusative t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=854; audMemory[t] = new audNode(pho,0,audpsi); psi=854; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 855=OWN -- 2018-12-09: common verb t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=855; audMemory[t] = new audNode(pho,0,audpsi); psi=855; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 664=PACE -- 2018-11-13: (Latin) preposition for EnPrep() module t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=664; audMemory[t] = new audNode(pho,0,audpsi); psi=664; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 665=PAST -- 2018-11-13: preposition for EnPrep() module t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=665; audMemory[t] = new audNode(pho,0,audpsi); psi=665; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 856=PAY -- 2018-12-09: verb for dative and accusative t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=856; audMemory[t] = new audNode(pho,0,audpsi); psi=856; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // PEOPLE -- establish as plural for EnParser t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=587; audMemory[t] = new audNode(pho,0,audpsi); psi=587; pos=5; dba=0; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 666=PER -- 2018-11-13: (Latin) preposition for EnPrep() module t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=666; audMemory[t] = new audNode(pho,0,audpsi); psi=666; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // PERSON -- for ad-hoc gender tags and robot philosophy t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=537; audMemory[t] = new audNode(pho,0,audpsi); psi=537; pos=5; dba=0; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 857=PICK -- 2018-12-09: verb for volition t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=857; audMemory[t] = new audNode(pho,0,audpsi); psi=857; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 858=PLACE -- 2018-12-09: movement verb for robotics t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=858; audMemory[t] = new audNode(pho,0,audpsi); psi=858; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 859=PLAY -- 2018-12-09: common verb t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=859; audMemory[t] = new audNode(pho,0,audpsi); psi=859; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // PLEASE -- interjection for human-computer interaction t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=410; audMemory[t] = new audNode(pho,0,audpsi); psi=410; pos=4; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-10-06: SPACE for the sake of AudRecog() // 667=PLUS -- 2018-11-13: (Latin) preposition for EnPrep() module t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=667; audMemory[t] = new audNode(pho,0,audpsi); psi=667; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 668=POST -- 2018-11-13: (Latin) preposition for EnPrep() module t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=668; audMemory[t] = new audNode(pho,0,audpsi); psi=668; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 669=PRO -- 2018-11-13: (Latin) preposition for EnPrep() module t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=669; audMemory[t] = new audNode(pho,0,audpsi); psi=669; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 860=PROMISE-- 2018-12-09: verb for dative and accusative t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=860; audMemory[t] = new audNode(pho,0,audpsi); psi=860; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 351=PROVIDED -- 2018-11-26: conjunction for ConJoin() module t++; pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="D"; audpsi=351; audMemory[t] = new audNode(pho,0,audpsi); psi=351; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 861=PUT -- 2018-12-09: motion verb for robotics t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi) t++;pho="T"; audpsi=861; audMemory[t] = new audNode(pho,0,audpsi); psi=861; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 670=QUA -- 2018-11-13: (Latin) preposition for EnPrep() module t++;pho="Q"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=670; audMemory[t] = new audNode(pho,0,audpsi); psi=670; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 862=QUIT -- 2018-12-09: common verb t++;pho="Q"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=862; audMemory[t] = new audNode(pho,0,audpsi); psi=862; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 671=RE -- 2018-11-13: (Latin) preposition for EnPrep() module t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=671; audMemory[t] = new audNode(pho,0,audpsi); psi=671; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 863=READ -- 2018-12-09: dba=0 infinitive for sake of logical inference t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=863; audMemory[t] = new audNode(pho,0,audpsi); psi=863; pos=8; dba=0; num=0; pre=0; seq=0; tkb=0; KbLoad(); t++; // 2018-10-06: SPACE for the sake of AudRecog() // 864=RECOGNIZE -- 2018-12-09: verb for cognition t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Z"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=864; audMemory[t] = new audNode(pho,0,audpsi); psi=864; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 672=REGARDING -- 2018-11-13: preposition for EnPrep() module t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=672; audMemory[t] = new audNode(pho,0,audpsi); psi=672; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 865=REMEMBER -- 2018-12-09: verb for cognition t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="B"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=865; audMemory[t] = new audNode(pho,0,audpsi); psi=865; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 866=ROLL -- 2018-12-09: motion verb for robotics t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=866; audMemory[t] = new audNode(pho,0,audpsi); psi=866; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 673=ROUND -- 2018-11-13: alternative to "around" for EnPrep() module t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=673; audMemory[t] = new audNode(pho,0,audpsi); psi=673; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 867=RUN -- 2018-12-09: motion verb for robotics t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=867; audMemory[t] = new audNode(pho,0,audpsi); psi=867; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 868=SAID -- 2018-12-09: verb for Speech() t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=868; audMemory[t] = new audNode(pho,0,audpsi); psi=868; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: past tense t++; // 2018-10-06: SPACE for the sake of AudRecog() // 674=SANS -- 2018-11-13: alternative to "around" for EnPrep() module t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=674; audMemory[t] = new audNode(pho,0,audpsi); psi=674; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 675=SAVE -- 2018-12-09: preposition for EnPrep() module t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=675; audMemory[t] = new audNode(pho,0,audpsi); psi=675; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 869=SAY -- 2018-12-09: verb for Speech() t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=869; audMemory[t] = new audNode(pho,0,audpsi); psi=869; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() t++; // 2018-07-12: making single-word time relative, not hard-coded. // 870=SEE -- 2018-12-09: lets VisRecog report non-KB direct objects. t++; pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=870; audMemory[t] = new audNode(pho,0,audpsi); psi=870; pos=8; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); // 871=SEEK -- 2018-12-09: useful verb t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=871; audMemory[t] = new audNode(pho,0,audpsi); psi=871; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 872=SEEM -- 2018-12-09: useful verb t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=872; audMemory[t] = new audNode(pho,0,audpsi); psi=872; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 873=SELL -- 2018-12-09: verb for dative and accusative t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=873; audMemory[t] = new audNode(pho,0,audpsi); psi=873; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 874=SEND -- 2018-12-09: verb for dative and accusative t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=874; audMemory[t] = new audNode(pho,0,audpsi); psi=874; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 577=SEVEN -- 2019-11-07: noun for the hap(tic) sensation of the numeric "7" key. t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=577; audMemory[t] = new audNode(pho,0,audpsi); psi=577; pos=5; dba=4; num=0; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2019-11-07: one space for sake of AudRecog() // 875=SHALL -- 2018-12-09: auxiliary modal verb t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=875; audMemory[t] = new audNode(pho,0,audpsi); psi=875; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: present tense t++; // 2018-10-06: SPACE for the sake of AudRecog() t++; // 2018-07-12: making single-word time relative, not hard-coded. // SHE -- nominative subject-form of personal pronoun t++; pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=719; audMemory[t] = new audNode(pho,0,audpsi); psi=719; pos=7; dba=1; num=1; mfn=2; pre=0; seq=0; KbLoad(); t++; // 2018-07-12: making single-word time relative, not hard-coded. // HERS -- genitive form of personal pronoun t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="S"; audpsi=719; audMemory[t] = new audNode(pho,0,audpsi); psi=719; pos=7; dba=2; num=1; mfn=2; pre=0; seq=0; KbLoad(); t++; // 2018-07-12: making single-word time relative, not hard-coded. // HER -- dative indirect-object form of personal pronoun t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="R"; audpsi=719; audMemory[t] = new audNode(pho,0,audpsi); psi=719; pos=7; dba=3; num=1; mfn=2; pre=0; seq=0; KbLoad(); t++; // 2018-07-12: making single-word time relative, not hard-coded. // HER -- accusative direct-object form of personal pronoun t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="R"; audpsi=719; audMemory[t] = new audNode(pho,0,audpsi); psi=719; pos=7; dba=4; num=1; mfn=2; pre=0; seq=0; KbLoad(); // 676=SHORT -- 2018-11-13: alternative to "around" for EnPrep() module t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=676; audMemory[t] = new audNode(pho,0,audpsi); psi=676; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 876=SHOULD -- 2018-12-09: auxiliary modal verb t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=876; audMemory[t] = new audNode(pho,0,audpsi); psi=876; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: subjunctive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 877=SHOW -- 2018-12-09: verb for dative and accusative t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="W"; audpsi=877; audMemory[t] = new audNode(pho,0,audpsi); psi=877; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 354=SINCE -- 2018-11-26: conjunction for ConJoin() module t++; // 2018-11-26: SPACE for the sake of AudRecog() // 677=SINCE -- 2018-11-13: preposition for EnPrep() module t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=677; audMemory[t] = new audNode(pho,0,audpsi); psi=677; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 566=SIX -- 2019-11-07: noun for the hap(tic) sensation of the numeric "6" key. t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="X"; audpsi=566; audMemory[t] = new audNode(pho,0,audpsi); psi=566; pos=5; dba=4; num=0; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2019-11-07: one space for sake of AudRecog() // 878=SLEEP -- 2018-12-09: verb pertaining to consciousness t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="P"; audpsi=878; audMemory[t] = new audNode(pho,0,audpsi); psi=878; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 879=SMELL -- 2018-12-09: verb for OldRecog() t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=879; audMemory[t] = new audNode(pho,0,audpsi); psi=879; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 358=SO -- 2018-11-26: conjunction for ConJoin() module t++; pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=358; audMemory[t] = new audNode(pho,0,audpsi); psi=358; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // SOFTWARE -- 2019-08-04: #579 "software" as nominative subject noun t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=579; audMemory[t] = new audNode(pho,0,audpsi); psi=579; pos=5; dba=1; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2019-08-04: one space for sake of AudRecog() // SOFTWARE -- 2019-08-04: #579 "software" as accusative noun t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="F"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=579; audMemory[t] = new audNode(pho,0,audpsi); psi=579; pos=5; dba=4; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2019-08-04: one space for sake of AudRecog() // SOME -- #154 2019-10-12: adjective for machine reasoning logic t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=154; audMemory[t] = new audNode(pho,0,audpsi); psi=154; pos=1; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // SOMETHING -- useful pronoun. t++; pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="G"; audpsi=755; audMemory[t] = new audNode(pho,0,audpsi); psi=755; pos=7; dba=0; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 880=SPEAK -- 2018-12-09: verb for Speech() t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=880; audMemory[t] = new audNode(pho,0,audpsi); psi=880; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 881=STOP -- 2018-12-09: verb useful for robotics t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="P"; audpsi=881; audMemory[t] = new audNode(pho,0,audpsi); psi=881; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 882=TAKE -- 2018-12-09: verb useful for robotics t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=882; audMemory[t] = new audNode(pho,0,audpsi); psi=882; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 883=TASTE -- 2018-12-09: verb for GusRecog() t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=883; audMemory[t] = new audNode(pho,0,audpsi); psi=883; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 884=TEACH -- 2018-12-09: verb for Imperative() to say "TEACH ME SOMETHING". t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=884; audMemory[t] = new audNode(pho,0,audpsi); psi=884; pos=8; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 885=TELL -- 2018-12-09: verb for direct and indirect object t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=885; audMemory[t] = new audNode(pho,0,audpsi); psi=885; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 678=THAN -- 2018-11-13: preposition for EnPrep() module t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=678; audMemory[t] = new audNode(pho,0,audpsi); psi=678; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 361=THAT -- 2018-11-26: conjunction for ConJoin module t++; pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="T"; audpsi=361; audMemory[t] = new audNode(pho,0,audpsi); psi=361; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // THAT -- high word-frequency pronoun t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=745; audMemory[t] = new audNode(pho,0,audpsi); psi=745; pos=7; dba=0; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // THE -- EnArticle highest-frequency English word t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=117; audMemory[t] = new audNode(pho,0,audpsi); psi=117; pos=1; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // THEIR -- adjective for personal pronoun "THEY" t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=188; audMemory[t] = new audNode(pho,0,audpsi); psi=188; pos=1; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // THEN -- for machine reasoning logic t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=213; audMemory[t] = new audNode(pho,0,audpsi); psi=213; pos=2; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // THERE -- adverb for discussion of physical location t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=205; audMemory[t] = new audNode(pho,0,audpsi); psi=205; pos=2; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // THEY -- nominative subject-form of personal pronoun t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=743; audMemory[t] = new audNode(pho,0,audpsi); psi=743; pos=7; dba=1; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // THEIRS -- genitive form of personal pronoun t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=743; audMemory[t] = new audNode(pho,0,audpsi); psi=743; pos=7; dba=2; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // THEM -- dative indirect-object form of personal pronoun t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=743; audMemory[t] = new audNode(pho,0,audpsi); psi=743; pos=7; dba=3; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // THEM -- accusative direct-object form of personal pronoun t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=743; audMemory[t] = new audNode(pho,0,audpsi); psi=743; pos=7; dba=4; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 886=THINK -- 2018-12-09: germane to artificial intelligence t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=886; audMemory[t] = new audNode(pho,0,audpsi); psi=886; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-11-26: SPACE for the sake of AudRecog() // 363=THOUGH -- 2018-11-26: conjunction for complex sentences t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=363; audMemory[t] = new audNode(pho,0,audpsi); psi=363; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 583=THREE -- 2019-11-07: noun for the hap(tic) sensation of the numeric "3" key. t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=583; audMemory[t] = new audNode(pho,0,audpsi); psi=583; pos=5; dba=4; num=0; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2019-11-07: one space for sake of AudRecog() // 679=THROUGH -- 2018-11-13: preposition for EnPrep() module t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=679; audMemory[t] = new audNode(pho,0,audpsi); psi=679; pos=6; KbLoad(); t++; // 2018-11-13: SPACE for the sake of AudRecog() // 680=THROUGHOUT -- 2018-11-14: preposition for EnPrep() module t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="G"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=680; audMemory[t] = new audNode(pho,0,audpsi); psi=680; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 681=THRU -- 2018-11-14: preposition for EnPrep() module t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=681; audMemory[t] = new audNode(pho,0,audpsi); psi=681; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 366=TILL -- 2018-11-26: conjunction for complex sentences t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=366; audMemory[t] = new audNode(pho,0,audpsi); psi=366; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 682=TILL -- 2018-11-26: preposition for EnPrep() module t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=682; audMemory[t] = new audNode(pho,0,audpsi); psi=682; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 683=TO -- 2018-11-14: preposition for EnPrep() module t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=683; audMemory[t] = new audNode(pho,0,audpsi); psi=683; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 887=TOLD -- 2018-12-09: verb for communication t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=887; audMemory[t] = new audNode(pho,0,audpsi); psi=887; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: past tense t++; // 2018-10-06: SPACE for the sake of AudRecog() // 888=TOUCH -- 2018-12-09: verb for TacRecog() t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="C"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=888; audMemory[t] = new audNode(pho,0,audpsi); psi=888; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 684=TOWARD -- 2018-11-14: preposition for EnPrep() module t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=684; audMemory[t] = new audNode(pho,0,audpsi); psi=684; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 685=TOWARDS -- 2018-11-14: preposition for EnPrep() module t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=685; audMemory[t] = new audNode(pho,0,audpsi); psi=685; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 889=TRY -- 2018-12-09: verb for Volition() and goal-seeking t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="Y"; audpsi=889; audMemory[t] = new audNode(pho,0,audpsi); psi=889; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 891=TURN -- 2018-12-09: motion verb for robotics t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=891; audMemory[t] = new audNode(pho,0,audpsi); psi=891; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 582=TWO -- 2019-11-07: noun for the hap(tic) sensation of the numeric "2" key. t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=582; audMemory[t] = new audNode(pho,0,audpsi); psi=582; pos=5; dba=4; num=0; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2019-11-07: one space for sake of AudRecog() // 686=UNDER -- 2018-11-14: preposition for EnPrep() module t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=686; audMemory[t] = new audNode(pho,0,audpsi); psi=686; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 687=UNDERNEATH -- 2018-11-14: preposition for EnPrep() module t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=687; audMemory[t] = new audNode(pho,0,audpsi); psi=687; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 892=UNDERSTAND -- 2018-12-09: verb for cognition t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=892; audMemory[t] = new audNode(pho,0,audpsi); psi=892; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 369=UNLESS -- 2018-11-26: conjunction for ConJoin module t++; pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="S"; audpsi=369; audMemory[t] = new audNode(pho,0,audpsi); psi=369; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 688=UNLIKE -- 2018-11-14: preposition for EnPrep() module t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=688; audMemory[t] = new audNode(pho,0,audpsi); psi=688; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 372=UNTIL -- 2018-11-26: conjunction for ConJoin() module t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=372; audMemory[t] = new audNode(pho,0,audpsi); psi=372; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 689=UNTIL -- 2018-11-14: preposition for EnPrep() module t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=689; audMemory[t] = new audNode(pho,0,audpsi); psi=689; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 690=UNTO -- 2018-11-14: preposition for EnPrep() module t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=690; audMemory[t] = new audNode(pho,0,audpsi); psi=690; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 691=UP -- 2018-11-14: preposition for EnPrep() module t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="P"; audpsi=691; audMemory[t] = new audNode(pho,0,audpsi); psi=691; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 692=UPON -- 2018-11-14: preposition for EnPrep() module t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=692; audMemory[t] = new audNode(pho,0,audpsi); psi=692; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 693=UPSIDE -- 2018-11-14: preposition for EnPrep() module t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="P"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="D"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=693; audMemory[t] = new audNode(pho,0,audpsi); psi=693; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 893=USE -- 2018-12-09: common verb t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=893; audMemory[t] = new audNode(pho,0,audpsi); psi=893; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 894=WALK -- 2018-12-09: motion verb for robotics t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=894; audMemory[t] = new audNode(pho,0,audpsi); psi=894; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 895=WANT -- 2018-12-09: verb for Volition(0 t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=895; audMemory[t] = new audNode(pho,0,audpsi); psi=895; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // WE -- nominative subject-form of personal pronoun t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=731; audMemory[t] = new audNode(pho,0,audpsi); psi=731; pos=7; dba=1; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // OURS -- genitive form of personal pronoun t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=731; audMemory[t] = new audNode(pho,0,audpsi); psi=731; pos=7; dba=2; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // US -- dative indirect-object form of personal pronoun t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="S"; audpsi=731; audMemory[t] = new audNode(pho,0,audpsi); psi=731; pos=7; dba=3; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // US -- accusative direct-object form of personal pronoun t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="S"; audpsi=731; audMemory[t] = new audNode(pho,0,audpsi); psi=731; pos=7; dba=4; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 694=VERSUS -- 2018-11-14: preposition for EnPrep() module t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=694; audMemory[t] = new audNode(pho,0,audpsi); psi=694; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 695=VIA -- 2018-11-14: preposition for EnPrep() module t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=695; audMemory[t] = new audNode(pho,0,audpsi); psi=695; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 696=VIS-A-VIS -- 2018-11-14: as a preposition for EnPrep() module t++; // 2018-11-26: SPACE for the sake of AudRecog() // WHAT -- nominative pronoun for SelfReferentialThought t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=781; audMemory[t] = new audNode(pho,0,audpsi); psi=781; pos=7; dba=1; num=1; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // WHAT -- accusative pronoun for SelfReferentialThought t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=781; audMemory[t] = new audNode(pho,0,audpsi); psi=781; pos=7; dba=4; num=1; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 263=WHEN -- 2018-11-26: adverb for SelfReferentialThought t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=263; audMemory[t] = new audNode(pho,0,audpsi); psi=263; pos=2; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 375=WHEN -- 2018-11-26: conjunction for ConJoin() module t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=375; audMemory[t] = new audNode(pho,0,audpsi); psi=375; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 378=WHENEVER -- 2018-11-26: conjunction for ConJoin() module t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="V"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=378; audMemory[t] = new audNode(pho,0,audpsi); psi=378; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // WHERE -- 2018-11-26: adverb for SelfReferentialThought t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=245; audMemory[t] = new audNode(pho,0,audpsi); psi=245; pos=2; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 381=WHEREAS -- 2018-11-26: conjunction for ConJoin() module t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=381; audMemory[t] = new audNode(pho,0,audpsi); psi=381; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 384=WHETHER -- 2018-11-26: conjunction for ConJoin() module t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=384; audMemory[t] = new audNode(pho,0,audpsi); psi=384; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 387=WHILE -- 2018-11-26: conjunction for ConJoin() module t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=387; audMemory[t] = new audNode(pho,0,audpsi); psi=387; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // WHO -- for SelfReferentialThought t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=791; audMemory[t] = new audNode(pho,0,audpsi); psi=791; pos=7; dba=1; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // WHOSE -- for AI to ask grammatically correct questions t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=794; audMemory[t] = new audNode(pho,0,audpsi); psi=794; pos=7; dba=2; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // WHOM -- for AI to ask grammatically correct questions t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=794; audMemory[t] = new audNode(pho,0,audpsi); psi=794; pos=7; dba=3; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // WHOM -- for AI to ask grammatically correct questions t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=794; audMemory[t] = new audNode(pho,0,audpsi); psi=794; pos=7; dba=4; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 297=WHY -- 2018-11-26: adverb for asking questions t++; pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="Y"; audpsi=297; audMemory[t] = new audNode(pho,0,audpsi); psi=297; pos=2; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26 SPACE for the sake of AudRecog() // 390=WHY -- 2018-11-26: conjunction for ConJoin() module t++; pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="Y"; audpsi=390; audMemory[t] = new audNode(pho,0,audpsi); psi=390; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 896=WILL -- 2018-12-09: auxiliary verb for future tense t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="L"; audpsi=896; audMemory[t] = new audNode(pho,0,audpsi); psi=896; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: modal verb t++; // 2018-10-06: SPACE for the sake of AudRecog() // 897=WISH -- 2018-12-09: verb for Volition() t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=897; audMemory[t] = new audNode(pho,0,audpsi); psi=897; pos=8; dba=0; num=0; KbLoad(); // 2018-12-09: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 697=WITH -- 2018-11-14: preposition for EnPrep() module t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=697; audMemory[t] = new audNode(pho,0,audpsi); psi=697; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 698=WITHIN -- 2018-11-14: preposition for EnPrep() module t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=698; audMemory[t] = new audNode(pho,0,audpsi); psi=698; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() // 699=WITHOUT -- 2018-11-14: preposition for EnPrep() module t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="T"; audpsi=699; audMemory[t] = new audNode(pho,0,audpsi); psi=699; pos=6; KbLoad(); t++; // 2018-11-14: SPACE for the sake of AudRecog() t++; // 2018-07-12: making single-word time relative, not hard-coded. // WOMAN -- always feminine noun for use with gender flags t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="A"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=515; audMemory[t] = new audNode(pho,0,audpsi); psi=515; pos=5; dba=0; num=1; mfn=2; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // WOMEN -- irregular plural for retrieval by parameters t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="M"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="N"; audpsi=515; audMemory[t] = new audNode(pho,0,audpsi); psi=515; pos=5; dba=0; num=2; mfn=2; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 898=WORK -- 2018-12-16: commonverb t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="K"; audpsi=898; audMemory[t] = new audNode(pho,0,audpsi); psi=898; pos=8; dba=0; num=0; KbLoad(); // 2018-12-16: infinitive t++; // 2018-10-06: SPACE for the sake of AudRecog() // 899=WORSHIP -- 2019-10-24: for link from you-concept to God-concept t++;pho="W"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="S"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="H"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="I"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="P"; audpsi=899; audMemory[t] = new audNode(pho,0,audpsi); psi=899; pos=8; dba=0; num=0; KbLoad(); // 2019-10-24: infinitive t++; // 2019-10-24: space for the sake of AudRecog() // YES -- interjection for human-computer interaction t++; pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="S"; audpsi=432; audMemory[t] = new audNode(pho,0,audpsi); psi=432; pos=4; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 393=YET -- 2018-11-26: conjunction for ConJoin() module t++; pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="T"; audpsi=393; audMemory[t] = new audNode(pho,0,audpsi); psi=393; pos=3; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // YOU -- nominative singular of personal pronoun t++; pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="U"; audpsi=707; audMemory[t] = new audNode(pho,0,audpsi); psi=707; pos=7; dba=1; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // YOURS -- genitive singular of personal pronoun t++; pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="S"; audpsi=707; audMemory[t] = new audNode(pho,0,audpsi); psi=707; pos=7; dba=2; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // YOU -- dative singular of personal pronoun t++; pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="U"; audpsi=707; audMemory[t] = new audNode(pho,0,audpsi); psi=707; pos=7; dba=3; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // YOU -- accusative singular of personal pronoun t++; pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="U"; audpsi=707; audMemory[t] = new audNode(pho,0,audpsi); psi=707; pos=7; dba=4; num=1; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // YOU -- nominative plural of personal pronoun t++; pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="U"; audpsi=737; audMemory[t] = new audNode(pho,0,audpsi); psi=737; pos=7; dba=1; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // YOURS -- genitive plural of personal pronoun t++; pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="S"; audpsi=737; audMemory[t] = new audNode(pho,0,audpsi); psi=737; pos=7; dba=2; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // YOU -- dative plural of personal pronoun t++; pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="U"; audpsi=737; audMemory[t] = new audNode(pho,0,audpsi); psi=737; pos=7; dba=3; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // YOU -- accusative plural of personal pronoun t++; pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++; pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++; pho="U"; audpsi=737; audMemory[t] = new audNode(pho,0,audpsi); psi=737; pos=7; dba=4; num=2; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // YOUR -- adjective for personal pronoun "YOU" t++;pho="Y"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="O"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="U"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=182; audMemory[t] = new audNode(pho,0,audpsi); psi=182; pos=1; dba=0; num=0; mfn=0; pre=0; seq=0; KbLoad(); t++; // 2018-11-26: SPACE for the sake of AudRecog() // 590=ZERO -- 2019-11-07: noun for the hap(tic) sensation of the numeric "0" key. t++;pho="Z"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); rv=t; t++;pho="E"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="R"; audpsi=0; audMemory[t] = new audNode(pho,0,audpsi); t++;pho="O"; audpsi=590; audMemory[t] = new audNode(pho,0,audpsi); psi=590; pos=5; dba=4; num=0; mfn=3; pre=0; seq=0; KbLoad(); t++; // 2019-11-07: one space for sake of AudRecog() t++; // 2018-11-26: SPACE for the sake of AudRecog() pho="";audpsi=0;psi=0;act=0;jux=0;pos=0;dba=0;num=0;mfn=0;pre=0;iob=0;seq=0;tkb=0;rv=0 t = (t+1); // 2018-01-03: nxt = 3001; // 2018-01-09: next new concept, as in ghost.pl AI and MindForth. spt = t; // 2018-01-06: so that AudInput will have a valid first space-time. tpu = t; // 2018-10-02: isolate tpu from previous input-and-output. vault = t; // 2018-07-12: dynamically calculated by incremental t++ apb = "MindBoot: English bootstrap has loaded and now calling MainLoop()"; Voice(); document.forms[1].ear.focus(); MainLoop(); } // 2018-06-11: end of MindBoot English bootstrap; NewConcept() learns more words. function ReJuvenate() { // http://ai.neocities.org/ReJuvenate.html edge = 0; // When found, edge-of-thought becomes "1". istr = (vault + coda); // 2018-10-13: initial calculation of "istr" rjc = (rjc+1); // 2018-01-18: increment rejuvenation counter. if (rjc > 99999) rjc = 1; // 2018-01-18: for immortal AI avoid infinite count. apb=("<font color='red'>"+"Rejuvenating; please wait!"+"<\/font>"); Voice(); // Display the Voice:brain apb message. jrt = vault; // 2018-10-12: let "jrt" increment after the "vault" for (i = istr; i < cns; ++i) { // 2018-10-13: loop forwards from initial "istr" if (edge == 0) { // 2018-10-13: not yet set to unitary one. audMemory[i].audExam(); // 2018-10-13: examine auditory memory mg++; // 2018-10-13: increment until "edge" is found. if (aud0 == "{") edge = 1; // 2018-10-13: if "edge" of thought is found... if (aud0 == "{") istr = i; // 2018-10-13: reset the "istr" starting-point. if (aud0 == "{") mg = (mg + coda - 1) // 2018-10-13: distance from "vault" if (aud0 == "{") break; // 2018-10-13: abandon the rest of the loop. } // 2018-10-13: end of search for edge-of-thought "istr" starting-point. } // 2018-10-13: end of loop looking for a first "edge" of thought. for (i = istr; i < cns; ++i) { // 2018-10-13: loop forwards from "istr" point. Psy[i].psyExam(); // 2019-07-27: subtracting coda from psi14 to keep tkb valid: if (psi14>0) psi14= (psi14 - mg); // 2019-07-27: only for a concept-row. if (psi20>0) psi20= (psi20 - mg); // 2019-07-27: only for a concept-row. Psy[jrt] = new psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-27 psi14 = 0; // 2019-07-27: reset to prevent carry over. Psy[i] = new psyNode(" "," "," "," "," "," "," ", " "," "," "," "," "," "," ", " "," "," "," "," "," "," "); // 2019-07-27 audMemory[i].audExam(); // 2018-10-12: gain access to auditory engram nodes audMemory[jrt] = new audNode(aud0,aud1,aud2); // 2018-10-12: move engrams back. audMemory[i] = new audNode(" ",0," "); // 2018-10-12: zero out old time-row. jrt++; // 2018-10-13: advance each "junior-time" point for a moved engram. } // 2018-10-12: end of loop moving forwards while shifting engrams back. edge = 0; // 2018-10-12: reset for next call of ReJuvenate() t = (jrt - mg); // 2018-10-13: TEST mg = 0; // 2018-10-13: reset to prevent carry-over. for (j = t; j < cns; ++j) { // 2018-10-12: clean out engrams beyond current "t" audMemory[j] = new audNode(" ",0," "); // 2018-01-18: pho(neme); act; audpsi Psy[j] = new psyNode(" "," "," "," "," "," "," ", " "," "," "," "," "," "," ", " "," "," "," "," "," "," "); // 2019-07-27 } // 2018-10-12: end of sweep of memory beyond current time "t". } // 2019-07-31: End of ReJuvenate(); return to SeCurity(); function ReEntry() { pov = 1; // 2018-01-15: numeric code for internal POV. t = (t + 1); onset = (spt + 1); if (dirobj == 1) dba = 4; // From RuAi; test; 19oct2012 if (pho != " ") { // 2018-01-15: if pho is not a 32=SPACE... len = (len +1); AudInput(); // 2019-09-21: May be causing reduplication of output. } // End of test that input "pho" is not a "space". if (pho == " ") { // 2018-01-15: If pho is a "space". AudInput(); // Re-entry into audition; 13jul2010 } // End of test for space-bar re-entry; 13jul2010 pos = 0; // 2018-01-21: Reset to prevent InStantiate() carry-over. pre = 0; // 2018-01-21: Reset to prevent InStantiate() carry-over. psi = 0; // 2018-01-21: Reset to prevent InStantiate() carry-over. } // End of ReEntry(); return to SpeechAct(). function Voice() { outputplus = ("<font size='+3' color='navy'>"+output+"<\/b><\/font>"); document.all.mouth.innerHTML = outputplus; document.all.brain.innerHTML = apb; } function Speech() { // http://ai.neocities.org/Speech.html audstop = 0; // 2017-12-31: Initially false value of flag pov = 1; // 2017-12-31: only internal POV thinking uses Speech module. t2s = aud; // 2017-12-31: start from the auditory recall-vector "aud" for (i = 0; i < 41; i++) { // 2018-01-13: assume word no longer than 40 ch. audMemory[t2s].audExam(); // 2017-12-31: expose ear-array values at "t2s". pho = aud0; // 2018-01-03: for re-entry; TEST; REMOVE? output += aud0; // 2017-12-31: concatenate each engram to "output".// if (pho == " ") { // 2017-12-31: if space detected... pho = " "; // 2017-12-31: blank SPACE-32 audstop = 1; // 2017-12-31: flag to end a word with a space } // 2017-12-31: end of test for a blank space. if (pho == 13) { // 2017-12-31: including any 32=SPACE... lastpho = pho; // 2017-12-31: to avoid extra "S" on verbs } // 2017-12-31: end of constantly keeping track of last pho. if (pho == 0 || pho == 13 || pho == 32 || pho == " ") { // 2018-01-13: SPACE audstop = 1; // 2017-12-31: flag for finding end of word spacegap = 1; // 2017-12-31: identify presence of a space } // 2017-12-31: end of test for 13=CR or 32=SPACE. ReEntry(); // 2018-01-15: from the obsolete JSAI if (audstop == 1) { // 2017-12-31: flag found for end of word? if (spacegap == 1) { // 2017-12-31: space found pho = " "; // 2017-12-31: send SPACE-32 into AudInput? len = 0; // 2018-01-06: at end of word, reset length "len" spacegap = 0; // 2017-12-31: reset } // 2017-12-31: end of test for a space. return; // 2018-01-13: from MindForth ("LEAVE" } // 2017-12-31: end of test for end-of-word flag. pov = 1; // 2017-12-31: internal point-of-view during thinking. t2s = (t2s + 1); // 2017-12-31: Increment time-to-speech to advance thru memory. if (aud0 == " ") { // 2017-12-31: if no character is found audrv = t2s; // 2017-12-31: Prepare for next word in memory. if (pho == 13 || pho == " ") pov = 2; // 2018-01-13: for sake of pause-counter return; // 2018-01-13: TEST } // 2017-12-31: end of test for no character found. } while ( t2s != cns ); // 2017-12-31: Show the whole array of AI Mind memory. phodex = 1; // 2017-12-31: reset for AudBuffer() output += " "; Voice(); } // 2017-12-31: End of Speech() function ConJoin() { // http://ai.neocities.org/ConJoin.html if (etc > 1) conj = 306; // 2019-02-18: use conjunction 306=AND if (etc > 2) etc = 0; // 2019-03-03: prevent runaway values. if (qv2psi==886 || qv2psi==838 || verbpsi==886 || verbpsi==838) { // 2018-11-28 conj = 361; // 2018-11-26: conjunction is 361=THAT } // 2019-02-12: end of test for verbs leading to conjunction 361=THAT. for (i=vault; i>midway; i--) { // 2018-05-28: search in "vault" for reliability. Psy[i].psyExam(); // 2018-05-28: inspect the Psy concept flag-panel if (psi1 == conj) { // 2019-02-12: if conjunction is found... audjuste = psi20; // 2019-09-20: conjunction recall-vector; aud = psi20; // 2019-07-31: conj recall-vector for Speech() break; // 2018-05-28: one auditory engram is enough. } // 2019-02-12: End of search for $conj conjunction; } // 2018-05-28: end of loop searching for conjunction "THAT". if (conj > 0) Speech(); // 2019-02-12: speak the word starting at the "aud" time. if (conj==361) Speech(); // 2018-11-26: only speak 361=THAT } // 2019-09-20: ConJoin() returns to EnThink(). function EnArticle() { // http://ai.neocities.org/EnArticle.html if (usx == us1) { // 2018-09-05: if definite article "the" is warranted... for (i=vault; i>0; i--) { // 2018-09-06: search for 117=THE Psy[i].psyExam(); // 2018-09-06: examine @psy array; if (psi1 == 117) { // 2018-09-06: if 117=THE is found; aud = psi20; // 2019-07-31: "THE" recall-vector for Speech() if (psi20 > 0) break; // 2019-07-31: auditory-recall insurance. } // 2018-09-06: End of search for 117=THE. } // 2018-09-06: End of search loop from "vault" back to zero. Speech(); // 2018-09-06: speak the word starting at the "aud" time. return; // 2018-09-06: skip the rest of EnArticle() } // 2018-09-05: end of test for need to say "THE". if (usx == us2) { // 2018-09-06: if definite article "the" is warranted... for (i=vault; i>0; i--) { // 2018-09-06: search for 117=THE Psy[i].psyExam(); // 2018-09-06: examine @psy array; if (psi1 == 117) { // 2018-09-06: if 117=THE is found; aud = psi20; // 2019-07-31: "THE" recall-vector for Speech() if (psi20 > 0) break; // 2019-07-31: auditory-recall insurance. } // 2018-09-06: End of search for 117=THE. } // 2018-09-06: End of search loop from "vault" back to zero. Speech(); // 2018-09-06: speak the word starting at the "aud" time. return; // 2018-09-06: skip the rest of EnArticle() } // 2018-09-06: end of test for need to say "THE". if (usx == us3) { // 2018-09-06: if definite article "the" is warranted... for (i=vault; i>0; i--) { // 2018-09-06: search for 117=THE Psy[i].psyExam(); // 2018-09-06: examine @psy array; if (psi1 == 117) { // 2018-09-06: if 117=THE is found; aud = psi20; // 2019-07-31: "THE" recall-vector for Speech() if (psi20 > 0) break; // 2019-07-31: auditory-recall insurance. } // 2018-09-06: End of search for 117=THE. } // 2018-09-06: End of search loop from "vault" back to zero. Speech(); // 2018-09-06: speak the word starting at the "aud" time. return; // 2018-09-06: skip the rest of EnArticle() } // 2018-09-06: end of test for need to say "THE". if (usx == us4) { // 2018-09-06: if definite article "the" is warranted... for (i=vault; i>0; i--) { // 2018-09-06: search for 117=THE Psy[i].psyExam(); // 2018-09-06: examine @psy array; if (psi1 == 117) { // 2018-09-06: if 117=THE is found; aud = psi20; // 2019-07-031: "THE" recall-vector for Speech() if (psi20 > 0) break; // 2019-07-31: auditory-recall insurance. } // 2018-09-06: End of search for 117=THE. } // 2018-09-06: End of search loop from "vault" back to zero. Speech(); // 2018-09-06: speak the word starting at the "aud" time. return; // 2018-09-06: skip the rest of EnArticle() } // 2018-09-06: end of test for need to say "THE". if (usx == us5) { // 2018-09-06: if definite article "the" is warranted... for (i=vault; i>0; i--) { // 2018-09-06: search for 117=THE Psy[i].psyExam(); // 2018-09-06: examine @psy array; if (psi1 == 117) { // 2018-09-06: if 117=THE is found; aud = psi20; // 2019-07-31: "THE" recall-vector for Speech() if (psi20 > 0) break; // 2019-07-31: auditory-recall insurance. } // 2018-09-06: End of search for 117=THE. } // 2018-09-06: End of search loop from "vault" back to zero. Speech(); // 2018-09-06: speak the word starting at the "aud" time. return; // 2018-09-06: skip the rest of EnArticle() } // 2018-09-06: end of test for need to say "THE". if (usx == us6) { // 2018-09-06: if definite article "the" is warranted... for (i=vault; i>0; i--) { // 2018-09-06: search for 117=THE Psy[i].psyExam(); // 2018-09-06: examine @psy array; if (psi1 == 117) { // 2018-09-06: if 117=THE is found; aud = psi20; // 2019-07-31: "THE" recall-vector for Speech() if (psi20 > 0) break; // 2019-07-31: auditory-recall insurance. } // 2018-09-06: End of search for 117=THE. } // 2018-09-06: End of search loop from "vault" back to zero. Speech(); // 2018-09-06: speak the word starting at the "aud" time. return; // 2018-09-06: skip the rest of EnArticle() } // 2018-09-06: end of test for need to say "THE". if (usx == us7) { // 2018-09-06: if definite article "the" is warranted... for (i=vault; i>0; i--) { // 2018-09-06: search for 117=THE Psy[i].psyExam(); // 2018-09-06: examine @psy array; if (psi1 == 117) { // 2018-09-06: if 117=THE is found; aud = psi20; // 2019-07-31: "THE" recall-vector for Speech() if (psi20 > 0) break; // 2019-07-31: auditory-recall insurance. } // 2018-09-06: End of search for 117=THE. } // 2018-09-06: End of search loop from "vault" back to zero. Speech(); // 2018-09-06: speak the word starting at the "aud" time. return; // 2018-09-06: skip the rest of EnArticle() } // 2018-09-06: end of test for need to say "THE". usn = (usn + 1); // 2018-09-04: increment the upstream-idea rotation number. if (usx > 0 && usn==1) us1 = usx; // 2018-09-05: transfer the noun concept. if (usx > 0 && usn==2) us2 = usx; // 2018-09-04: transfer the noun concept. if (usx > 0 && usn==3) us3 = usx; // 2018-09-04: transfer the noun concept. if (usx > 0 && usn==4) us4 = usx; // 2018-09-04: transfer the noun concept. if (usx > 0 && usn==5) us5 = usx; // 2018-09-04: transfer the noun concept. if (usx > 0 && usn==6) us6 = usx; // 2018-09-04: transfer the noun concept. if (usx > 0 && usn==7) us7 = usx; // 2018-09-04: transfer the noun concept. if (usn > 6) usn = 1; // 2018-09-04: after usn=7 rotate back to usn=1 if (subjnum==1 && qv2psi==800) { // 2018-02-04: Deal with "I AM...." for (i=vault; i>midway; i--) { // 2018-02-04: search in "vault" for reliability. Psy[i].psyExam(); // 2018-02-04: inspect the Psy concept flag-panel if (anset==0) { // 2018-02-04: if no vowel at start of noun... if (psi1 == 101) { // 2018-02-04: if 101=A is found; aud = psi20; // 2019-07-21: "A" recall-vector for Speech() break; // 2018-02-04: one auditory engram is enough. } // 2018-02-04: End of search for 101=A } // 2018-02-04: end of test for vowel-flag "anset". if (anset > 0) { // 2018-02-04: if vowel at start of noun... if (psi1 == 102) { // 2018-02-04: if 102=AN is found; aud = psi20; // 2019-07-31: "AN" recall-vector for Speech() anset = 0; // 2018-02-04: reset to zero for safety. break; // 2018-02-04: one auditory engram is enough. } // 2018-02-04: End of search for 102=AN; } // 2018-02-04: end of test for positive vowel-flag "anset". } // 2018-02-04: end of loop searching for "A" or "AN". Speech(); // 2018-02-04: speak the word starting at the "aud" time. return; // 2018-06-16: skip the rest of EnArticle() } // 2018-02-04: end of test for singular subject with 800=BE verb. if (nphrnum == 1) { // 2018-09-05: check also for OutBuffer b16 != "S"? for (i=vault; i>midway; i--) { // 2018-09-05: search in "vault" for reliability. Psy[i].psyExam(); // 2018-09-05: inspect the Psy concept flag-panel if (anset==0) { // 2018-09-05: if no vowel at start of noun... if (psi1 == 101) { // 2018-09-05: if 101=A is found; aud = psi20; // 2019-07-31: "A" recall-vector for Speech() break; // 2018-09-05: one auditory engram is enough. } // 2018-09-05: End of search for 101=A } // 2018-09-05: end of test for vowel-flag "anset". if (anset > 0) { // 2018-09-05: if vowel at start of noun... if (psi1 == 102) { // 2018-09-05: if 102=AN is found; aud = psi20; // 2019-07-31: "AN" recall-vector for Speech() anset = 0; // 2018-09-05: reset to zero for safety. break; // 2018-09-05: one auditory engram is enough. } // 2018-09-05: End of search for 102=AN; } // 2018-09-05: end of test for positive vowel-flag "anset". } // 2018-09-05: end of loop searching for "A" or "AN". Speech(); // 2018-09-05: speak the word starting at the "aud" time. } // 2018-09-05: end of test of grammatical number of noun. } // 2019-07-31: EnArticle(); return to EnNounPhrase(). function EnAdverb() { // http://ai.neocities.org/EnAdverb.html // 2019-03-03: stub only; needs full implementation. } // 2019-03-03: EnAdverb() returns to EnVerbPhrase(); function EnAdjective() { // http://ai.neocities.org/EnAdjective.html if (tdj > 0) { // 2019-10-12: positive time-of-adjective? Psy[tdj].psyExam(); // 2019-10-12: inspect flag-panel of adjective. if (psi20 > 0) aud = psi20; Speech(); // 2019-10-12: speak the preposition. if (psi20 > 0) aud = 0; // 2019-10-12: reset to prevent carry-over. if (psi20 > 0) audjuste = 0; // 2019-10-12: reset to prevent carry-over. tdj = 0; // 2019-10-12: reset to prevent unwarranted call to EnAdjective() etc = 0; // 2019-10-12: suppress use of a conjunction. } // 2019-10-12: end of test for a positive time-of-adjective "tdj". } // 2019-10-12: EnAdjective() returns to EnNounPhrase(); function SpreadAct() { // http://ai.neocities.org/SpreadAct.html PsiDecay(); // 2018-01-23: reduce conceptual activation in general. // 2018-11-13: SpreadAct, called from EnVerbPhrase, activates a prepositional phrase. if (wherecon == 0) { // 2018-11-13: if not answering a where-query... if (tselp > 0 && prep > 0 && wherecon == 0) { // 2018-11-13: fpr prep. phrase Psy[tselp].psyExam(); // 2018-11-13: Examine the Psy concept-array. tselo = psi14; // 2019-07-31: time of selection of object of preposition. aud = psi20; // 2019-07-31: fetch the "aud" recall-tag for sake of Speech() if (aud > 0) Speech(); // 20-18-11-13: speak the preposition. // EnArticle(); // 2018-11-13: say "A" or "THE" before object of preposition. // EnArticle(); // 2019-09-21: commenting out for the sake of troubleshooting. Psy[tselo].psyExam(); // 2018-11-13: examine concept-array at time of object. aud = psi20; // 2019-07-31: fetch the "aud" tag for the sake of Speech() if (aud > 0) Speech(); // 2018-11-13: speak the object of the preposition. aud = 0; // 2018-11-13: reset for safety. prep = 0; // 2018-11-13: reset for safety. tselo = 0; // 2018-11-13: reset for safety. tselp = 0; // 2018-11-13: reset for safety. } // 2018-11-13: end of test for time-point and concept-number of preposition. } // 2018-11-13: end of test for a positive "wherecon". // 2018-10-28: segment of SpreaAct() responds to where-queries. if (wherecon==1) { // 2018-10-28: if (qv1psi > 0) { // 2018-10-28: if there is an activand subject... for (i=tpu; i>midway; i--) { // 2018-10-28: search backwards in time. Psy[i].psyExam(); // 2018-01-23: examine the Psy concept array... if (psi1 == qv1psi && psi14 > 0) { // 2019-07-31: require verblock. if (psi1 == qv1psi && psi11 == qv2psi) { // 2019-07-31: if correct verb psi3 = (psi3 + 256); // 2018-10-28: impose an overriding activation. Psy[i] = new // 2018-10-28: inserting [psi3]act with higher activation: psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel } // 2018-10-28: end of test for finding both subject and verb of query. } // 2018-10-28: end of test for presence of a psi13 tkb verblock. } // 2018-10-28: end of (for loop) searching for qv1psi subject concept. } // 2018-10-28: end of test for a positive qv1psi. return; // 2018-10-28: skip the remainder of SpreadAct() } // 2018-10-28: end of test for a positive "wherecon". // 2018-10-02: segment of SpreaAct() responds to WHO-queries. if (qucon > 0 && qvdocon == 0) { // 2018-01-23: only for 800=BE who-queries. if (qv1psi > 0) { // 2018-01-28: if there is an activand subject... for (i=tpu; i>midway; i--) { // 2018-01-23: search backwards in time. Psy[i].psyExam(); // 2018-01-23: examine the Psy concept array... if (psi1 == qv1psi && psi14 > 0) { // 2019-07-31: require verblock. if (psi1 == qv1psi && psi11 == qv2psi) { // 2019-07-31: if correct verb psi3 = (psi3 + 64); // 2018-01-23: impose an overriding activation. Psy[i] = new // 2018-01-23: inserting [psi3]act with higher activation: psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: flag-panel } // 2018-01-23: end of test for finding both subject and verb of query. } // 2018-01-23: end of test for presence of a psi13 tkb verblock. } // 2018-01-23: end of (for loop) searching for qv1psi subject concept. } // 2018-01-23: end of test for a positive qv1psi. qvdocon = 0; // 2018-06-16: TEST return; // 2018-06-05: skip the remainder of SpreadAct() } // 2018-01-23: end of test of qucon to indicate processing of a query. // 2018-10-02: segment of SpreaAct() responds to WHAT-think-queries. if (whatcon > 0 && qv2psi==886) { // 2018-11-28: for a what-think query... // alert("SpreadAct: qv2psi= "+qv2psi); // 2018-10-01: TEST } // 2018-10-01: end of test of whatcon so as to answer a what-think query. // 2018-10-02: segment of SpreaAct() responds to WHAT-queries if (whatcon > 0) { // 2018-10-01: for a what-query... dunnocon = 1; // 2018-10-01: set positive so long as no answer emerges. for (i=tpu; i>midway; i--) { // 2018-10-02: search backwards in time. Psy[i].psyExam(); // 2018-10-02: examine conceptual Psy array; if (psi1==qv1psi && psi11==qv2psi) { // 2019-07-31: subj. with query-verb? dunnocon = 0; // 2018-02-10: even one correct answer disables dunnocon. psi3 = (psi3 + 64); // 2018-10-02: impose activation on the found subject. Psy[i] = new // 2018-10-02: inserting [psi3]act with higher activation: psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded panel. } // 2018-10-02: end of test for subject and verb answer-concepts. } // 2018-10-02: end of (for loop) searching for qv1psi subject-noun concept. catsubj = qv1psi; // 2019-02-12: chain-subject to be omitted for sake of "AND" catverb = qv2psi; // 2019-02-12: chain-verb to be omitted for sake of "AND". return; // 2018-10-02: skip the remainder of SpreadAct() } // 2018-10-01: end of test of whatcon so as to answer a what-query. if (whatcon > 0) { // 2018-01-23: for a what-query... for (i=tpu; i>midway; i--) { // 2018-01-23: search backwards in time. if (psi1==qv1psi && psi14==0 && qv2psi==886) { // 2019-07-31: if subj of THINK query psi3 = (psi3 + 64); // 2018-06-11: impose activation on the found subject. Psy[i] = new // 2018-05-13: inserting [psi3]act with higher activation: psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel } // 2018-06-03: end of test for WHAT... 886=THINK. if (psi1==886 && qv2psi==886) { // 2018-11-28: if 886=THINK query... psi3 = (psi3 + 64); // 2018-06-11: impose activation on the found verb. Psy[i] = new // 2018-05-13: inserting [psi3]act with higher activation: psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel. } // 2018-11-28: end of test for WHAT... 886=THINK. } // 2018-01-23: end of (for loop) searching for qv1psi subject-noun concept. for (i = idle; i<1000; i++) { // 2018-01-23: delay for user to see question if (i > 1) { apb = "Ask the AI what it thinks!"; Voice() } // 2018-05-13 } // 2018-01-23: end of delay for TEST return; // 2018-06-05: skip the remainder of SpreadAct() } // 2018-01-23: end of test of whatcon so as to answer a what-query. if (qvdocon > 0) { // 2018-01-23: for a who+verb+dir.object query... dunnocon = 1; // 2018-01-23: set positive so long as no answer emerges. for (i=tpu; i>midway; i--) { // 2018-01-23: search backwards in time. Psy[i].psyExam(); // 2018-01-23: inspect the Psy concept flag-panel if (psi1==qv2psi) { // 2018-12-23: if query-verb is found... if (psi10 > 0) { // 2018-12-23: if positive "pre" exists... if (psi11==qv4psi) { // 2019-07-31: if "seq" is direct object... if (psi14>0) { // 2019-07-31: if positive "tkb" for direct object... qv2num = psi8; // 2018-01-23: latch onto psi8 "num" of the response-verb. qv1psi = psi10; // 2018-01-23: latch onto psi10 "pre" as the subject (answer) psi3 = (psi3 + 64); // 2018-06-11: somewhat activate the answer-concept Psy[i] = new // 2018-01-23: inserting [psi3]act with higher activation: psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: flag-panel } // 2018-12-23: end of test for specific time-point of direct object. } // 2018-12-23: end of test for presence of direct-object "seq". } // 2018-12-23: end of test for postive "pre" or subject of query-verb. } // 2018-12-23: end of test for query-verb qv2psi. } // 2018-01-23: end of (for loop) searching for qv2psi verb concept. qucon = 0; // 2018-01-23: prevent infinite loop? for (i=tpu; i>midway; i--) { // 2018-01-23: search backwards in time. Psy[i].psyExam(); // 2018-01-23: inspect the Psy concept flag-panel if (psi1==qv1psi) { // 2018-12-23: if subject is found... if (psi11==qv2psi) { // 2019-07-31: if "seq" is the query-verb... psi3 = (psi3 + 320); // 2018-12-23: impose an overriding activation. psi3 = (psi0 + psi3); // 2018-12-23: favor any engram with high "tru" value. Psy[i] = new // 2018-01-23: inserting [psi3]act with higher activation: psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded panel. dunnocon = 0; // 2018-12-23: even one correct answer disables "dunnocon". } // 2018-12-23: end of test for query-verb as "seq" of the query-subject. } // 2018-01-23: end of test for subject answer-concept } // 2018-01-23: end of (for loop) searching for the subject answer-concept. qvdocon = 0; // 2018-06-16: reset for safety. return; // 2018-06-05: skip the remainder of SpreadAct() } // 2018-01-23: end of test for who+verb+direct-object query condition. if (qviocon > 0) { // 2018-01-23: prepare for indirect-object queries... // alert("SpreadAct has been called."); // 2018-01-23: for future implementation } // 2018-01-23: end of test for who+verb+indirect-object query condition. if (nucon > 0) { // 2018-01-23: if there is a new-concept condition... moot = 1; // 2018-01-23: prevent associative tags within question. output = ""; // 2018-01-23: clear the display of output. for (i=tpu; i>midway; i--) { // 2018-01-23: search backwards in time. Psy[i].psyExam(); // 2018-01-23: inspect the Psy concept flag-panel if (psi1 == 781 && psi14 == 0) { // 2019-07-31: WHAT without verblock. aud = psi20; // 2019-07-31: fetch auditory recall tag for Speech() Speech(); // 2018-01-23: speak the 781=WHAT break; // 2018-01-23: one utterance is enough. } // 2018-01-23: end of test for 781=WHAT with no overriding verblock. } // 2018-01-23: end of (for loop) searching for 781=WHAT concept. if (b1 == "S") qusubnum = 2; // 2019-07-31: if terminal "-S" in OutBuffer for (i=vault; i>midway; i--) { // 2018-01-23: search backwards in "vault" Psy[i].psyExam(); // 2018-01-23: inspect the Psy concept flag-panel if (qusubnum == 0) qusubnum = 1; // 2018-10-03: default to singular. if (psi1==800 && psi7==3 && psi8==qusubnum) { // 2018-10-03 aud = psi20; // 2019-07-31: fetch auditory recall tag for Speech() Speech(); // 2018-01-23: speak the 800=BE break; // 2018-01-23: one utterance is enough. } // 2018-01-23: end of test for 800=BE } // 2018-01-23: end of (for loop) searching for correct form of 800=BE. for (i=t; i>midway; i--) { // 2018-10-03: must include new input. Psy[i].psyExam(); // 2018-01-23: inspect the Psy concept flag-panel if (psi1 == qusub) { // 2018-01-23: look for the new concept. aud = psi20; // 2019-07-31: fetch auditory recall tag for Speech() Speech(); // 2018-01-23: speak the new concept qusub = 0; // 2018-06-11: reset for safety. break; // 2018-01-23: one utterance is enough. } // 2018-01-23: end of test for engram of new concept. } // 2018-01-23: end of (for loop) searching for the new concept. Voice(); // 2018-09-21: makes the question appear on-screen. moot = 0; // 2018-01-23: finish preventing associative tags within question. return; // 2018-06-05: skip the remainder of SpreadAct() } // 2018-01-23: end of test of nucon so as to cause asking of a question. if (actpsi > 0 && qucon == 0) { // 2018-01-12: not with who-queries for (i=tpu; i>midway; --i) { // 2018-01-12: search backward from tpu Psy[i].psyExam(); // 2018-01-12: examine the Psy concept array... if (psi1 == actpsi && psi11 > 0) seqpsi = psi11; // 2019-07-131: if seq, seqpsi if (psi1 == actpsi && psi14 > 0) { // 2019-07-31: require verblock. apb = "SpreadAct spreads activation from concept #"+psi1+" to a related idea."; Voice(); // 2018-12-05: Show the user what SpreadAct() is doing. psi3 = (psi3 + 256); // 2018-12-06: impose even higher activation. Psy[i] = new // 2018-06-11: moving "new" up from next line: psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel } // 2018-01-12: end of test requiring tkb verblock. } // 2018-01-12: end of (for loop) searching for actpsi concept. } // 2018-01-12: end of test for a positive actpsi. qvdocon = 0; // 2018-06-16: reset for safety. } // 2019-07-31: SpreadAct() returns to EnVerbPhrase() or EnThink(). function EnPrep() { // http://ai.neocities.org/EnPrep.html if (tpr > 0) { // 2019-08-04: positive time-of-preposition? Psy[tpr].psyExam(); // 2019-08-04: inspect the Psy concept flag-panel if (psi14>0) tkb=psi14; // alert(" tkb= "+tkb);; // 2019-08-04 if (psi20 > 0) aud = psi20; Speech(); // 2019-08-04: speak the preposition. if (psi20 > 0) aud = 0; // 2019-09-20: reset to prevent carry-over. if (psi20 > 0) audjuste = 0; // 2019-09-20: reset to prevent carry-over. if (psi14>0) tkb=psi14; // 2019-08-04 tpr = 0; // 2019-09-22: reset to prevent unwarranted call to EnPrep() etc = 0; // 2019-09-22: suppress use of a conjunction. // return; // 2019-09-20: abandon rest of module. } // 2019-08-04: end of test for positive time-ofpreposition. if (tvpr > 0) { // 2019-10-24: positive time-of-verb-preposition? Psy[tvpr].psyExam(); // 2019-10-24: inspect the Psy concept flag-panel if (psi14>0) tkb=psi14; // 2019-10-24: intercept "tkb" for obj. of preposition if (psi20 > 0) aud = psi20; Speech(); // 2019-10-24: speak the preposition. tvpr = 0; // 2019-10-24: prevent carry-over. } // 2019-10-24: end of test for preposition linked to verb-phrase EnArticle(); // 2019-10-24: say "A" or "THE" before object of preposition. if (px1>0) { // 2019-09-20: object of preposition? Psy[px1].psyExam(); // 2019-09-20: inspect @psy knowledge-nodes. if (psi20 > 0) aud = psi20; // 2019-09-20: obtain recall-vector. if (aud > 0) Speech(); // 2019-09-20: speak the object of the preposition. return; // 2019-09-20: abandon rest of module. } // 2019-09-20: end of test for "px1" object of preposition. px1 = 0; // 2019-09-20: reset for safety. if (prep > 0 && aud > 0) Speech(); // 2019-09-21: reinstating if (tkb>0) { // 2019-10-24: object of preposition? Psy[tkb].psyExam(); // 2019-10-24: inspect @psy knowledge-nodes. if (psi20 > 0) aud = psi20; // 2019-10-24: obtain recall-vector. if (aud > 0) Speech(); // 2019-10-24: speak the object of the preposition. // return; // 2019-10-24: abandon rest of module. } // 2019-10-24: end of test for "px1" object of preposition. objprep = 0; // 2019-09-22: reset to prevent carry-over. prep = 0; // 2019-09-20: reset to avoid carry-over. prepgen = 0; // 2018-10-26: reset to avoid carry-over. tselo = 0; // 2019-09-22: reset to avoid carry-over. tselp = 0; // 2019-09-20: reset to avoid carry-over. wherecon = 0; // 2018-10-28: reset to avoid carry-over. } // 2019-09-22: EnPrep(); return to EnNounPhrase() or EnVerbPhrase(); function EnPronoun() { // http://ai.neocities.org/EnPronoun.html } // 2019-02-18: EnPronoun() returns to EnNounPhrase(); function EnAuxVerb() { // http://ai.neocities.org/EnAuxverb.html if (subjnum==0 && snu>0) subjnum = snu; // 2019-10-25: insurance if (subjnum==0 && prsn==3) subjnum = 1; // 2019-10-25: a guess. if (subjnum==0 && prsn != 3) subjnum = 1; // 2019-10-25: "DO"-form tdo = 0; // 2018-07-12: prevent carry-over. if (auxverb==818) { // 2018-11-28: 818=DO; if (subjnum == 1 && prsn == 1) { // 2018-01-26: first person singular? for (i = vault; i>midway; i--) { // 2018-01-26: "vault" is reliable. Psy[i].psyExam(); // 2018-01-26: examine conceptual Psy array; if (psi1==818 && psi8==1 && psi7==1) { // 2018-11-28: 818=DO; aud = psi20; // 2019-07-31: auditory recall-vector; break; // 2018-01-26: one example is enough. } // 2018-01-26: end of test for singular #818=DO; } // 2018-01-26: end of backwards loop; Speech(); // 2018-01-26: } // 2018-01-26: end of test for 1st person singular; if (subjnum == 1 && prsn == 2) { // 2018-01-26: second person singular? for (i = vault; i>midway; i--) { // 2018-01-26: "vault" is reliable. Psy[i].psyExam(); // 2018-01-26: examine conceptual Psy array; if (psi1==818 && psi8==1 && psi7==2) { // 2018-11-28: 818=DO; aud = psi20; // 2019-07-31: auditory recall-vector; break; // 2018-01-26: } // 2018-11-28: end of test for singul;ar 818=DO; } // 2018-01-26: end of backwards loop; Speech(); // 2018-01-26: } // 2018-01-26: end of test for 2nd person singular; if (subjnum == 1 && prsn == 3) { // 2018-01-26: singular num(ber)? for (i = vault; i>midway; i--) { // 2018-01-26: "vault" is reliable. Psy[i].psyExam(); // 2018-01-26: examine conceptual Psy array; if (psi1==818 && psi8==1 && psi7==3) { // 2018-11-28: 818=DO; aud = psi20; // 2019-07-31: auditory recall-vector; break; // 2018-01-26: } // 2018-11-28: end of test for 818=DOES; } // 2018-01-26: end of backwards loop; Speech(); // 2018-01-26 } // 2018-01-26: end of test for 3rd person singular; if (subjnum == 2 && prsn == 1) { // 2018-01-26: plural num(ber)? for (i = vault; i>midway; i--) { // 2018-01-26: "vault" is reliable. Psy[i].psyExam(); // 2018-01-26: examine conceptual Psy array; if (psi1==818 && psi8==2 && psi7==1) { // 2018-11-28: 818=DO; aud = psi20; // 2019-07-31: auditory recall-vector; break; // 2018-01-26: } // 2018-11-28: end of test for plural 818=DO; } // 2018-01-26: end of backwards loop; Speech(); // 2018-01-26: } // 2018-01-26: end of test for 1st person plural; if (subjnum == 2 && prsn == 2) { // 2018-01-26: plural num(ber)? for (i = vault; i>midway; i--) { // 2018-01-26: "vault" is reliable. Psy[i].psyExam(); // 2018-01-26: examine conceptual Psy array; if (psi==818 && psi8==2 && psi7==2) { // 2018-11-28: 818=DO; aud = psi20; // 2019-07-31: auditory recall-vector; break; // 2018-01-26: } // 2018-11-28: end of test for plural 818=DO; } // 2018-01-26: end of backwards loop; Speech(); // 2018-01-26: } // 2018-01-26: end of test for 2nd person plural; if (subjnum == 2 && prsn == 3) { // 2018-01-26: plural num(ber)? for (i = vault; i>midway; i--) { // 2018-01-26: "vault" is reliable. Psy[i].psyExam(); // 2018-01-26: examine conceptual Psy array; if (psi1==818 && psi8==2 && psi7==3) { // 2018-11-28: 818=DO; aud = psi20; // 2019-07-31: auditory recall-vector; break; // 2018-01-26: } // 2018-11-28: end of test for plural 818=DO; } // 2018-01-26: end of backwards loop; Speech(); // 2018-01-26: } // 2018-01-26: end of test for 3rd person plural; } // 2018-11-28: end of test for 818=DO auxiliary verb; // prsn = 0; // after auxiliary prevent verb-inflection; 17jun2015 // verbprsn = 0; // after auxiliary use infinitive verb-form; 17jun2015 infincon = 1; // 2018-01-26: after auxiliary set infinitive condition; } // 2019-07-31: EnAuxVerb(); return to EnVerbPhrase() or AskUser(). function AskUser() { // http://ai.neocities.org/AskUser.html output = ""; // 2018-01-27: blank out previous output before question; pov = 1; // 2018-01-25: 1=internal; 2=external; if (yncon==1) { // 2019-03-03: separate inference-validation from other questions. tdo = 0; // 2018-07-12: prevent carry-over. quobjaud = 0; // 2018-01-26: safety measure; if (posflag==7 || posflag==5) { // 2018-01-26: noun or pronoun; } // 2018-01-26: end of test of posflag; if (ynverb == 0) { // 2018-01-26: ask y/n question only once; ynverb = quverb; // 2018-01-26: isolate at start; moot = 1; // 2018-01-26: prevent storing of "tkb" and "seq"; auxverb = 818; // 2018-11-28: 818=DO as auxiliary verb; prsn = 3; // 2018-10-03: assumption based on Is-A status. EnAuxVerb(); // 2018-11-28: Say 818=DO or DOES; auxverb = 0; // 2018-01-26: reset for safety; moot = 0; // 2018-01-26: reset after use; for (i = inft; i>midway; i--) { // 2018-01-26: skip silent inference; Psy[i].psyExam(); // 2018-01-25: examine conceptual Psy array; if (psi1 == qusub) { // 2018-01-25: if query-subject found; aud = psi20; // 2019-07-31: assign auditory recall-tag; break; // 2018-01-25: exit the loop after first find; } // 2018-01-26: end of test for query-subject; } // 2018-01-26: end of loop in search of qusub; Speech(); // 2018-01-25: say subject-word starting at "aud" value; if (quverb == 0) quverb = 818; // 2018-11-28: 818=DO default; for (i = inft; i>midway; i--) { // 2018-01-25: skip silent inference; Psy[i].psyExam(); // 2018-01-25: examine Psy conceptual array; if (psi1 == quverb && psi7==0) { // 2018-10-04: infinitive dba=0 aud = psi20; // 2019-07-31: assign most recent recall-tag; break; // 2018-01-25: exit the loop after first find; } // 2018-01-25: end of test for quverb; } // 2018-01-25: end of loop in search of yes-or-no ("yn") quverb; verbprsn = 0; // 2018-01-25: Store the verb as an infinitive form; audnum = 0; // 2018-01-25: infinitive without num(ber); holdnum = 0; // 2018-01-25: infinitive without num(ber); infincon = 1; // 2018-01-25: set flag to positive one; nphrnum = 0; // 2018-01-25: for no influence on infinitive; numsubj = 0; // 2018-01-25: for no influence on infinitive; putnum = 0; // 2018-01-25: for insisting on zero num infinitive; Speech(); // 2018-01-25: speak the verb starting at "aud" value; if (quobj == 0) quobj = 711; // 2018-01-25: 711=ANYTHING default; for (i = inft; i>midway; i--) { // 2018-01-25: skip silent inference; Psy[i].psyExam(); // 2018-01-25: examine Psy conceptual array; if (psi1 == quobj) { // 2018-01-25: if query-object found; if (psi7==4) { // 2018-01-25: dba=4 accusative? quobjaud = psi20; // 2019-07-31: hold thru EnArticle(); // EnArticle(); // from German AI; insert "A" or "THE"? 20mar2013// // EnArticle(); // 2019-09-22: commenting out during troubleshooting. aud = quobjaud; // 2018-01-25: restore after EnArticle; break; // 2018-01-25: exit the loop after first grammatical find; } // 2018-01-25: end of test for accusative dba=4; } // 2018-01-25: end of test for quobj; } // 2018-01-25: end of loop in search of quobj; dirobj = 1; // 2018-01-25: So OldConcept will set "dba" = 4 (accusative) Speech(); // 2018-01-25: say object word starting at "aud" value; dirobj = 0; // 2018-01-25: Reset for safety after asking question; yncon = 0; // 2018-01-25: because question has been asked; kbcon = 1; // 2018-01-25: because waiting for answer; ynverb = 0; // 2018-01-25: zero out; prevent repeat of query; } // 2018-01-25: end of test of ynverb; if (subjpsi==701) prsn=1; // 2018-01-25: 1st person "I"; if (subjpsi==731) prsn=1; // 2018-01-25: 1st person "WE"; if (subjpsi==707) prsn=2; // 2018-01-25: 2nd person YOU; if (subjpsi==713) prsn=3; // 2018-01-25: 3rd person HE; if (subjpsi==719) prsn=3; // 2018-01-25: 3rd person SHE; if (subjpsi==725) prsn=3; // 2018-01-25: 3rd person IT; if (subjpsi==743) prsn=3; // 2018-01-25: 3rd person THEY; numsubj = 0; // 2018-01-25: reset for safety; qusnum = 0; // 2018-01-25: reset for safety; qusub = 0; // 2018-06-11: reset for safety; recon = 0; // 2018-01-25: bias = 5; // 2018-01-25: restore expectation of a noun; for (i = idle; i<1000; i++) { // 2018-01-27: delay for user to see question? if (i > 1) { apb = "Pausing briefly for your answer..."; Voice() } // 2018-01-27 } // 2018-01-27: end of delay } // 2019-03-03: end of test to separate inference-questions. if (whoq == 1) { // 2019-03-03: test of flag for asking a who-question. moot = 1; // 2019-03-03: prevent storage of unwarranted associative tags. for (i = vault; i>0; i--) { // 2018-01-25: use solid data in "vault" area. Psy[i].psyExam(); // 2019-03-03: examine Psy conceptual array; if (psi1 == 791) { // 2019-03-03: if 791=WHO is found... if (psi7 == 1) { // 2019-03-03: if dba=1 for nominative pronoun... aud = psi20; // 2019-07-31: assign auditory recall-tag; break; // 2019-03-03: exit the loop after first find; } // 2019-03-03: end of test for nominative form. } // 2019-03-03: end of test for 791=WHO interrogative pronoun. } // 2019-03-03: end of loop in search of interrogative pronoun. Speech(); // 2019-03-03: say pronoun starting at "aud" value in memory. for (i = vault; i>0; i--) { // 2018-01-25: use solid data in "vault" area. Psy[i].psyExam(); // 2019-03-03: examine Psy conceptual array; if (psi1 == 800) { // 2019-03-03: if 800=BE is found... if (psi7 == 2) { // 2019-03-03: if dba=2 for second person... if (psi8 == 1) { // 2019-03-03: if num=1 for singular number... aud = psi20; // 2019-07-31: assign auditory recall-tag; break; // 2019-03-03: exit the loop after first find; } // 2019-03-03: end of test for singular number. } // 2019-03-03: end of test for second-person verb-form. } // 2019-03-03: end of test for 800=BE query-verb } // 2019-03-03: end of loop in search of query-verb for question Speech(); // 2019-03-03: say verb starting at "aud" value in memory. for (i = vault; i>0; i--) { // 2018-01-25: use solid data in "vault" area. Psy[i].psyExam(); // 2019-03-03: examine Psy conceptual array; if (psi1 == 707) { // 2019-03-03: if 707=YOU is found... if (psi7 == 1) { // 2019-03-03: if dba=1 for nominative subject... aud = psi20; // 2019-07-31: assign auditory recall-tag; break; // 2019-03-03: exit the loop after first find; } // 2019-03-03: end of test for nominative form. } // 2019-03-03: end of test for 707=YOU personal pronoun. } // 2019-03-03: end of loop in search of pronoun for subject of question. Speech(); // 2019-03-03: say subject-word starting at "aud" value in memory. moot = 0; // 2019-03-03: reset after use. whoq = 0; // 2019-03-03: } // 2019-03-03: after using, reset to zero. } // 2019-07-31: AskUser() returns to EnThink() or Volition() function EnNounPhrase() { // http://ai.neocities.org/EnNounPhrase.html act = 0; // 2018-01-12: so comparisons may be higher. audjuste = 0; // 2018-01-12: prevent carry-over defact = -64; // 2018-01-12: for default comparisons with "701=I"; motjuste = 0; // 2018-01-12: nphrnum = 0; // 2018-09-05: prevent carry-over of previous value. nphrpos = 5; // 2018-01-12: a default setting of noun for EnArticle(). subjpsi = 0; // 2018-01-12: how can there already be a subject-psi? TEST tsels = 0; // 2018-01-12: time of selection of subject if (whatcon > 0) verblock = 0; // 2018-06-03: if answering what-query... if (wherecon > 0) verblock = 0; // 2018-10-28: if answering where-query... if (verblock > 0) { // 2018-01-12: positive verblock? Psy[verblock].psyExam(); // 2018-01-12: expose all values during search. nounlock = psi14; // 2019-07-31: time-point of "tkb" engram; subjnum = psi8; // 2018-01-11: from number of verb; } // 2018-01-12: end of test for a positive verblock if (nounlock > 0) { // 2018-01-12: already a nounlock? dirobj = 1; // 2018-01-12: nounlock is specifically for a direct object. subjectflag = 0; // 2018--1-12: needed for conditional tests; Psy[nounlock].psyExam(); // 2018-01-12: inspect t=nounlock row; motjuste = psi1; // 2018-01-12: in case a search is needed for non-zero rv nphrnum = psi8; // 2018-09-05: for sake of EnArticle() etc. if (psi17 > 0) tdj = psi17; // 2019-10-12: time-of-adjective if (psi19 > 0) tpr = psi19; // 2019-09-20: time-of-preposition? if (quiet == true) actpsi = psi1; // 2018-06-11: so EnVerbPhrase() calls SpreadAct() nphrpos = psi6; // 2018-05-26: find part-of-speech for EnArticle if (psi6==5) objnum = psi8; // 2018-06-16: use only for 5=noun. if (psi7 == 4) { // 2018-01-12: if dba is acc. case as for any nounlock; if (psi20 > 0) { // 2019-07-31: if there is a positive recall-vector... nphrpos = psi6; // 2018-01-12: find part-of-speech for EnArticle nphrnum = psi8; // 2018-09-05: noun-phrase num(ber) for EnArticle() aud = psi20; // 2019-07-31: find positive rv; } else { // 2019-07-31: if only a zero "rv" is found... for (i = tpu; i>midway; --i) { // 2018-01-12: search backwards Psy[i].psyExam(); // 2018-01-12: inspect each time-point "i" if (motjuste == psi1) { // 2018-01-12: find motjuste for sake of rv if (subjectflag == 1 && psi7 == 1) { // 2018-01-12: dba subject? if (psi20 > 0) aud = psi20; // 2019-07-31: find positive rv; break; // 2018-01-14: exit loop after first find; } // 2018-01-12: end of test for subject } // 2018-01-12: end of test for same concept as motjuste if (dirobj == 1 && psi7 == 4) { // 2018-01-12: dba direct object? if (psi20 > 0) nphrpos = psi6; // 2019-07-31: for EnArticle. if (psi20 > 0) nphrnum = psi8; // 2019-07-31: for EnArticle. if (psi20 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-01-12: end of test for direct object and accusative case. if (psi20 > 0) nphrpos = psi6; // 2019-07-31: for EnArticle. if (psi20 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-01-12: end of for-loop in search of a positive recall-vector. } // 2018-01-12: end of else-clause for typically a pronominal rv. } // 2018-01-12: end of dba-test for accusative nounlock. } // 2018-01-12: end of test for a positive nounlock; if (tpr > 0) { // 2019-09-20: if noun links to a preposition... Psy[tpr].psyExam(); // 2019-09-20: inspect psy-array knowledge-nodes. if (psi14 > 0) px1 = psi14; // 2019-09-22: intercept "px1" for obj of prep. } // 2019-09-20: end of test for a jump-off point to a preposition. if (nounlock == 0) { // 2016apr16: if nouns are free to compete... subjectflag = 1; // 2018-01-12: a default until countermanded. dba = 1; // 2018-01-12: default nominative until countermanded. if (dirobj == 1) subjectflag = 0; // 2018-01-12: countermanding default for (i = t; i>midway; --i) { // 2018-01-12: include input for topical response Psy[i].psyExam(); // 2018-01-12: inspect each time-point "i" if (psi6==5 || psi6==7) { // 2018-01-12: select "pos" noun or pronoun if (whatcon==1 && psi1==qv1psi && psi20>0 && qv2psi==886) { // 2019-07-31: WHAT...THINK? svo1 = psi1; // 2018-05-13: keep track of subject. tsels = i; // 2018-05-13: use time-point of subj-selection for inhibition. subjnum = psi8; // 2018-10-03: for sake of EnAuxVerb() aud = psi20; // 2019-07-31: temporary recall-vector for Speech Psy[i] = new psyNode(psi0,psi1,psi2,256,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel break; // 2018-05-13: abandon search. } // 2018-05-13: end of test for WHAT...THINK query. if (psi14 > 0 ) { // 2019-07-31: retrieve ideas, not single words. if (psi3 > act) { // 2018-01-12: psi3 activation as criterion. etc++; // 2019-02-18: implement number of active ideas for ConJoin() motjuste = psi1; // 2018-01-12: Select the most active concept. svo1 = psi1; // 2018-01-12: keep track of subject. mjact = psi3; // 2018-01-12: if too low, motjuste defaults to "I" posflag = psi5; // 2018-01-27: AskUser discriminand; if (psi8 > 0) snu = psi8; // 2018-10-10: for sake of EnVerbGen() subjnum = psi8; // 2018-10-03: for sake of EnAuxVerb() if (psi3 > act && psi11 > 0) { // 2019-07-31: if psi1 has psi11-seq verblock = psi14; // 2019-07-31: assign tkb value to verblock. if (psi8 > 0) snu = psi8; // 2018-10-10: for sake of EnVerbGen() subjnum = psi8; // 2018-01-27: for AuxVerb DOES or DO; } // 2018-01-12: end of test for a psi1-subject with a psi12-seq. if (psi3 > act && psi14 > 0) { // 2019-07-31: if psi1 has psi14-tkb verblock = psi14; // 2019-07-131: assign tkb value to verblock. if (psi8 > 0) snu = psi8; // 2018-10-10: for sake of EnVerbGen() subjnum = psi8; // 2018-01-27: for AuxVerb DOES or DO; } // 2018-01-12: end of test for a psi1-subject with a psi13-tkb. if (dirobj == 1) actpsi = psi1; // 2018-01-12: subjpsi = motjuste; // 2018-01-12: for selection of verb-form. nphrnum = psi8; // 2018-09-05: NounPhrase number for EnArticle() etc. snu = psi8; // 2018-01-12: subject-number for verb-selection; if (psi20 > 0 && numreq==0) { // 2019-07-31: if positive recall-vector... nphrpos = psi6; // 2018-01-12: for sake of EnArticle. aud = psi20; // 2019-07-31: temporary recall-vector for Speech } // 2018-01-12: end of test for auditory-engram recall-vector. if (psi20 > 0 && numreq > 0 && psi8==numreq) { // 2019-07-31 nphrpos = psi6; // 2018-05-25: for sake of EnArticle. aud = psi20; // 2019-07-31: temporary recall-vector for Speech } // 2018-05-25: end of test for auditory-engram recall-vector. tseln = i; // 2018-01-12: use time-point for inhibition. tsels = i; // 2018-01-12: use time-point for inhibition. act = psi3; // 2018-01-12: noun must have higher "act" to win } // 2018-01-12: end of test for a higher activation "act" } // 2018-01-12: end of test for a psi13 "tkb" verblock. } // 2018-01-12: end of test for noun or pronoun as subject } // 2018-01-12: End of (for loop) searching for most active "motjuste" } // 2018-01-12: end of test for absence of a nounlock. if (whatcon > 0) { // 2019-02-12: if SpreadAct() answers a what-query... if (catsubj == motjuste && conj > 0) { // 2019-02-12: after a conjunction... return; // 2019-02-12: omit the subject-noun after the use of a conjunction. } // 2019-02-12: end of test for a subject matching a query-subject. } // 2019-02-12: end of test for SpreadAct() answering a what-query. Psy[tsels].psyExam(); // 2018-05-28: inspect subject to be inhibited. snu = psi8; // 2018-10-10: for sake of EnVerbGen() psi3 = (psi3 - 90); // 2018-05-13: make activation relative, not absolute. Psy[tsels] = new psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 20p19-07-31: expanded flag-panel if (subjectflag == 0) { // 2018-01-12: i.e., dir.obj or pred.nom; if (nounlock > 0) { // 2018-01-12: if verb is locked to a particular seq... Psy[nounlock].psyExam(); // 2018-01-12: inspect t=nounlock row; motjuste = psi1; // 2018-01-12: nounlock psi pre-empts search. if (psi6 == 5) { // 2018-01-12: if nounlock part of speech is 5=noun nphrpos = 5; // 2018-01-12: for sake of EnArticle. qv1psi = psi1; // 2018-01-12: let direct object go to SpreadAct. nphrnum = psi8; // 2018-12-16: for sake of EnArticle() } // 2018-01-12: end of test for only a noun to go into SpreadAct. aud = psi20; // 2019-07-31: recall-vector to auditory engram. } // 2018-01-12: end of test for a positive nounlock. if (aud == 0) { // 2018-05-28: for instance, switching ME and YOU for (i = tpu; i>midway; --i) { // 2018-05-28: search backwards from tpu Psy[i].psyExam(); // 2018-05-28: inspect Psy flag-panel if (motjuste == psi1) { // 2018-01-12: find motjuste for sake of rv if (subjectflag == 1 && psi7 == 1) { // 2018-01-12: subject? if (psi20 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-01-12: end of test for subject and for nominative case. if (dirobj == 1 && psi7 == 4) { // 2018-05-28: direct object? if (psi1 > 0) qv4psi = psi1; // 2018-05-28: for inserting "AN". if (psi1 > 0) nphrpos = psi6; // 2018-05-28: set POS for EnArticle. if (psi1 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-05-28: end of test for direct object and accusative case. } // 2018-06-09: BUGFIX: missing end of if-clause. } // 2018-05-28: end of for-loop searching for rv. } // 2018-05-28: end of test for missing "aud" recall-vector. } // 2018-01-12: end of test for not-a-subject for (i = tpu; i>midway; --i) { // 2018-01-12: search backwards from tpu Psy[i].psyExam(); // 2018-01-12: inspect Psy flag-panel if (motjuste == psi1) { // 2018-01-12: find motjuste for sake of rv if (subjectflag == 1 && psi7 == 1) { // 2018-01-12: subject? if (psi20 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-01-12: end of test for subject and for nominative case. if (dirobj==1 && numreq>0 && psi8==numreq) { // 2018-05-25: if (psi1 > 0) qv4psi = psi1; // 2018-05-25: for inserting "AN". if (psi1 > 0) nphrpos = psi6; // 2018-05-25: set POS for EnArticle. if (psi1 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-05-25: end for pseud-dir=obj and numreq number. if (dirobj == 1 && psi8 == numreq && numreq>0) { // 2018-05-25: required number? if (psi1 > 0) qv4psi = psi1; // 2018-05-25: for inserting "AN". if (psi1 > 0) nphrpos = psi6; // 2018-05-25: set POS for EnArticle. if (psi1 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-05-25: end of test for direct object and accusative case. if (dirobj == 1 && numreq > 0) { // 2018-05-25: direct object? if (psi1 > 0) qv4psi = psi1; // 2018-05-25: for inserting "AN". if (psi1 > 0) nphrpos = psi6; // 2018-05-25: set POS for EnArticle. break; // 2018-05-25: exit loop if rv is found. if (psi1 > 0 && psi8==numreq && psi20>0) { // 2019-07-31 aud = psi20; // 2019-07-31: find positive rv; break; // 2018-05-25: exit loop if rv is found. } // 2018-05-25: if (psi1 > 0 && psi8==numreq && psi20>0) break; // 2019-07-31: TEST } // 2018-05-25: end of test for direct object and accusative case. if (psi1 > 0 && psi8==numreq && psi20>0) break; // 2019-07-31: TEST if (dirobj == 1 && psi7 == 4) { // 2018-01-12: direct object? if (psi1 > 0) qv4psi = psi1; // 2018-01-12: for inserting "AN". if (psi1 > 0) nphrpos = psi6; // 2018-01-12: set POS for EnArticle. if (psi1 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-01-12: end of test for direct object and accusative case. } // 2018-01-12: end of test to find motjuste with valid rv. } // 2018-01-14: end of for-loop as part of else-clause. for (i=vault; i>midway; --i) { // 2018-01-23: search backwards within "vault" Psy[i].psyExam(); // 2018-01-23: examine the Psy concept array... if (numreq > 0 && aud > 0); break; // 2018-05-25: pre-empt if (motjuste == psi1) { // 2018-01-23: find motjuste for sake of rv if (numreq>0 && psi8==numreq && psi20>0) { // 2019-07-31: aud = psi20; // 2019-07-31: break; // 2018-05-25: } // end of test to preempt with numreq if (subjectflag == 1 && psi7 == 1) { // 2018-01-23: subject? if (psi20 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-01-23: end of test for subject and for nominative case. if (dirobj == 1 && psi7 == 4) { // 2018-01-23: direct object? if (psi1 > 0) qv4psi = psi1; // 2018-01-23: for inserting "AN". if (psi20 > 0) nphrpos = psi6; // 2019-07-31: set POS for EnArticle. if (psi20 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-01-23: end of test for direct object and accusative case. } // 2018-01-23: end of test to find motjuste with valid rv. } // 2018-01-23: End of (for loop) searching through Psy conceptual array. if (nounlock == 0) { // 2018-01-12: if no nounlock override; if (mjact < 20) { // 2018-01-12: if no subject active enough for chain-of-thought if (subjectflag == 1) { // 2018-01-12: default to "I" only as subject motjuste = 701; // 2018-01-12: 701=I default concept of AI Mind for (i = tpu; i>midway; --i) { // 2018-01-12: search backwards Psy[i].psyExam(); // 2018-01-12: inspect Psy flag-panel if (psi1==701 && psi14 > 0) { // 2019-07-31: I=701 with tkb verblock? if (psi3 > defact) { // 2018-01-12: if higher psi3 act is found; tseln = i; // 2018-01-12: retain time of motjuste; tsels = i; // 2018-01-12: retain time of English subject; defact = psi3; // 2018-01-12: dynamic metric; verblock = psi14; // 2019-07-31: psi14 "tkb" as verblock; aud = psi20; // 2019-07-31: recall-vector for auditory engram } // 2018-01-12: end of test for higher-act ego-concept; } // 2018-01-12: end of test for "701=I" with seq-check; } // 2018-01-12: end of search for least-inhibited "701=I"; dba = 1; // 2018-01-12: subject requires nominative case; nphrnum = 1; // 2018-01-12: for EnArticle() and EnVerbPhrase(); nphrpos = 7; // 2018-01-12: prevent article "A" with "I"; prsn = 1; // 2018-01-12: for use elsewhere; subjnum = 1; // 2018-01-12: for use elsewhere; subjpsi = 701; // 2018-01-12: for use elsewhere; topic = 701; // 2018-01-12: for question-asking modules; for (i = vault; i>midway; --i) { // 2018-01-12: search backwards Psy[i].psyExam(); // 2018-01-12: inspect Psy flag-panel if (psi1 == 701) { // 2018-01-12: if 701=I is found; if (psi7 == 1) { // 2018-01-12: psi7/dba must be nominative=1; aud = psi20; // 2019-07-31: "I" recall-vector for Speech() if (psi20>0) break; // 2019-07-31: insurance } // 2018-01-12: end of test for nominative "I"; } // 2018-01-12: End of search for 701=I; } // 2018-01-12: end of 701=I search in reliable "vault" sequence. } // 2018-01-12: end of test for "I" to become subj. not obj. } // 2018-01-12: end of test for low activation warranting a default } // 2018-01-12: end of test for absence of pre-ordained nounlock; unk = aud; // 2018-01-14: preserve value across call to EnArticle(). if (nphrpos == 5) { // 2018-01-14: only nouns, not adjectives or pronouns. audMemory[aud].audExam(); // 2018-01-14: Inspect memory at "aud"; if (aud0 == "A") anset = 65; // 2018-01-14: If vowel "A"; if (aud0 == "E") anset = 69; // 2018-01-14: If vowel "E"; if (aud0 == "I") anset = 73; // 2018-01-14: If vowel "I"; if (aud0 == "O") anset = 79; // 2018-01-14: If vowel "O"; if (aud0 == "U") anset = 85; // 2018-01-14: If vowel "U"; if (nphrnum > 0) usx = motjuste; // 2018-09-07: num(ber) required. EnArticle(); // 2018-01-14: module for thinking an English article. // EnArticle(); // 2019-09-22: commenting out during troubleshooting. anset = 0; // 2018-06-03: reset for safety. usx = 0; // 2018-09-04: reset for safety. } // 2018-01-14: end of test for a 5=noun noun-phrase part-of-speech aud = unk; // 2018-01-14: restore value after call to EnArticle(). unk = 0; // 2018-01-14: reset for safety. unk = aud; // 2019-10-12: preserve value across call to EnAdjective(). if (tdj > 0) { // 2019-10-12: if there is a positive time-of-adjective... EnAdjective(); // 2019-10-12: for insertion of an adjective tdj = 0; // 2019-10-12: reset for safety. } // 2019-10-12: end of test for an adjective linked to the noun. aud = unk; // 2019-10-12: restore value after call to EnAdjective(). Speech(); // 2018-01-12: speak the word starting at the "aud" time. Psy[tsels].psyExam(); // 2018-01-14: inhibit the subject just spoken: Psy[tsels] = new psyNode(psi0,psi1,psi2,-32,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel. if (tpr > 0) { // 2019-09-20: if there is a positive time-of-preposition EnPrep(); // 2019-09-20: for a prepositional phrase tpr = 0; // 2019-09-22: reset for safety. } // 2019-09-20: end of test for a preposition linked to the noun. dirobj = 0; // 2018-01-12: reset for safety mfn = 0; // 2019-10-25: prevent carry-over. mjact = 0; // 2018-01-12: reset for safety. motjuste = 0; // 2018-01-12: reset for safety. numreq= 0; // 2018-05-25: whether used or not in one pass through the module. } // 2019-10-25: EnNounPhrase() returns to Indicative(). function EnVerbGen() { // http://ai.neocities.org/EnVerbgen.html if (audbase == 0 && verbpsi > 0) { // 2018-10-11: for lack of starting point.. for (i = tpu; i>midway; --i) { // 2018-10-11: search backwards Psy[i].psyExam(); // 2018-10-11: examine conceptual Psy array at each "i(ndex)" if (psi1 == verbpsi && psi20 > 0) { // 2019-07-31: verb with recall-vectoer? audbase = psi20; // 2019-07-31: initial base-time for generating verb-form break; // 2018-10-11: one example is enough. } // 2018-10-11: end of test for modificand verb and auditory engram } // 2018-10-11: end of backwards loop in search of audbase starting point. } // 2018-10-11: end of search for "audbase" starting point. binc = 0; // 2018-10-12: "b" buffer-character increment for AudBuffer() if (subjpsi==701) prsn = 1; // 2018-10-11: "701=I" is first-person; if (subjpsi==707) prsn = 2; // 2018-10-11: "707=YOU" is second-person; if (subjpsi==713) prsn = 3; // 2018-10-11: "713=HE" is third-person; if (subjpsi==719) prsn = 3; // 2018-10-11: "719=SHE" is third-person; if (subjpsi==725) prsn = 3; // 2018-10-11: "725=IT" is third-person; if (subjpsi==731) prsn = 1; // 2018-10-11: "731=WE" is first-person; if (subjpsi==743) prsn = 3; // 2018-10-11: "743=THEY" is third-person; audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #01 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #02 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #03 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #04 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #05 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #06 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #07 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #08 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #09 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #10 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #11 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #12 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #13 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #14 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #15 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 audMemory[audbase].audExam(); // 2018-10-10: @ear character-engram #16 if (aud0 != " ") { abc = aud0; AudBuffer(); audbase++ } // 2018-10-10 do { // 2018-10-11: next loop uses OutBuffer(); OutBuffer(); // 2018-10-11: call OutBuffer with each passage through loop; if (binc == 1) { // 2018-10-11: the indicated buffer-character by number if (b16 != "") output += b6; // 2019-06-15: concatenate verb-characters pho = b16; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 2) { // 2018-10-11: the indicated buffer-character by number if (b15 != "") output += b15; // 2019-06-15: concatenate verb-characters pho = b15; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 3) { // 2018-10-11: the indicated buffer-character by number if (b14 != "") output += b14; // 2019-06-15: concatenate verb-characters pho = b14; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 4) { // 2018-10-11: the indicated buffer-character by number if (b13 != "") output += b13; // 2019-06-15: concatenate verb-characters pho = b13; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 5) { // 2018-10-11: the indicated buffer-character by number if (b12 != "") output += b12; // 2019-06-15: concatenate verb-characters pho = b12; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 6) { // 2018-10-11: the indicated buffer-character by number if (b11 != "") output += b11; // 2019-06-15: concatenate verb-characters pho = b11; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 7) { // 2018-10-11: the indicated buffer-character by number if (b10 != "") output += b10; // 2019-06-15: concatenate verb-characters pho = b10; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 8) { // 2018-10-11: the indicated buffer-character by number if (b9 != "") output += b9; // 2019-06-15: concatenate verb-characters pho = b9; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 9) { // 2018-10-11: the indicated buffer-character by number if (b8 != "") output += b8; // 2019-06-15: concatenate verb-characters pho = b8; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 10) { // 2018-10-11: the indicated buffer-character by number if (b7 != "") output += b7; // 2019-06-15: concatenate verb-characters pho = b7; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 11) { // 2018-10-11: the indicated buffer-character by number if (b6 != "") output += b6; // 2019-06-15: concatenate verb-characters pho = b6; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 12) { // 2018-10-11: the indicated buffer-character by number if (b5 != "") output += b5; // 2019-06-15: concatenate verb-characters pho = b5; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 13) { // 2018-10-11: the indicated buffer-character by number if (b4 != "") output += b4; // 2019-06-15: concatenate verb-characters pho = b4; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 14) { // 2018-10-11: the indicated buffer-character by number if (b3 != "") output += b3; // 2019-06-15: concatenate verb-characters pho = b3; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 15) { // 2018-10-11: the indicated buffer-character by number if (b2 != "") output += b2; // 2019-06-15: concatenate verb-characters pho = b2; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). if (binc == 16) { // 2018-10-11: the indicated buffer-character by number if (b1 != "") output += b1; // 2019-06-15: concatenate verb-characters pho = b1; // 2019-06-15: for ReEntry() if (pho > "") ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of outputting character and concatenating for ReEntry(). binc++; // 2018-10-11: TEST; REMOVE pho = aud0; // 18oct2012 abc = aud0; // for AudBuffer(); 18oct2012 } // 2018-10-11: end of looping through OutBuffer(). while (binc < 17); // 2018-10-11: while inspecting OutBuffer; c1=""; c2=""; c3=""; c4=""; c5=""; // 2019-06-15 c6=""; c7=""; c8=""; c9=""; c10=""; // 2019-06-15 c11=""; c12=""; c13=""; c14=""; c15=""; // 2018-10-11 c16=""; // 2018-10-11: clear out the AudBuffer. if (prsn == 1) { // 2018-10-12: first person; if (snu == 1) { // 2018-10-12: subject-number parameter; ReEntry(); // 2018-10-12: for accumulating record of thought } // 2018-10-12: end of test for singular subject-number; if (snu == 2) { // 2018-10-12: subject-number parameter; ReEntry(); // 2018-10-12: for accumulating record of thought } // 2018-10-12: end of test for plural subject-number; } // 2018-10-12: end of test for first person. if (prsn == 2) { // 2018-10-12: second person; if (snu == 1) { // 2018-10-12: subject-number parameter; ReEntry(); // 2018-10-12: for accumulating record of thought } // 2018-10-12: end of test for singular subject-number; if (snu == 2) { // 2018-10-12: subject-number parameter; ReEntry(); // 2018-10-12: for accumulating record of thought } // 2018-10-12: end of test for plural subject-number; } // 2018-10-12: end of test for second person. if (prsn == 3) { // 2018-10-11: third person; if (snu == 1) { // 2018-10-11: subject-number parameter; if (b2 == "C" && b1 == "H") { // 2019-06-15: last two characters in verb-stem pho = "E"; // 2018-10-11: add an "E" before "S" output += pho; // 2018-10-11: inflection ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of test for verb ending in "-ch" if (b2 == "S" && b1 == "H") { // 2019-06-15: last two characters in verb-stem pho = "E"; // 2018-10-11: add an "E" before "S" output += pho; // 2018-10-11: inflection ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of test for verb ending in "-sh" pho = "S"; // 2018-10-11: add one single "S" output += pho; // 2018-10-11: inflection ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-11: end of test for singular subject-number; if (snu == 2) { // 2018-10-12: subject-number parameter; ReEntry(); // 2018-10-11: for accumulating record of thought } // 2018-10-12: end of test for plural subject-number; } // 2018-10-11: end of test for third-person. output += " "; // add a space; 18oct2012 Voice(); // 18oct2012 audbase = 0; // 2018-10-11: prevent carry-over gencon = 1; // 2018-10-10: to prevent unwarranted calling of Speech() prsn = 0; // 2018-10-11: prevent carry-over verbpsi = 0; // 2018-10-11: prevent carry-over } // 2019-07-31: EnVerbGen() returns to EnVerbPhrase() function EnVerbPhrase() { // http://ai.neocities.org/EnVerbPhrase.html act = 0; // 2018-01-14: Start with zero to look for psi1 higher than "act". audjuste = 0; // 2018-01-14: prevent carry-over motjuste = 0; // 2018-01-14: prevent carry-over negjux = 0; // 2018-01-14: flag for 250=NOT juxtaposed to a verb; vphraud = 0; // 2018-01-14: initially if (whatcon==1 && qv2psi==886) { // 2018-11-28: if WHAT...886=THINK svo1 = qv1psi; // 2018-05-13: try to use subject of query as subject of response. motjuste = 886; // 2018-11-28: encourage selection of 886=THINK verbpsi = 886; // 2018-11-28: let the concept of the verb be 886=THINK verblock = 0; // 2018-11-28 let activated 886=THINK win selection. } // 2018-11-28: end of test for WHAT...886=THINK query. if (verblock > 0 && motjuste != 886) { // 2018-11-28: positive verblock? if (whatcon > 0) { // 2019-02-12: if SpreadAct() answers a what-query... if (catverb == motjuste && conj > 0) { // 2019-02-12: after a conjunction... if (nounlock > 0) dirobj = 1; // 2019-02-12: for sake of direct object. etc = 0; // 2019-02-18: abandon the count of active nouns. EnNounPhrase(); // 2019-02-12: after omitting verb, output direct-object. return; // 2019-02-12: omit the verb after the use of a conjunction. } // 2019-02-12: end of test for the chain-flag matching the selected verb. } // 2019-02-12: end of test for SpreadAct() answering a what-query. Psy[verblock].psyExam(); // 2018-01-04: inspect t=verblock row; verbpsi = psi1; // 2018-01-04: the concept of the verb. if (psi5 == 250) negjux = 250; // 2018-11-14: for negation of verb. prsn = psi7; // 2018-11-14: for sake of EnAuxVerb() or EnVerbGen() subjnum = psi8; // 2018-11-14: for sake of EnAuxVerb() if (psi11 > 0) seq = psi11; // 2019-07-31: capture seq-tag. if (psi11 > 0) tselp = verblock; // 2019-07-31: false at first nounlock = psi14; // 2019-07-31: psi14 tkb becomes nounlock. // if (psi19 > 0) tpr = psi19; // 2019-08-04: time-of-preposition if (psi19 > 0) tvpr = psi19; // 2019-10-24: trap time-of-verb-preposition if (psi20 > 0) audbase = psi20; // 2019-07-31: VerbGen() parameter; svo2 = psi1; // 2018-01-04: item #2 of subj - verb - ind.obj - dir.obj if (seq > 0 && wherecon == 0) { // 2018-11-13: if seq-tag is positive... for (i = t; i>midway; --i) { // 2018-11-13: search backwards in time. Psy[i].psyExam(); // 2018-11-14 BUGFIX: Examine the Psy concept-array. if (psi1==seq && psi6==6) { // 2018-11-13: if engram matches seq... prep = psi1; // 2018-11-13: identify the preposition as such. break; // 2018-11-13: exit the loop upon finding the preposition. } // 2018-11-13: end of search for a preposition matching the "seq". } // 2018-11-13: end of backwards loop. while (eureka != prep) { // 2018-11-13: tselp++; // 2018-11-13: increment the not-yet-true "tselp" variable Psy[tselp].psyExam(); // 2018-11-13: iterate to find "tselp" row in array. eureka = psi1; // 2018-11-13: hold whatever is found as "eureka" if (tselp > cns) break; // 2018-11-13: escape from any runaway-loop. } // 2018-11-13: } // 2018-11-13: end of test for positive seq-tag. if (psi20 > 0) aud = psi20; // 2019-07-31: auditory recall-vector if (psi20 > 0) vphraud = psi20; // 2019-07-31: auditory recall-vector if (psi20 == 0) { // 2019-07-31: if there is no auditory recall-vector "rv"... for (i = tpu; i>midway; --i) { // 2018-01-30: search backwards from tpu Psy[i].psyExam(); // 2018-01-30: inspect Psy flag-panel if (psi1 == verbpsi && psi1 != 800 && negjux != 250) { // 2018-10-04: if verb found... if (qv2num > 0) subjnum = qv2num; // 2018-10-10: for query-response. if (psi1 == verbpsi && psi7 == prsn && psi8 == snu) { // 2018-10-10: if (psi20 > 0) aud = psi20; // 2019-07-31: find positive rv if (psi20 > 0) vphraud = psi20; // 2019-07-31: auditory recall-vector if (psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-10-10: end of test to find regular or irregular verb-form } // 2018-10-04: end of search for non-infinitive verb-form. if (psi1 == verbpsi && negjux == 250) { // 2018-10-04: if verb is found... if (psi7==0 && psi20 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi7==0 && psi20 > 0) vphraud = psi20; // 2019-07-31: auditory rv; if (psi7==0 && psi20 > 0) break; // 2019-07-31: exit loop if rv is found. } // 2018-10-04: end of test for negjux requiring infinitive verb. } // 2018-01-30: end of for-loop as part of search for recall-vector "rv". } // 2018-01-30: end of test for no recall-vector rv as in InFerence() if (subjpsi==701 || subjpsi==731) prsn=1; // 2018-01-14: I or WE if (svo1==701) prsn=1; // 2018-01-14: I if (svo1==701) subjnum=1; // 2018-01-14: I if (subjpsi==707 || subjpsi==737) prsn=2; // 2018-01-14: "YOU" if (subjpsi==713 || subjpsi==719) prsn=3; // 2018-01-14: HE; SHE if (subjpsi==725 || subjpsi==743) prsn=3; // 2018-01-14: IT THEY dba = prsn; // 2018-01-14: parameter for VerbGen() for (i=tpu; i>midway; i--) { // 2018-01-14: search Psy array before I/O Psy[i].psyExam(); // 2018-01-14: examine the Psy concept array... if (psi1 == verbpsi && psi1 == 800) { // 2018-01-14: special 800=BE-verb if (psi6 == 8) { // 2018-01-14: select only pos=8 verbs, even homonyms // Following code accepts only a verb-form matching three // requirements: [ ]same concept; [ ]num(ber); and [ ]person: if (qv2num > 0) subjnum = qv2num; // 2018-01-14: for query-response. if (negjux==250) { // 2018-10-04: 250=NOT requires AuxVerb + infinitive. if (psi1==verbpsi && psi7==0) { // 2018-10-04: if (psi20 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) vphraud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop once rv is found. } // 2018-10-04: end of test to find regular or irregular verb-form } // 2018-10-04: end of test pre-empting inflected verb with infinitive. if (psi1==verbpsi && psi8==subjnum && psi7==prsn) { // 2018-01-14 if (psi20 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) vphraud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-21: exit loop once rv is found. } // 2018-01-14: end of test to find regular or irregular verb-form } // 2018-01-14 end of test for part-of-speech pos == "8" (verb) } // 2018-01-14: end of test for correct verb-concept verbpsi. if (psi1 == verbpsi && psi1 != 800) { // 2018-01-14: other than 800=BE if (psi6 == 8) { // 2018-01-14: select only pos=8 verbs, even homonyms if (psi1==verbpsi && i==verblock) { // 2018-01-14: zero in. if (psi20 > 0) aud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) vphraud = psi20; // 2019-07-31: find positive rv; if (psi20 > 0) break; // 2019-07-31: exit loop once rv is found. } // 2018-01-14: end of test to find regular or irregular verb-form } // 2019-01-14: end of test for part-of-speech pos == "8" (verb) } // 2018-01-14: end of test for correct verb-concept "verbpsi". } // 2018-01-14: End of (for loop) searching for correct verb-form. } // 2018-01-04: end of test for verblock. if (vphraud > 0) aud = vphraud; // 2018-01-14: correct form? if (verblock == 0) { // 2018-01-14: prevent false negations; for (i=tpu; i>midway; i--) { // 2018-01-14: search backwards in time. Psy[i].psyExam(); // 2018-01-14: examine the Psy concept array... if (psi6 == 8) { // 2019-01-14: select only psi6 pos=8 verbs if (whatcon==1 && qv2psi==886 && psi1==886) { // 2018-11-28: aud = psi20; // 2019-07-31: recall-vector "rv" for Speech() break; // 2018-11-28: peremptory retrieval of 886=THINK } // 2018-11-28: end of test for WHAT...886=THINK query. if (psi3 > act) { // 2018-10-04: if psi3 is higher than "act"... tselv = i; // 2018-01-14: retain time of winning verb; motjuste = psi1; // 2018-01-14: Select the most active verb. svo2 = psi1; // 2018-01-14: for calling VisRecog() subjnum = psi8; // 2018-10-03: for sake of EnAuxVerb() if (psi14 > 0) { // 2019-07-31: if verb has a positive "tkb" dir.obj. nounlock = psi14; // 2019-07-31: for direct-object noun. } // 2018-12-23: for direct-object noun. aud = psi20; // 2019-07-31: recall-vector "rv" for Speech() act = psi3; // 2018-10-04: to test for a higher psi3 } // 2018-01-14: end of test of activation-level. } // 2018-01-14: end of test for part-of-speech pos == "8" verb } // 2018-01-14: End of (for loop) searching for most active "motjuste" } // 2018-01-14: end of test for absence of a verblock from subject to verb. if (negjux == 250) { // 2018-01-14: if verb is negated with 250=NOT... if (svo2 != 800) { // 2018-01-14: if other than an 800=BE verb... auxverb = 818; // 2018-11-28: 818=DO as auxiliary verb; if (subjnum==0 && num != 0) subjnum = num; // 2018-10-03: assumption. prsn = 3; // 2018-10-03: default assumption before contradiction. if (subjpsi==701) subjnum = 1; // 2018-10-03: 701=I if (subjpsi==701) prsn = 1; // 2018-10-01: 701=I if (svo1==701) subjnum = 1; // 2018-10-03: 701=I if (svo1==701) prsn = 1; // 2018-10-01: 701=I EnAuxVerb(); // 2018-11-28: to say 818=DO or "DOES"; auxverb = 0; // 2018-01-14: reset for safety. for (i=tpu; i>midway; i--) { // 2018-01-14: search for 250=NOT Psy[i].psyExam(); // 2018-01-14: examine the Psy concept array... if (psi1 == 250) { // 2018-01-14: if 250=NOT is found... aud = psi20; // 2019-07-31: "NOT" recall-vector for Speech() if (psi20 > 0) aud=psi20; // 2019-07-31: recall-vector if (psi20 > 0) break; // 2019-07-31: insurance } // 2018-01-14: End of search for 250=NOT; } // 2018-01-14: End of search loop back to midway. Speech(); // 2018-01-14: speak the word starting at the "aud" time. aud = 0; // 2018-06-12: reset for safety. } // 2018-01-14: end of test to prevent auxiliary with 800=BE verb. } // 2018-01-14: end of test for 250=NOT negjux. motjuste = verbpsi; // 2018-10-10: to search for verb-form. if (vphraud != 0) aud = vphraud; // 2018-01-14: Accept rv of 3 parameters. if (subjpsi == 701) dba = 1; // 2018-01-14: "I" 1st person sing. if (subjpsi == 707) dba = 2; // 2018-01-14: "you" 2nd person sing. if (subjpsi == 713) dba = 3; // 2018-01-14: "he" 3rd person sing; if (subjpsi == 719) dba = 3; // 2018-01-14: "she" 3rd person sing. if (subjpsi == 725) dba = 3; // 2018-01-14: "it" 3rd person sing. if (subjpsi == 731) dba = 1; // 2018-01-14: "we" 1st person plural if (subjpsi == 737) dba = 2; // 2018-01-14: "you" 2nd person plural if (subjpsi == 743) dba = 3; // 2018-01-14: "they" 3rd person plural if (vphraud == 0) { // 2018-01-14: if not substituted above... for (i=tpu; i>midway; i--) { // 2018-01-14: skip current engrams. svo2 = motjuste; // 2018-01-14: TEST; REMOVE if (psi1 == verbpsi && psi20 > 0) audbase = psi20; // 2019-07-31: 2nd best if (psi1 == verbpsi && psi7 == 0 && psi20 > 0) audbase = psi20; // 2019-07-31 if (psi1 == verbpsi && psi7 == prsn && psi8 == nphrnum) { // 2018-10-10 vphraud = psi20; // 2019-07-31: VerbPhrase auditory engram tag } // 2018-10-10: end of test to find regular or irregular verb-form if (negjux==250) dba=0; // 2018-10-04: after "NOT" use infinitive if (psi7 == dba) { // 2018-01-14: for proper person; if (psi8 == snu) { // 2018-01-14: subject num(ber) parameter; vphraud = psi20; // 2019-07-31: auditory recall-vector; break; // 2018-01-14: exit the loop after first find. } // 2018-01-14: end of subject number-parameter test; } // 2018-01-14: end of dba-parameter test. } // 2018-01-14: end of (for loop) searching through Psy conceptual array. } // 2018-01-14: end of test of vphraud. if (vphraud == 0) EnVerbGen(); // 2018-10-10: if no verb-form, generate it. if (vphraud > 0) aud = vphraud; // 2018-01-14: correct form? if (svo2 == 800) numreq = subjnum; // 2018-05-25: for fetching predicate nominative. Speech(); // 2018-01-14: main call from EnVerbPhrase() to Speech() aud = 0; // 2018-01-14: Reset to prevent carry-over. Psy[tselv].psyExam(); // 2018-01-14: inspect verb for inhibition at time of selection. Psy[tselv] = new psyNode(psi0,psi1,psi2,-16,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel // Above line inserts neural inhibition upon currently selected verb. if (tpr > 0) { // 2019-08-04: if there is a positive time-of-preposition EnPrep(); // 2019-08-04: for a prepositional phrase tpr = 0; // 2019-09-22: reset for safety. } // 2019-08-04: end of test for a preposition linked to the verb. if (tselp > 0 && prep > 0 && wherecon == 0) { // 2018-11-13: preposition? SpreadAct(); // 2018-11-13: to generate a prepositional phrase prep = 0; // 2018-11-13: reset to prevent carry-over. } // 2018-11-13: end of test for conditions warranting SpreadAct for preposition. if (svo2 == 800) { // 2018-01-14: if the selected verb is a be-verb if (negjux == 250) { // 2018-01-14: if there is a 250=NOT negation flag... for (i=tpu; i>midway; i--) { // 2018-01-14: search for 250=NOT Psy[i].psyExam(); // 2018-01-14: examine the Psy concept array... if (psi1 == 250) { // 2018-01-14: if 250=NOT is found... if (psi20 > 0) aud = psi20; // 2019-07-31: auditory recall vector Speech(); // 2018-06-12: speak the word starting at the "aud" time. aud = 0; // 2018-06-12: reset for safety. negjux = 0; // 2018-01-14: reset for safety. if (psi20 > 0) break; // 2019-07-31: insurance } // 2018-01-14: End of search for 250=NOT. } // 2018-01-14: End of search loop back to midway. negjux = 0; // 2018-01-14: reset for safety. } // 2018-01-14: end of test for negated be-verb. } // 2018-01-14: end of test for 800=BE verb in case of negation. if (svo2 != 800) negjux = 0; // 2018-06-12: reset after one chance to matter. if (nounlock > 0) dirobj = 1; // 2018-10-04: for sake of intransitive verbs. if (subjpsi == 701) { // 2018-01-14: only for subject 701=I; if (svo2 == 823) { // 2019-11-07: only for verb 823=FEEL; if (svo4 == 0) { // 2019-11-07: if 823=FEEL has no direct object TacRecog(); // 2019-11-07: to supply a direct object for 823=FEEL if (haptac != 755) EnArticle(); // 2019-11-07: insert "A" or "THE" for (i=tpu; i>midway; i--) { // 2019-11-07: search backwards in time. Psy[i].psyExam(); // 2019-11-07: inspect the Psy concept flag-panel if (psi1 == haptac) { // 2019-11-07: if sensation reported by TacRecog() aud = psi20; // 2019-11-07: fetch auditory recall tag for Speech() Speech(); // 2019-11-07: speak the name of the reported sensation. hap = 0; // 2019-11-07: reset after use. haptac = 0; // 2019-11-07: reset after use. break; // 2019-11-07: one engram is enough. } // 2019-11-07: end of test for "haptac" as reported by TacRecog. } // 2019-11-07: end of loop searching for object of 823=FEEL. return; // 2019-11-07: abandon the rest of EnVerbPhrase() } // 2019-11-07: end of test for direct object. } // 2019-11-07: end of test for verb "823=FEEL". if (svo2 == 870) { // 2018-12-09: only for verb 870=SEE; if (svo4 == 0) { // 2018-01-14: if SEE has no direct object... // 2018-01-14: i.e., if there is no robot camera for computer vision... VisRecog(); // 2018-01-14: a challenge for robot AI coders. svo2 = 0; // 2018-01-14: reset for safety. svo4 = 0; // 2018-01-14: reset for safety. return; // 2018-01-14: abandon rest of VerbPhrase() } // 2018-01-14: end of test for direct object. } // 2018-12-09: end of test for "870=SEE". } // 2018-01-14: end of test for ego-concept 701=I as subject. if (dirobj==1 && qv2psi != 886 && dunnocon != 1) { // 2018-11-28: 886=THINK EnNounPhrase(); // 2018-01-04: for direct object or predicate nominative } // 2018-10-06: end of tests for fetching a direct object. if (tvpr > 0) { // 2019-10-24: if there is a positive time-of-verb-preposition EnPrep(); // 2019-09-20: for a prepositional phrase tvpr = 0; // 2019-10-24: reset for safety. } // 2019-09-20: end of test for a preposition linked to the verb. if (dirobj==0 && qv2psi==886) { // 2018-11-28: special for 886=THINK conj = 361; // 2018-11-26: prepare to use 361=THAT conjunction ConJoin(); // 2018-10-06: use conjunction } // 2018-11-28: end of test for 886=THINK if (whatcon==0 && actpsi > 0) { // 2018-10-02: if there is activation to spread... SpreadAct(); // 2018-06-03: for a chain of thought. actpsi = 0; // 2018-06-03: reset to zero for safety } // 2018-05-13: end of whatcon-test to fetch conjunction instead of object. dirobj = 0; // 2018-01-14: reset flag after thinking direct object. if (prepgen > 0) EnPrep(); // 2018-01-14: if "Where?" call EnPrep(). audbase = 0; // 2018-01-14: reset for safety. negjux - 0; // 2018-10-04: prevent carry-over. num = 0; // 2017-01-14: reset after output of one query-response. qv2num = 0; // 2017-01-14: reset after output of one query-response. } // 2019-10-24: EnVerbPhrase() returns to Indicative() module. function InFerence() { // http://ai.neocities.org/InFerence.html moot = 1; // prevent interference via tag-forming; 18mar2013 apb = "If silent inference is made, answer question to confirm or refute."; Voice(); // 23mar2013 if (prednom > 0) { // positive predicate nominative? 18mar2013 for (i = tpu; i>midway; i--) { // 2018-01-25: search KB to infer facts. Psy[i].psyExam(); // 2018-01-25: examine Psy concept-array; // 20mar2013 Let only plural KB subjects be basis for InFerence: if (prednom == psi1 && psi8 == 2) { // 2018-01-25: plural KB data? if (psi7 == 1) { // 2018-01-25: dba nominative for subject? if (seqverb == 0) { // only once; 18mar2013 seqtkb = psi14; // 2019-07-27: hold for fetching same direct object; seqverb = psi11; // 2019-07-27: hold to be the verb of an inference. quverb = psi11; // 2019-07-27: query-verb for AskUser; ynverb = 0; // 2018-01-25: since lacking, use quverb for AskUser() seq = seqverb; // 2018-01-25: to be inferred as applying to subject. } // 2018-01-25: end of test that no "seqverb" has yet been declared. } // 2018-01-25: end of test that "prednom" does occur in nominative. } // 2018-01-25: end of test for a fact about the "prednom" as plural subject. } // 2018-01-25: end of backwards loop in search of inferrable knowledge. } // 2018-01-25: end of test for positive predicate nominative. if (seqverb > 0) { // verb available for inference? 18mar2013 inft = t; // for AskUser to find auditory engrams 18mar2013 t = (t+1); // increment time "t" by one for a gap; 18mar2013 t = (t+1); // increment time to create an inference; 18mar2013 Psy[t].psyExam(); // 2018-01-25: expose row where no values are present; psi7 = 1; // 2018-10-11: subject noun serves as 1=nominative psi8 = 1; // 2018-10-11: assumed singular because of Is-A quality. seq = seqverb; // prevent override? 18mar2013 psi14 = (t+1); // 2019-07-27: psi13=tkb, which is one unit later; Psy[t] = new // 2018-01-25: psi1 subjnom; psi3 act; psi6 pos; psi8 qusnum; psi11 seq; psyNode(psi0,subjnom,psi2,48,psi4,psi5,5, 1,1,0,psi10,seqverb,psi12,psi13, psi14.psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-27 tkbn = t; // 2018-01-28: conceptual array-time for subject-noun of AskUser query. t = (t+1); // 2018-01-25: increment t for storage of inference-verb; Psy[seqtkb].psyExam(); // 2018-01-25: obtain dobseq from Psy array; dobseq = psi11; // 2019-07-27: to serve as psi11 "seq" in next insertion; quobj = dobseq; // 2018-01-25: so AskUser() will use the particular dir.obj. Psy[t].psyExam(); // 2018-01-25: expose values for change of some; Psy[t] = new // 2018-01-25: psi1 seqverb; 6 pos; 10 pre; 12 dobseq; 13 tkb; // psyNode(psi0,seqverb,psi2,psi3,psi4,psi5,8,3,1,psi9,subjnom,psi11,dobseq,(t+1),psi14); psyNode(psi0,seqverb,psi2,psi3,psi4,psi5,8, 3,1,psi9,subjnom,psi11,dobseq,psi13, (t+1),psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-27 tkbv = t; // 2018-01-28: conceptual array-time for verb of AskUser query. t = (t+1); // 2018-01-25: increment time to store direct object; tkbo = t; // 2018-01-29: conceptual array-time for object-noun of AskUser query. Psy[seqtkb].psyExam(); // 2018-01-25: obtain seqdob from Psy array; seqdob = psi11; // 2019-07-27: to serve as "psi1" in next insertion; seqrvx = psi20; // 2019-07-27: to serve as "psi20" in next insertion; Psy[t].psyExam(); // 2018-01-25: expose values for change of some; psi8 = 2; // 2018-12-16: plural object as required for an inference. Psy[t] = new // 2018-01-25: psi1 seqverb; 6 pos; 10 pre; 11 dobseq; 14 tkb; psyNode(psi0,seqdob,psi2,40,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,seqrvx); // 2019-07-27 quobj = dobseq; // 2018-01-25: for transfer to AskUser; t = (t+1); // 2018-01-25: increment time "t" for an ending gap; yncon = 1; // 2018-01-25: for AskUser() to ask yes-or-no question; qusub = subjnom; // 2018-01-25: for transfer to AskUser(); } // 2018-01-25: end of test for a verb to be part of inference. becon = 0; // 2018-01-25: reset after use; dobseq = 0; // 2018-01-25: reset after use; 18mar2013 moot = 0; // 2018-01-25: reset after use; 18mar2013 prednom = 0; // 2018-01-25: reset after use; 18mar2013 seqdob = 0; // 2018-01-25: reset after use; 18mar2013 seqrvx = 0; // 2018-01-25: reset after use; seqtkb = 0; // 2018-01-25: reset after use; seqverb = 0; // 2018-01-25: reset after use; subjnom = 0; // 2018-01-25: reset after use; } // 2019-07-31: InFerence() returns to EnThink() function Indicative() { // http://ai.neocities.org/Indicative.html moot = 0; // 2018-01-21: start with no suppression of associative tags. pov = 1; // 2018-01-21: thinking occurs in self or "I" mode. rv = 0; // 2018-01-21: lest rv fail to be at zero for AudInput() tdo = 0; // 2018-01-21: reset time-of-direct-object for safety. tkb = 0; // 2019-09-20: prevent a persisting value. tpr = 0; // 2019-09-20: prevent a persisting value. qucon = 0; // 2018-01-21: reset for safety. verbcon = 0; // 2019-02-12: reset for safety verblock = 0; // 2019-09-20: reset for safety. if (dunnocon == 1) { // 2018-10-01: if AI cannot answer a query with knowledge for (i=vault; i>0; i--) { // 2018-10-01: search backwards in KB "vault" Psy[i].psyExam(); // 2018-10-01: inspect the Psy concept flag-panel if (psi1==701 && psi12==838) { // 2018-11-28: if I...KNOW... psi0 = 32; // 2018-10-01: elevate activation of truth-value tru psi3 = 256; // 2018-10-01: highly activate "I DO NOT KNOW" psi5 = 250; // 2018-10-01: make sure "KNOW" is negated. Psy[i] = new // 2018-10-01: inserting new values into flag-panel. psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18,psi19,psi20); // 2019-07-31: expanded flag-panel break; // 2018-10-01: skip rest of KB vault. } // 2018-11-28: end of test for 701=I and 838=KNOW. } // 2018-10-01: End of search loop from vault down to t=zero. } // 2018-10-01: end of test for flag requiring answer "I DO NOT KNOW". EnNounPhrase(); // 2018-01-12: fetch noun or pronoun as subject of thought. EnVerbPhrase(); // 2018-01-01: call the module to select an English verb. if (dunnocon == 1) { // 2018-10-02: prepare to change flag after output... for (i=vault; i>0; i--) { // 2018-10-02: search KB vault. Psy[i].psyExam(); // 2018-10-02: inspect the Psy concept flag-panel if (psi1==701 && psi12==838) { // 2018-11-28: if I...KNOW... psi0 = 0; // 2018-10-02: remove activation of truth-value "tru" psi3 = 0; // 2018-10-02: remove activation from "I DO NOT KNOW" Psy[i] = new // 2018-10-02: changing the values in the flag-panel. psyNode(psi0,psi1,psi2,psi3,psi4,psi5,psi6, psi7,psi8,psi9,psi10,psi11,psi12,psi13, psi14,psi15,psi16,psi17,psi18i,psi19,psi20); // 2019-07-31: flag-panel. break; // 2018-10-02: skip rest of KB vault. } // 2018-11-28: end of test for 701=I and 838=KNOW. } // 2018-10-02: End of search loop from vault down to t=zero. dunnocon = 0; // 2018-10-02: zero out to prevent carry-over. snu = 0; // 2018-10-10: prevent carry-over whatcon = 0; // 2018-10-02: TEST } // 2018-10-01: end of test for "dunnocon" flag after its output. mri = 0; // 2019-09-21: reset for safety. nounlock = 0; // 2018-01-21: reset for safety. qucon = 0; // 2018-01-21: reset to prevent unwarranted SpreadAct() qv2num = 0; // 2018-01-21: reset after output of one query-response. qv1psi = 0; // 2018-01-21: reset SpreadAct subject-psi for safety. qv2psi = 0; // 2018-01-21: reset SpreadAct verb-psi for safety. svo1 = 0; // 2018-01-21: reset subject-verb-object values for safety. svo2 = 0; // 2018-01-21: reset subject-verb-object values for safety. svo3 = 0; // 2018-01-21: reset subject-verb-object values for safety. svo4 = 0; // 2018-01-21: reset subject-verb-object values for safety. seqpsi = 0; // 2018-01-21: reset for the sake of SpreadAct() tvb = 0; // 2019-03-14: prevent interference in EnParser() verblock = 0; // 2018-01-21: reset for safety. PsiDecay(); // 2018-01--12: Reduce conceptual activation after each thought. pov = 2; // 2019-02-12: give human user a "pause" for input... bias = 5; // 2018-01-30: expect a noun, in case user inputs unknown word. } // 2019-07-31: Indicative() returns to EnThink(). function Imperative() { // 2018-01-14 // 2018-01-14: mind-module stubbed in for issueing command. moot = 1; // 2018-09-21: prevent forming of associative tags. output = ""; // 2018-09-21: remove any previous output-display. for (i = vault; i>midway; i--) { // 2018-09-21: "vault" is reliable. Psy[i].psyExam(); // 2018-09-21: examine conceptual Psy array; if (psi1==884) { // 2018-11-28: 884=TEACH; aud = psi20; // 2019-07-31: auditory recall-vector; break; // 2018-09-21: one example is enough. } // 2018-11-28: end of test for #884=TEACH } // 2018-09-21: end of backwards loop; Speech(); // 2018-09-21: speak the word "TEACH" Voice(); // 2018-09-21: makes the message appear on-screen. for (i = vault; i>midway; i--) { // 2018-09-21: "vault" is reliable. Psy[i].psyExam(); // 2018-09-21: examine conceptual Psy array; if (psi1==701 && psi7 == 3) { // 2018-09-21: dative 701=ME aud = psi20; // 2019-07-31: auditory recall-vector; break; // 2018-09-21: one example is enough. } // 2018-01-26: end of test for #701=ME } // 2018-09-21: end of backwards loop; Speech(); // 2018-09-21: speak the word "ME" Voice(); // 2018-09-21: makes the message appear on-screen. for (i = vault; i>midway; i--) { // 2018-09-21: "vault" is reliable. Psy[i].psyExam(); // 2018-09-21: examine conceptual Psy array; if (psi1==755) { // 2018-09-21: 755=SOMETHING; aud = psi20; // 2019-07-31: auditory recall-vector; break; // 2018-09-21: one example is enough. } // 2018-01-26: end of test for #755=SOMETHING } // 2018-09-21: end of backwards loop; Speech(); // 2018-09-21: speak the word "SOMETHING" Voice(); // 2018-09-21: makes the message appear on-screen. moot = 0; // 2018-09-21: end prevention of associative tags. } // 2019-07-31: Imperative() returns to the EnThink() module. function EnThink() { // http://ai.neocities.org/EnThink.html document.forms[1].elements[0].value = ""; // 2019-11-07: remove visible user input catsubj = 0; // 2019-02-12: reset for safety; catverb = 0; // 2019-02-12: reset for safety. prep = 0; // 2018-11-13: in case "prep" was set by EnParser() tdo = 0; // 2018-07-12: reset time-of-direct-object for safety. tkb = 0; // 2018-07-12: reset for safety. tpr = 0; // 2019-08-04: reset after service as flag-panel tag for concepts. inert = (inert + 1); // 2018-01-20: but AudListen() resets to zero; lurk = (lurk + 1); // 2018-01-20: AudListen() resets to zero; if (isolation > 60) { // 2018-11-14: if no input for arbitrary duration... Imperative(); // 2018-09-21: Issue a request for input from a human user. impetus = 0; // 2018-09-21: reset the trigger for calling Imperative(). isolation = 0; // 2018-10-03: reset the trigger for calling Imperative(). return; // 2018-09-21: abandon EnThink(); give human user a chance to respond. } // 2018-09-21: end of test for trigger to call Imperative() if (qucon==1 || whatcon==1 || wherecon==1) SpreadAct(); // 2018-10-28: apb = "EnThink() at time = "+t+"; rejuvenations = "+rjc+"; since dob "+dob; // 2018-01-24: Voice(); // 2018-01-20: speak the all-points-bulletin "apb"; if (kbcon > 0) { // 2018-01-28: if user answers yes-or-no question; KbRetro(); // 2018-01-28: retroactively adjust knowledge base; kbcon = 0; // 2018-01-28: reset for safety; kbzap = 0; // 2018-01-28: reset for safety. } // 2018-01-28: User has had one chance to answer yes-or-no question. inft = t; // 2018-01-25: in case inference-time not otherwise set; if (becon == 1) { // 2018-01-25: if user input includes 800=BE-verb... InFerence(); // 2018-01-25: make a silent inference; } // 2018-01-25: end of test for incoming be-verb. if (yncon == 1) { // 2018-01-25: set in the InFerence() module tdo = 0; // 2018-07-12: prevent carry-over. AskUser(); // 2018-01-25: for yes-or-no query; return; // 2018-01-25: abandon the rest of EnThink() } // 2018-01-25: end of test to trigger asking a question. abort = false; // 2018-01-20: document.all.cosmos.innerHTML = ""; // 2018-01-04: blank out lower screen. if (nucon > 0) { // 2018-01-23: if a new noun is encounter in NewConcept() SpreadAct(); // 2018-01-23: to activate concepts for a question. nucon = 0; // 2018-01-23: reset for safety. pov = 2; // 2018-01-23: give human user a "pause" for input... return; // 2018-01-23: after question abandon rest of function. } // 2018-01-23: end of test for the condition of input of a new concept. if (quiet == true || quiet == false) { // 2018-06-11: temporary laissez-faire... pov = "1"; // 2018-01-20: internal point-of-view for thinking. output = ""; // blank out the output of the previous thought; outputplus = ""; // blank out the display of the previous thought. t = (t + 1); // 2018-10-14: skip one time-point before edge="{" audMemory[t].audExam(); // 2018-10-12: ReJuvenate test; audMemory[t] = new audNode("{",aud1,aud2); // 2018-10-12 Indicative(); // 2018-01-20: think in the indicative mood. } // 2018-01-20: // 2018-01-20: end of test for absence of user input. if (etc > 1) { // 2019-02-18: if multiple thoughts are active... ConJoin(); // 2019-02-12: insert a conjunction; Indicative(); // 2019-02-12: think in the indicative mood. } // 2019-02-12: join multiple thoughts together. if (rsvp > -1) { // 2018-05-20: and if there is no input... rsvp = (rsvp - 100); // 2018-05-20: decrement rsvp-wait in absence of input if (rsvp < 0) rsvp = 0; // 2018-05-20: disallow negative "rsvp". } // 2018-05-20: end of test for lack of input as reason to speed up thinking. for (i = 1; i<(rsvp+100); i++) { // 2018-05-20: delay for user to respond to output if (i > 1) { apb = "Rejuvenations = "+rjc+ "; time = "+t+"; isolation = "+isolation; Voice() } document.all.mouth.innerHTML = outputplus; // 2018-12-09: show output while waiting... } // 2018-05-20: end of delay to give time for user input. conj = 0; // 2018-06-03: prevent carry-over. dunnocon = 0; // 2019-09-20: reset outside of SpreadAct() to prevent carry-over. etc = 0; // 2019-02-18: reset the flag that triggers a conjunction. quiet = true; // 2018-06-11: after AI responds to input, things quiet down. subjnom = 0; // 2018-06-11: prevent carry-over. whatcon = 0; // 2019-09-20: reset outside of SpreadAct() to prevent carry-over. } // 2018-01-20: EnThink() returns to the FreeWill Volition() module. function RuThink() { // http://ai.neocities.org/RuThink.html RuNounPhrase(); // 2018-06-05: tentative preparation for thinking in Russian. RuVerbPhrase(); // 2018-06-05: tentative preparation for bilingual AI. } // End of stub-only RuThink(); return to Volition(); // 2018-06-05 function Volition() { // http://ai.neocities.org/Volition.html apb = "Volition has been called and life = "+life; // 2018-01-21: more informative Voice(); // Emotion(); // 2018-03-17: so emotions may influence otherwise rational thought. if (isolation > 3) whoq = 1; // 2019-03-03: if no input for a long time... if (whoq == 1) { // 2019-03-03: if waiting to ask a who-question... // if (isolation == 0) { // 2019-03-03: if user ends "isolation" if (isolation < 2) { // 2019-03-03: if user ends "isolation" AskUser(); // 2019-03-03: call module to ask a who-question. whoq = 0; // 2019-03-03: reset for safety. isolation = 0; // 2019-03-03: reset } // end of test for commencement of user input. } // 2019-03-03: end of test for a positive flag to ask a question. if (life == true) { // 2018-01-21: when user checks "Halt", stop thinking. EnThink(); // 2017-12-31: think in English. } // 2018-01-21: end of test for "life" status. // Motorium(); // 2018-03-17: so that emotion and thought may initiate actions. } // 2018-01-20: FreeWill Volition() module returns to MainLoop() function MindMeld() { // 2018-01-14 // 2018-01-14: stubbed in for AI Mind Maintainers to consider. } // MindMeld() will return to... function MetEmPsychosis() { // 2018-01-14 // 2018-01-14: stubbed in for AI Mind Maintainers to consider. // 2018-01-15: feasible in Perl, etc., but not in JavaScript. } // MetEmPsychosis() will return to... function Motorium() { // 2018-01-14 // 2018-01-14: stubbed in for AI Mind Maintainers to consider. } // Motorium() will return to Volition() function Diagnostic() { psiList(); // 2019-07-31: show the array of conceptual flag-panels. audList(); // 2019-07-31: show some contents of the auditory memory channel. if (trouble == true) { document.all.tabula.innerHTML = ""; document.all.psicolumn.innerHTML = psidata; document.all.audcolumn.innerHTML = auddata; } html = ""; psidata = ("<b>" + "Concepts with associative tags for "); // 2018-01-16 psidata += ("Natural Language Understanding:" + "<\/b>" + "<BR>"); psidata += ("krt tru psi hlc act mtx jux pos dba num mfn "); // 2019-07-26 psidata += ("pre seq tgn tdt tkb tia tcj tdj tdv tpr rv"); // 2019-07-31: expanded auddata = ("<b>" + "Auditory memory nodes" + "<\/b>" + "<BR>"); auddata += ("krt pho act audpsi"); // 2018-01-16 } // 2019-07-31: Diagnostic() returns to human-computer interface HCI(). function HCI() { // http://mind.sourceforge.net/hci.html if (document.all["cb3"].checked == true) { document.all["cb1"].checked = false; document.all.souvenir.innerHTML = ""; document.all["cb2"].checked = false; tutor = false; trouble = true; fyi = 3; } if (document.all["cb3"].checked == false) { document.all.tabula.innerHTML = ""; document.all.psicolumn.innerHTML = ""; document.all.audcolumn.innerHTML = ""; trouble = false; } if (document.all["cb1"].checked == true) { document.all["cb2"].checked = false; document.all["cb3"].checked = false; document.all.tabula.innerHTML = ""; document.all.psicolumn.innerHTML = ""; document.all.audcolumn.innerHTML = ""; trouble = false; hardcopy = true; fyi = 1; now = new Date(); adcopy=("<font size='+2'>AI Mind version "+vrsn+" on " +now+"<\/b><\/font>"); document.all.souvenir.innerHTML = adcopy; } if (document.all["cb1"].checked == false) { document.all.souvenir.innerHTML = ""; hardcopy = false; document.all.tabula.innerHTML = ""; } if (hardcopy == true) { if (userline != "" || output != "" ) { Transcript(); } } if (document.all["cb2"].checked == true) { document.all["cb1"].checked = false; document.all.souvenir.innerHTML = ""; hardcopy = false; document.all["cb3"].checked = false; document.all.tabula.innerHTML = ""; document.all.psicolumn.innerHTML = ""; document.all.audcolumn.innerHTML = ""; trouble = false; tutor = true; fyi = 2; } if (document.all["cb2"].checked == false) { tutor = false; if (fyi == 2) fyi = 0; } if (trouble == true) { Diagnostic(); } if (life == true) { document.forms[1].ear.focus(); } } // 2018-01-21: HCI() returns to SeCurity module. function SeCurity() { HCI(); // 2018-01-18: Human Computer Interfact if (t > 160) nonce = vault; // Diagnostic display of all thought. // nonce = 381; // to view innate KB for testing; 19oct2012 // nonce = 1; // show changes being made to EnBoot; 25oct2012 nonce = vault; // for quicker loading; 25oct2012 if (t > (cns-64)) ReJuvenate(); if (life == true) { apb=("AI Mind at t="+t+" is alive on cyc #"+rjc+" since " +dob+ "."); // 2018-09-21 if (t > (cns-32)) { apb = "WARNING! Consider clicking Refresh. "; apb += ("Only " + (cns-t) + " spaces are left."); } Voice(); } else { apb=("<font color='red'>"+"Mental function suspended."+"<\/font>"); Voice(); } } function MainLoop() { // http://ai.neocities.org/MainLoop.html isolation++; // 2018-10-03: increment incentive for Imperative() SeCurity(); tpu = t; // 2019-02-18: isolate tpu from later input-and-output. Sensorium(); // 2018-01-18: brain = true; Volition(); // 2018-01-15: in conformance with modern ghost.pl AI if (life == true) { TID=window.setTimeout("MainLoop();",10000); } } // 2018-01-20: End of MainLoop. </script></head>  <body bgcolor="<a class="attribute-value">white</a>" onKeyUp="<a class="attribute-value">if(event.keyCode==9) Tab();</a>" onLoad="<a class="attribute-value">MindBoot()</a>"> <a name="<a class="attribute-value">top</a>"></a> <fieldset> <legend><font color="<a class="attribute-value">navy</a>"><b> AI Mind Control Panel (requires <a href="<a class="attribute-value" href="view-source:http://en.wikipedia.org/wiki/Internet_Explorer">http://en.wikipedia.org/wiki/Internet_Explorer</a>" title="<a class="attribute-value">Microsoft Internet Explorer</a>" style="<a class="attribute-value">text-decoration:none;</a>"> MSIE</a>) - <a href="<a class="attribute-value" href="view-source:http://ai.neocities.org/perlmind.txt">http://ai.neocities.org/perlmind.txt</a>" title="<a class="attribute-value">Ghost thinks in English and in Russian.</a>" style="<a class="attribute-value">text-decoration:none;</a>"> bilingual ghost.pl</a> - <a href="<a class="attribute-value" href="view-source:http://ai.neocities.org/NLU.html">http://ai.neocities.org/NLU.html</a>" title="<a class="attribute-value">Natural Language Understanding</a>"> NLU</a> - <a href="<a class="attribute-value" href="view-source:http://ai.neocities.org/theory.html">http://ai.neocities.org/theory.html</a>" title="<a class="attribute-value">theory of cognitivity for artificial intelligence</a>" style="<a class="attribute-value">text-decoration:none;</a>"> Theory</a> - <a href="<a class="attribute-value" href="view-source:http://www.amazon.com/dp/B08NRQ3HVW">http://www.amazon.com/dp/B08NRQ3HVW</a>" title="<a class="attribute-value">Artificial Intelligence in Ancient Latin</a>"> Latin AI</a> - <a href="<a class="attribute-value" href="view-source:http://ai.neocities.org/Dushka.html">http://ai.neocities.org/Dushka.html</a>" title="<a class="attribute-value">Requires MSIE and keyboard set to Cyrillic</a>"> Russian AI</a> </b> </font></legend> <form name="<a class="attribute-value">modes</a>"> <input type="<a class="attribute-value">checkbox</a>" name="<a class="attribute-value">cb1</a>" onClick="<a class="attribute-value">Transcript()</a>" checked> Transcript <input type="<a class="attribute-value">checkbox</a>" name="<a class="attribute-value">cb2</a>" onClick="<a class="attribute-value">Tutorial();</a>"> Tutorial <input type="<a class="attribute-value">checkbox</a>" name="<a class="attribute-value">cb3</a>" onClick="<a class="attribute-value">HCI();</a>"> Diagnostic <input type="<a class="attribute-value">checkbox</a>" name="<a class="attribute-value">cb4</a>" onClick="<a class="attribute-value">Shutdown();</a>"> <font color="<a class="attribute-value">fuchsia</a>"><b>HALT</b></font> <input type="<a class="attribute-value">checkbox</a>" name="<a class="attribute-value">cb5</a>" onClick="<a class="attribute-value">Destroy();</a>"> <font color="<a class="attribute-value">red</a>"><b>Terminate</b></font> (close window)<br /> </form> </fieldset> <div id="<a class="attribute-value">mouth</a>" style="<a class="attribute-value">position:static; background-color:silver; height:35</a>"> When thinking begins, enter your input below. <br /> If this message remains here, the AI has failed to load. </div> <form onSubmit="<a class="attribute-value">if (this.submitted) return true; else {CR(); return false;};</a>"> <b>Press any numeric key and ask the Ghost in the Machine: what do you feel</b><br /> <input type="<a class="attribute-value">text</a>" name="<a class="attribute-value">ear</a>" value="<a class="attribute-value"></a>" size="<a class="attribute-value">80</a>" onKeyDown="<a class="attribute-value">AudListen()</a>"> </form> <div id="<a class="attribute-value">brain</a>" style="<a class="attribute-value">position:static; background-color:lightgreen</a>"> Informative messages will appear here. </div> <noscript> <p>The Robot AI Mind requires Microsoft Internet Explorer <br /> with JavaScript enabled.<br /></p></noscript> <div id="<a class="attribute-value">souvenir</a>" style="<a class="attribute-value">position:static; width:640; background-color:lightyellow</a>"> Offer to install the JavaScript Ghost AI on websites and to be the AI Mind Maintainer </div> <div id="<a class="attribute-value">tabula</a>" style="<a class="attribute-value">position:static; width:640; background-color:clear</a>"> Unclick Diagnostic prior to clicking on Transcript. </div>  <div id="<a class="attribute-value">psicolumn</a>" style="<a class="attribute-value">position:absolute; left:1; top:310; width:460; height:140; background-color:clear</a>">  </div> <div id="<a class="attribute-value">audcolumn</a>" style="<a class="attribute-value">position:absolute; left:480; top:310; width:160; height:140; background-color:clear</a>"> </div> <div id="<a class="attribute-value">cosmos</a>"> <font color="<a class="attribute-value">navy</a>"><strong><pre> Subject associates to verb. Verb associates to object. Object free-associates. |--------------------------| |--------------------------| |----------------------| | CATS associates to CHASE | | EAT associates to BUGS | | FISH activates CATCH | | CATS associates to LOVE | | EAT associates to +FISH | | FISH activates LIKE | | CATS associates to HATE | | EAT associates to BIRDS | | FISH activates EAT | | CATS associates to EAT | -------------------------- | FISH activates CHASE | | CATS associates to NEED | | FISH activates AVOID | -------------------------- --------------------- </pre></strong></font></div> </body> </html></pre><menu type="context" id="actions"><menuitem id="goToLine" label="Go to Line…" accesskey="L"></menuitem><menuitem id="wrapLongLines" label="Wrap Long Lines" type="checkbox"></menuitem><menuitem id="highlightSyntax" label="Syntax Highlighting" type="checkbox" checked="true"></menuitem></menu></body></html>

Drag mouse to navigate.

Navigation

Left/Right Mouse drag: Changes camera heading.
Up/Sown Mouse drag: Changes camera pitch.
Scroll wheel: Changes camera field of view.
I-Key: Displays Info panel with canvas size, image size and FPS.

17.Aug.2010, Martin Wengenmayer

koh5_pano

Navigation