n+7

Many years ago (I think it was in 2001) I participated in a class about Mathematics & Literature. Beside others the "n+7 method" was presented: You replace in a text each noun with the noun in a dictionary which is 7 places after the original noun, e.g., "a man meets a woman" is transformed to "a mandrake meets a wonder" using the Langenscheidt dictionary.

This repository contains the files I submitted to the Algorithmia Shorties Contest and a version that you can run locally.

###Algorithmia Shorties Contest

Run the following command on your shell to generate the submission:

curl -X POST -d '{"url":"http://www.gutenberg.org/cache/epub/97/pg97.txt", "start":32, "end":551}' -H 'Content-Type: application/json' -H 'Authorization: Simple YOUR_API_KEY' https://api.algorithmia.com/v1/algo/fabianekc/n7

Notes for running this on Algorithmia:

• replace YOUR_API_KEY with your personal API key from your Algorithmia.com account
• running this algorithm with the full text of Flatland costs about 1-2 credits
• executing this algorithm too often per day will block Algorithmia.com from accessing Project Gutenberg for 24 hours

###Local version
Download this repository and run the following command on your shell to generate the submission:

./n7.py '{"url":"http://fsmat.at/~cfabiane/pg97.txt", "start":32, "end":551}'

###Options
The following options are supported:

• url: link to a file to be processed (e.g., "http://www.gutenberg.org/cache/epub/97/pg97.txt")
• h2t: link to a file that is pre-processed by Algorithmia's html2text algorithm (i.e., strip of all html tags) and then n+7 processed
• text: plain text to be processed (e.g., "this is a text")
• dict: dictionary file to use for replacing nouns; the default value is to use the list of nouns provided in this Github repo (the original list of nouns is from http://www.desiquintans.com/nounlist - downloaded on Dec 21s, 2015; I like the idea of a simple list with only the most commonly used but added anyway a few words)
• start: first line to be processed (0 based); default: all lines
• end: last line to be processed (0 based); default: all lines
• offset: number of places after the original noun to use for replacement; default: 7