jound

Word generator using a Markov chain

Project description

Jound is a Python program which can invent new words from the analysis of a list of words.

It can analyze a text and assemble all words it contains to a file. This list of words can then be analyzed in order to generate a statistical file which records the number of occurrences of each letter after a particular combination of two letters. Finally, the statistical file can be used in order to generate words using a Markov chain.

>>> jound assemble Moby_Dick.txt
[jound] INFO: Assemble words from target: Moby_Dick.txt
[jound] INFO: Writing 7756 words to ./words.txt

>>> jound analyze words.txt
[jound] INFO: Generate statistics from target: words.txt
[jound] INFO: Writing statistics to ./stats.bin

>>> jound generate 10 -s stats.bin
gook
shancity
ruts
woure
duchic
appermoven
speriatrawk
gantinge
faltch
jound

This project was inspired by this excellent article: La machine à inventer des mots (in French)

Project details

Release history Release notifications | RSS feed

This version

0.1.0

Nov 13, 2017

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

jound-0.1.0.tar.gz (8.8 kB view details)

Uploaded Nov 13, 2017 Source

File details

Details for the file jound-0.1.0.tar.gz.

File metadata

Download URL: jound-0.1.0.tar.gz
Upload date: Nov 13, 2017
Size: 8.8 kB
Tags: Source
Uploaded using Trusted Publishing? No

File hashes

Hashes for jound-0.1.0.tar.gz
Algorithm	Hash digest
SHA256	`9a2321fb5b087d2cade62a91f42cbacae756200bc38ade1786ee4b67cf202b16`
MD5	`13e3371379291132da3a8eb36dcd65c8`
BLAKE2b-256	`eb34808d274a83a0693976ca2339d699b5d4c8a5ef1b23b99a9d78e8a8ff9b41`