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

VMs: RE: RE: Sukhotin Vowel IDs




Knox Mix pointed me to this site:
http://acl.ldc.upenn.edu/C/C73/C73-1017.pdf

I also dug this out of the voynich archives:
http://www.voynich.net/Arch/2001/01/msg00108.html

Thanks,

-Ben 

-----Original Message-----
From: owner-vms-list@xxxxxxxxxxx [mailto:owner-vms-list@xxxxxxxxxxx] On
Behalf Of Ben Preece
Sent: Wednesday, March 23, 2005 4:14 PM
To: vms-list@xxxxxxxxxxx
Subject: VMs: RE: Sukhotin Vowel IDs


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

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