« Return to Thread: Order of the match path components
Re: Order of the match path components
by Dr. Rich Wallace
::
Rate this Message:
Helio, I think there is no good reason except that's how the architecture
commmittee decided the standard, based on the existing early AIML
interpreters. We've kept it that way for compatibility. One idea that's
been discussed over the years is to generalize the <pattern,that,topic>
triple to a botmaster-defined infinite number of pattern-contexts, which
could include concepts such as bot name, mood, state, personality and so
on. There is in principle no reason the botmaster should not be allowed
to redefine the order as well as the number of levels of matching.
Note that it isn't necessarily true that the graph has to take up a lot of
memory when the "topic" and "that" are both "*", because one could
compress these paths with a special terminal node.
> The AIML standard states [1] that "an AIML interpreter
> must construct a match path from each category at
> load-time", and that "a match path has three
> components, whose order is mandatory": (pattern),
> (that) and (topic).
>
> My question is, what is the rationale behind this
> ordering? To me it looks the inverse would be a more
> efficient option. So long most categories have unset
> (topic) and (that) sections (something that is
> probably true for most AIML sets), a match path of the
> form:
>
> TOPIC ELEMENTS (TOPIC) THAT ELEMENTS (THAT) PATTERN
> ELEMENTS
>
> Would allow for more compact match graphs, since all
> topic-less, that-less categories would be placed under
> the same root node. Of course, this arrangement would
> cause the repetition of equivalent pattern elements
> from categories under different (topic) and/or (that)
> sections; but so long the number of unique (topic,
> that) pairs remained slow, this would be more than
> compensated by the savings.
>
> Am I missing something here?
>
> [1]
> http://www.alicebot.org/TR/2005/WD-aiml/#section-load-time-match-path-construction
>
> --
> Ja mata ne.
> Helio Perroni Filho
>
>
>
>
>
>
>
>
>
> _______________________________________________________
> Yahoo! Acesso Grátis: Internet rápida e grátis.
> Instale o discador agora!
> http://br.acesso.yahoo.com/
>
> _______________________________________________
> alicebot-developer mailing list
> alicebot-developer@...
> http://list.alicebot.org/mailman/listinfo/alicebot-developer
--
Dr. Rich
W A L L A C E
ALICE A.I. Foundation
drwallace@...
Winner, Loebner Prize 2000, 2001, 2004
_______________________________________________
alicebot-developer mailing list
alicebot-developer@...
http://list.alicebot.org/mailman/listinfo/alicebot-developer
commmittee decided the standard, based on the existing early AIML
interpreters. We've kept it that way for compatibility. One idea that's
been discussed over the years is to generalize the <pattern,that,topic>
triple to a botmaster-defined infinite number of pattern-contexts, which
could include concepts such as bot name, mood, state, personality and so
on. There is in principle no reason the botmaster should not be allowed
to redefine the order as well as the number of levels of matching.
Note that it isn't necessarily true that the graph has to take up a lot of
memory when the "topic" and "that" are both "*", because one could
compress these paths with a special terminal node.
> The AIML standard states [1] that "an AIML interpreter
> must construct a match path from each category at
> load-time", and that "a match path has three
> components, whose order is mandatory": (pattern),
> (that) and (topic).
>
> My question is, what is the rationale behind this
> ordering? To me it looks the inverse would be a more
> efficient option. So long most categories have unset
> (topic) and (that) sections (something that is
> probably true for most AIML sets), a match path of the
> form:
>
> TOPIC ELEMENTS (TOPIC) THAT ELEMENTS (THAT) PATTERN
> ELEMENTS
>
> Would allow for more compact match graphs, since all
> topic-less, that-less categories would be placed under
> the same root node. Of course, this arrangement would
> cause the repetition of equivalent pattern elements
> from categories under different (topic) and/or (that)
> sections; but so long the number of unique (topic,
> that) pairs remained slow, this would be more than
> compensated by the savings.
>
> Am I missing something here?
>
> [1]
> http://www.alicebot.org/TR/2005/WD-aiml/#section-load-time-match-path-construction
>
> --
> Ja mata ne.
> Helio Perroni Filho
>
>
>
>
>
>
>
>
>
> _______________________________________________________
> Yahoo! Acesso Grátis: Internet rápida e grátis.
> Instale o discador agora!
> http://br.acesso.yahoo.com/
>
> _______________________________________________
> alicebot-developer mailing list
> alicebot-developer@...
> http://list.alicebot.org/mailman/listinfo/alicebot-developer
--
Dr. Rich
W A L L A C E
ALICE A.I. Foundation
drwallace@...
Winner, Loebner Prize 2000, 2001, 2004
_______________________________________________
alicebot-developer mailing list
alicebot-developer@...
http://list.alicebot.org/mailman/listinfo/alicebot-developer
« Return to Thread: Order of the match path components
| Free Forum Powered by Nabble | Forum Help |