Latest update April 1, 2015.
To prevent spambots from collecting mail addresses, all mail addresses on this page have the "@" replaced by "#".
The task of this laboration is to implement some extremely rudimentary natural language processing. Your program will read strings from the console or a text file, interpret these strings as lists of words, and parse the lists of words as sentences. The sentences are to be represented in symbolic form, in order to make possible some high-level processing of them.
More specifically, we have the following restrictions:
Your system should not be case-sensitive: it must recognize words written in any mix of upper- and lower-case letters. However, sentences should be output in proper format, with the first letter in the first word capitalized and the rest in lower-case. Claims, when written by your system, should be terminated by a period, and questions with a question mark. Input sentences, however, should be recognized as claims or questions regardless of how they are terminated.
You decide the rules for how to transform a string into a list of words. However, your decision must be sensible, and you must be able to motivate it.
Now write a program that does the following:
The program should (of course) also terminate when reaching end-of-file while reading input from a file.
Think carefully about how to structure your solution into different functions, and how to represent sentences symbolically.
Hints: System.Console.ReadLine() : string reads a line from the console. The properties .ToLower() and .ToUpper() on strings can also come in handy.