Next, it finds all other chunks in which the first 2 characters match the last 2 characters of the initial chunk &emdash if it started out with maf, it would look for all chunks starting with af to see how often each one appears in the original source text: To generate a word, the script picks a random 3-letter chunk to start with. A tally is kept of how often each 3-letter chunk occurs in the text. Given the word explain, it would get the "chunks" exp, xpl, pla, lai, and ain. The sample text is broken up into individual words, and then each word is broken up into overlapping 3-letter chunks. The words are generated based on the frequency with which any given sequence of characters occurs in a language, based on data from a sample text (for example, for English, I used the full text of a public domain novel from Project Gutenberg).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |