Word Parifier

A script to generate pairs of random words.
Explore the docs »

View Demo · Report Bug · Request Feature

I needed a list of random word pairs. So I wrote this. It ain't much, but it's not nothing.

(back to top)

• Python
• Funny Words

(back to top)

This is an example of how you may give instructions on setting up your project locally. To get a local copy up and running follow these simple example steps.

This is an example of how to list things you need to use the software and how to install them.

• pip

  pip install funny-words

1. Clone the repo

   git clone https://github.com/obverter/word-parifier.git

2. Profit

(back to top)

$python word-parifier.py

You'll be asked to specify:

• The number of words you'd like in each set.
• The number of sets you'd like to generate
• A filename for the output .csv. (e.g.{banana}) ==> banana.csv

(back to top)

• Specify parts of speech to be used for each item in a set.
• Specify number of syllables to be used for each item in a set.

See the open issues for a full list of proposed features (and known issues).

(back to top)

Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.

If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement". Don't forget to give the project a star! Thanks again!

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

(back to top)

Distributed under the MIT License. See LICENSE.txt for more information.

(back to top)

Ben Elliott - @obverter - [email protected]

Project Link: https://github.com/obverter/word-parifier

(back to top)

• Funny Words — At the moment, this script is little more than a wrapper over this library.

(back to top)