[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: VMs: Is this any good ?

*WoW* :-)

and I thought my thoughts got convoluted (post ES). IT IS SIMPLER than
you think!!!!  Think ~OLDE~ (ok?) & think quill & vellum (paper) think
Think THINK how to make a CODE 'they could use'!  _Folding_ 
(vellum)(e.g. hidden under rock(s) #2, # 5...? etc.) is step #1

FOLD your KEY(s) to decode.

WithOUT the fold you will *see* changes @ EVERY gallows, that appear
to be different languages. To not lose your path, AT LEAST FOLLOW THE
GALLOWS to see the KEY!

Many here on the list are "thinking TOOOOOO Hard", IT's simplier than
one thinks it is! :-)

Best to you & yours
HapPy ThAnKsGiViNgS DaY (USA - all)!
Give Thanks Daily the rest of you ! :- )
steve (3x3 8x8, 9x9? (x8)) ekwall


 Date: Thu, 13 Nov 2003 19:25:42 +0100
 From: PK#01 <pklist01@xxxxxxxxx>
 Reply-To: vms-list@xxxxxxxxxxx
 To: vms-list@xxxxxxxxxxx
 Subject: VMs: Is this any good ?
 I've written two mails to Mr. Parpola about his algorithm but got no reply
 (yet). I'm looking for other ideas in this field. Do you think this is any
 good? I'm not a computational linguist but I can write a program if
 necessary. Should I carry on searching in this direction?
 Abstract. The paper deals with the linguistic problem of fully automatic
 grouping of semantically related words. We discuss the measures of semantic
 relatedness of basic word forms and describe the treatment of collocations.
 Next we present the procedure of hierarchical clustering of a
 very large number of semantically related words and give examples of
 the resulting partitioning of data in the form of dendrogram. Finally we
 show a form of the output presentation that facilitates the inspection of
 the resulting word clusters.

To unsubscribe, send mail to majordomo@xxxxxxxxxxx with a body saying:
unsubscribe vms-list