Describing My String Segmenting Program

First, call the dictionary using require_relative ‘dictionary’ to help run the following method. Define the method as segment_string and display the word “BEGIN” on the screen.

Set a variable for how many characters are in a string. Set a variable for the starting point of string characters to check, ours will start at zero. Set an ending point of string characters to check until, again ours will start at zero. Set a variable for a skip counter to zero and set a hash to store found words into empty hash.

Display the word “LOOP” on the screen. While the ending point of the characters of the string is not yet equal to how many characters are in the actual string itself, this means you have not reached the end of the string and therefore should proceed with the following:

Display “Checking letters (with the respective starting point) until (the respective ending point).”
Lowercase the string and call the entire span of letters that is being checked (from starting point to ending point) “range”.
Display “Is (respective range) a word?”
Range will be checked using the valid_word? method to see if there is a dictionary entry to match it.
IF there IS a match, meaning valid_word(range) is TRUE then display “Yes” on the screen.
IF valdi_word?(range) is TRUE AND the skip counter is greater than zero, display “Disabled skip for next word”, then subtract 1 from the skip counter.
IF valid_method? is TRUE AND the skip counter is NOT greater than zero then display “Archiving word”. Save the current range to the empty hash variable as a value with a key equal to its ending point, display the collected words of the hash so far, display that the starting point of the range will now be moved up to the last ending point, then make the starting point equal to the ending point.
IF valid_word(range) is NOT TRUE, meaning that it is FALSE AND the ending point is still not yet equal to the length of characters in the string display “Dangler! Removing last word”. Create a new variable and make it equal to the last key of the hash, then delete the last key of the hash (which will also delete the value). Display an update of the words saved in the hash. Make a new variable and set it to the last key still contained in the hash.
IF the last key still contained in the hash is nothing display that the hash is empty now and reset the starting point and ending point to 0.
IF the last key still contained inside the hash is NOT nothing then make that key the new starting point and display that we are now starting from the respective point in the string. Move the ending point back to be equal to the starting point.
IF the ending point is equal to the length of characters in the string and the range is NOT a valid word, display that skip is now in effect and increase the skip counter by 1.
No matter if the range is a match or not always the ending point must increase by 1.
Display that the loop is complete and return the words collected in the hash.