... initially to be uniform2. for several iterations do:a. set up a count(, ) table with zero entriesb. for = 1 toQ[ ,1] = b( boundary)c. for = 2 to for = 1 toQ[ , ] = 0 for = 1 toQ[ , ] += ... 1 toQ[ , ] += Q[ , ] b( ) s( )d. for = 1 toR[ , ] = b(boundary )e. for = to 1 for = 1 toR[ , ] = 0 for = 1 toR[ , ] += R[ , ] b( ) s( )f. for = 1 to for = 1 tocount( , ) += Q[ , ] R[ ... 499–506,Sydney, July 2006.c2006 Association for Computational LinguisticsUnsupervised Analysis for Decipherment ProblemsKevin Knight, Anish Nair, Nishit RathodInformation Sciences Instituteand Computer...