From: Regis d'Aubarede <lists@...>
Date: 2013-03-30T23:59:11+09:00
Subject: Re: Translation Project

> It would need to compare the possible combinations to
> a dictionary, which would be ranked on the most probable words

This can help you:

http://raubarede.tumblr.com/rubyresume.html#c15
http://blog.invisible.ch/2005/01/15/markov-chains-in-ruby/


BA CACAAADBCC ADD ADDABCDA, CCC CAD BCCDCDBB CD A CBDD CBAC A ABCDDAC, 
CABD BCCDCDBB CD A CBDD CBAC A CADBCAC
Antoine de Saint-Exupéry

sorry :)

-- 
Posted via http://www.ruby-forum.com/.