[om-list] Regular Expressions

[MrM0j0r15n Rajeev the kanehbosm]

greetings tomp,

Yes, reading the email archives, was both insightful and very tedious : it 
is precisely what i DONT want om to be :)

Anyway, your ideas on using a graph formalism is very interesting. 
Especially so, since i remembered something referred to as Unification 
grammars which is similiar to unification algorithm for fopl. It seems UG is 
a very good technique especially if one deals with both NLU & NLG.

The reference is:
Rich and Knight: AI : ISBN 0-07-052263-4
Section 15.2.3 (Natural Language Processing - Unification Grammars)

Also, in many places in the archive, reference is made to some earlier 
emails. any way to get them ?
insane


_________________________________________________________________
Chat with friends online, try MSN Messenger: http://messenger.msn.com