17. The method of claim 10 , wherein, in the series of one or more rounds, once a punctuation-mark concept symbol representing a meaning of a punctuation mark has been combined with a concept symbol representing a meaning of an expression preceding the punctuation mark, the punctuation-mark concept symbol is not combined with another punctuation-mark concept symbol representing a meaning of a punctuation mark until the punctuation-mark concept symbols becomes directly adjacent in one of the one or more shortened strings of concept symbols.
10. A method for parsing text in a natural language communication with a computer, the method comprising, by at least one hardware processor: constructing at least one table that represents knowledge defined by one or more model expressions, wherein each of the one or more model expressions comprises a string of language elements, wherein each of the language elements comprises a word or punctuation mark, and wherein constructing the at least one tables comprises, for each of the one or more model expressions, for each language element in the string of language elements of the model expression, including at least one punctuation mark, generating a concept symbol that represents a meaning of the language element, to form a string of concept symbols in a same order as the string of language elements, in a series of one or more rounds, combining one or more pairs of concept symbols in the string of concept symbols into a newly generated concept symbol that represents a meaning of the combined pair of concept symbols, to form one or more shortened strings of concept symbols until a single concept symbol remains that represents a meaning of the entire model expression, and, for each generated concept symbol, storing the concept symbol in its own row in a database; and parsing one or more input expressions, wherein each of the one or more input expressions comprises a string of language elements, wherein each of the language elements comprises a word or punctuation mark, and wherein parsing each of the one or more input expressions comprises identifying rows in the database that corresponds to each language element in the string of language elements of the input expression, including at least one punctuation mark, wherein each row comprises a concept symbol that represents a meaning of the language element, generating a string of concept symbols from the identified rows, in a series of one or more rounds, identifying rows in the database that comprise pairs of concept symbols in the generated string of concept symbols, and replacing the pairs of concept symbols with the concept symbols in the identified rows, to form one or more shortened strings of concept symbols until a single concept symbol remains that represents a meaning of the entire input expression, and providing a response based on the identified row in the database that comprises the single concept symbol.