RSS AI Zone
> http://www.meta-guide.com/home/bibliography/google-scholar/aiml-srai-symbolic-reduction
AIML & SRAI (Symbolic Reduction)
= = =
Note, the following sentences are extracted from the above webpage, reflecting a recent search of Google Scholar:
AIML Symbolic Reduction (SRAI) Technique
AIML is a tail-recursive functional language which is optimized for the semantic processing of strings, where input and output strings are desired to be at the semantic level of sentences in natural language.
The recursive feature of AIML is sometimes called “symbolic reduction” and is abbreviated as “srai” (symbolic reduction artificial intelligence).
This <srai> element can be used to make (a) symbolic reduction, (b) to handling synonyms, (c) to grammatical corrections or (d) to detect key words.
AIML also allows the use of symbolic reduction (SRAI) and wildcards (asterisk “*” and underscore “_”).
The AIML implementation for recursion is the tag <srai>.
The AL-AIML [Affect Listener AIML] set contains 14465 patterns, 15550 response instructions and 6918 srai substitution rules.
The <template> element can be constructed merging more categories together, using the <srai> tag that allows referring to other categories.
Special functions are carried out by the topic, that, and srai tags.
AIML bots support a mechanism for recursive processing via the tag <srai>, which can be instantiated from inside a template.
AIML can also reuse other rules by means of the <srai> tag; however, there is no clear rule structuring since this tag re-launches the evaluation of the whole set of rules for an input reformulation.
Recursive categories have templates including <srai> and <sr> tags, which refer to simply recursive artificial intelligence and symbolic reduction.
A knowledge-base of this kind of chatter-conversational agent is made of pairs of textual/lexical (pattern; template), which can be linked together semantically and/or recursively by means of SRAI connections.
The < srai > tag allows procedures calls and can be used to direct different input patterns to the same exit template.
We started by augmenting the default AIML tag set (including tags such as <srai> and <that>) with two tags: <query>, to seamlessly invoke the core QA module, and <clarify>, to support follow-up detection and resolution.
For instance categories with templates having <srai> or <sr> tags are called recursive categories, which recursively call the pattern matcher to insert the responses from other categories. <srai> and <sr>, which refers to simply recursive artificial intelligence and symbolic reduction are playing critical rules in: reducing complex grammatical forms to simpler ones; splitting an input into two or more subparts, and combines the responses to each; and dealing with synonyms by mapping different ways of saying the same thing to the same reply.
Though posing some risk to novice programmers, we surmised that including <srai> was much simpler than any of the iterative block structured control tags that might have replaced it.
The disagreement over the acronym reflects the variety of applications for <srai> in AIML.
The tag <srai> is designed to recursively find the next pattern.
The <srai> recursion tag is used for several purposes: symbolic reduction; “divide and conquer” (splitting an input into subparts, and combining responses to each of these); finding synonyms; correcting spelling or grammar; and/or conditional branching.
AIML (Artificial Intelligence Markup Language) contains a simple yet powerful XML markup tag called <srai>. The <srai> tag is the symbolic reduction tag. This allows minimalism.
The <srai> tag invokes the recognizer recursively.
But it’s possible that this category may be invoked by another category, using the <srai> tag (not shown) and the principle of reductionism.
[CITATION] Symbolic deduction in Artificial Intelligence Markup Language (AIML)
Symbolic Reductions in AIML, by Dr. Richard S. Wallace http://www.alicebot.org/documentation/srai.html
13.13 Recursion, The Anatomy of A.L.I.C.E. http://publication.wilsonwong.me/paper/233282357.pdf
