Re: VMs: RE: VMs word models --> state machines...?

[Rene Zandbergen <r_zandbergen@xxxxxxxxx>]

Hi!

Looks interesting to me.

The main thing to keep in mind is that the critical
decision to make is the transcription alphabet
used for the text you feed in the process. Since
most files you may find are in Eva, this is of course
the easiest thing to do. Now what you may be
analysing at that point, using your tool, could
be which Eva characters
should be taken together to form one VMs 
'character'.  For example, it seems likely that
the sequences "in" and "iin" should be considered
one character, and likewise for "ch" and "sh".

There are tools available to translate the text
to other transcription alphabets, e.g. Curriers,
or it is even easy to define your own.
It is important to experiment and compare the 
results since nobody really knows what is the
right transcription of the VMs. Or perhaps someone
(thinks that he) does know, but can't prove it.

Other decisions to make are whether to include
the labels or to treat them separately.

In short, be critical of the data you use.

Cheers, Rene

--- Ben Preece <ben.preece@xxxxxxxxxx> wrote:
> 
> 
> Hello.  I've only been a lurker here so far, but
> may(?) now have
> something relevant to say ... I've kludged up a Java
> app that uses
> evolution and measures information to find a
> best-fit FSM for input
> text, and run it on the VMs.  I'll share the app and
> my "results" with
> anyone who's interested.
> 
> -Ben
>  
> 
> -----Original Message-----
> From: owner-vms-list@xxxxxxxxxxx
> [mailto:owner-vms-list@xxxxxxxxxxx] On
> Behalf Of Nick Pelling
> Sent: Friday, February 25, 2005 4:40 PM
> To: vms-list@xxxxxxxxxxx
> Subject: VMs: VMs word models --> state machines...?
> 
> Hi everyone,
> 
> I'm planning to extend my JavaScript VMs code to
> handle various
> well-known VMs "word" models, to measure how well
> they actually work
> relative to each other - as my code already uses a
> state machine, it
> should just be a question of converting each
> paradigm to its implicit
> state machine, letting it run, & gathering
> statistics.
> 
> But rather than reinvent the wheel, may I ask if
> anyone has already
> tried to turn VMs word models into state machines? I
> don't recall seeing
> anything, but there may be something somewhere...
> 
> For example, I just tried to do this for Michael
> Winkelmann's recent
> model, but my poor German comprehension has left me
> a little bemused -
> can someone get me properly started?
> 	http://elias.weltretter.de/index.php?txt_id=45
> 
> AIUI, this says:-
> 
> I-class			i	n	r	l	m
> E-class		e	o	s	y	g
> K-class (gallows)	k	t	f	p
> L-class		ih	ch	cfh		[+ sh ?]
> X-class (exceptions)	a	q
> 
> Law#1:	E follows (E / ch / K / a)
> Law#2:	I follows (I / L)
> Law#3:	I (except i) usually terminates a word
> Law#4:	E (except e  [or "o" too?] ) usually
> terminates a word
> Law#5:	[Not sure about this one - any suggestions?]
> Law#6:	[Not sure about this one either - any
> suggestions?]
> Law#7:	K-class is nearly always surrounded by
> E-class, or as c[K]h
> 
> The absence of "d" is puzzling: should the final
> E-class "g" actually be
> "d"? This could just be a typo in the table. I'm far
> from sure about
> "ih" 
> as well, & the whole issue of c[K]h seems not to
> fully match how they
> appear in the text IIRC... etc etc.
> 
> Thanks, .....Nick Pelling.....
> 
> 
>
______________________________________________________________________
> 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
> 


	
		
__________________________________ 
Celebrate Yahoo!'s 10th Birthday! 
Yahoo! Netrospective: 100 Moments of the Web 
http://birthday.yahoo.com/netrospective/
______________________________________________________________________
To unsubscribe, send mail to majordomo@xxxxxxxxxxx with a body saying:
unsubscribe vms-list