VMs: RE: Sukhotin Vowel IDs

["Ben Preece" <ben.preece@xxxxxxxxxx>]

Looking at the Jacques' VFQ program, it looks like Sukhotin's algorithm
works like this:

1) reduce all double, triple, etc. letters to single letters.

2) assume the most frequent letter is a vowel.

3) assume the letter which occurs most often in positions NOT adjacent
to a vowel is also a vowel.

4) repeat step 3 until every letter which has not been identified as a
vowel always occurs next to a vowel.

Is this an accurate characterization?

-Ben

-----Original Message-----
From: owner-vms-list@xxxxxxxxxxx [mailto:owner-vms-list@xxxxxxxxxxx] On
Behalf Of Dennis
Sent: Tuesday, March 22, 2005 10:05 PM
To: VOYNICH-L
Subject: VMs: Sukhotin Vowel IDs

	While we are discussing Ben's PFSM vowel identifications, I
thought it might be useful to look at the vowel IDs from the Sukhotin
algorithm which we are used to using.  Gabriel did this, but I am
hosting it for the time being since the EVMT site is down.

http://www.geocities.com/ctesibos/voynich/image/sukhotin.gif

	Here is Jacques' VFQ program which implements the Sukhotin
algorithm:

http://www.geocities.com/ctesibos/francais/voynich/outils/vfq.zip

	Jacques published an article about the Sukhotin algorithm,
"Vowel Identification: An Old (But Good) Algorithm," 
Cryptologia Volume XV Number 3 (July 1991); someone else in "Application
of Sukhotin's Algorithm to Non-English Languages," Cryptologia Volume
XVI Number 2 (April 1992), took a further look at the algorithm's
results.

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


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