Matt Mahoney wrote:
Mark, I didn't get your attachment, the program that tells me if an
arbitrary text string is in canonical form or not. Actually, if it
will make it any easier, I really only need to know if a string is a
canonical representation of Wikipedia.
Oh, wait... there can only be one canonical form. I guess then all
you have to do is store the canonical form and compare the input with it.
...
Sorry, there can be many cannonical forms. Given a PARTICULAR
cannonical representation rule-set, any particular instance can only
have one representation. Just as an example of what I mean, both Polish
and reverse-Polish are cannonical forms given operators that do not
allow commutativity. You can apply both to "append A to B" and end up
with the different strings:
1) append A B
2) B A append
An only slightly different rule-set could yield
3) A B append
Thus we have three cannonical forms for the same simple phrase given
only trivially different transformation rules.
-------
To unsubscribe, change your address, or temporarily deactivate your subscription,
please go to http://v2.listbox.com/member/[EMAIL PROTECTED]
