Develop a program that applies the process called “stemming” with the requirements listed below:
1 - A file must be read and tokenized according to space character (hint : fscanf, malloc)
2 – Stemming rules must be applied if the keyword is suitable (length of word must be greater than length of rule). If one of the rules is applied, then rest of the rules shouldn’t be evaluated.
SSES -> SS (e.g. caresses -> caress)
IES -> I (e.g. ponies -> poni)
SS -> SS (caress -> caress)
S -> (e.g. cats -> cat)
3 – Stemmed words must be written to a file
4 – Your system must be case-insensitive
5 – Argument parser: design your program to make user able to use from command prompt
(Format: [url removed, login to view] –i [url removed, login to view] –o [url removed, login to view])
6 – Abstraction of rule function: design your program to use one function to evaluate each rule by passing rule as argument.
7- There must be comments to explain codes which how they works