Unique Words Counter by Binary Search Tree

Counting Unique Words in the given txt files by using Binary Search Tree

Content

• Description
• How to use
• Results

Description

The main aim of the program is to count certain keys in the given txt files. These keys are:

• Lines
• Symbols
• Words
• Unique Words

Program reads all txt files in the given directory. Symbols are considered as all characters including punctuations, spaces are not counted. Unique words are not case sensitive.

Collecting Unique words are implemented by Binary Search Tree, where also frequencies of Unique words are counted.

How to use

• It is possible to run the file in Terminal Window or Anaconda Prompt and use argument -p specifying path to the directory where txt files will be read by program. By default program reads directory tests that is next to the main Python file. Run follwing: python words_count_Python.py -p /home/my_name/Downloads/txt_files

• One more way is to import program as utility for instance in Jupyter notebook.

• And of course, any Python IDE is as standard option.

Results

As a result, program prints following (example):
Total lines = 4
Total symbols = 111
Total words = 22
Total unique words = 19

Final results, are written into the file results.txt next to the main Python file, where also Unique words with frequencies are written as shown below.

Also, Bar Charts are plotted as shown below.
Pay attention! If there are a lot of Unique words they will not be visible on the plot.

MIT License

Copyright (c) 2019 Valentyn N Sichkar

github.com/sichkar-valentyn

Reference to:

Valentyn N Sichkar. Unique Words Counter by Binary Search Tree // GitHub platform. DOI: 10.5281/zenodo.3558757