hjingyi@unccvax.uncc.edu (Hu Jingyi) (07/08/90)
Dear Sir/Madam :
I have a question about the Levenshtein distance. in "Self-Organization and
Associative Memory" book (page 67, 4 lines) T.Kohonen written:
weighted Levenshtein distance WLD(A,B) = min{pa(i) + qb(i) + rc(i)} (2.93)
where the coefficients p, q, and r may be obtained from the so-called
confusion matrix of the alphabet, as the inverse probability for particular
type of error to occur.
Could you help me to get the p, q, and r confusion matrix of the alphabet?
I want use the distance for some words matching processing application.
Thanks a lot.
Regard
Hu Jingyicsuyk@warwick.ac.uk (FUNG Wai Wa) (07/21/90)
Hi, netters,
Would anyone out there kindly tell me how I can get the following paper?
T. Sejnowski and C.R.Rosenberg
"NETtalk : A parallel Network that learns to read aloud"
Is there a ftp site for it?
Many thanks.
W.W. FUNGshers@masala.lcs.mit.edu (Alex Sherstinsky) (06/02/91)
I am trying to understand Kohonen's 1982 paper in Bio-Cybernetics. I need to understand it urgently ASAP so I can finish writing an exam paper. I thought I understood it, but now realize I am very confused as to how his scheme really works (first 3 figures and first three equations). If someone who knows what I am talking about is willing to help, could you please let me know how to contact you (preferable by phone, since this is really urgent). Thanks very much! -- +-------------------------------+------+---------------------------------------+ |Alexander The Great Sherstinsky|me |shers@masala.lcs.mit.edu|To become as | |Alexander Semyon Sherstinsky |myself|shers@masala.lcs.mit.edu|refined person| |Alex Sherstinsky |I |shers@masala.lcs.mit.edu|as possible. |