-
Notifications
You must be signed in to change notification settings - Fork 7
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Tillman, Victor Lima, KOD #122
Comments
Latest output; still needs some proof-reading to check for any more malformed sentences in the tables, or unusual formatting in the source text: (54,847 words total.) |
Finished. Final generation: (50,474 words total.) |
Romeo and Juliet has suddenly modernised!
|
I really liked this one!
|
These are so good! |
A trilogy of Shakespeare plays retold through the vocabulary of three historical encoding systems. Each line of the original text is replaced with the translated code message that it is most similar to. (This is calculated using the Levenshtein distance, being the minimum number of letters that must be inserted, changed or removed to get from one sentence to another: eg. "In sooth, I know not why I am so sad" has a distance of 25 from the message "Indiana, Illinois & Iowa", closer than any other sentence in that cipher book.)
Sample output from ''Victor Lima'':
Source code at https://github.com/kevandotorg/nanogenmo-2017
The text was updated successfully, but these errors were encountered: