This paper presents a semantic parsing and reasoning approach to automatically solving math word problems. A new meaning representation language is designed to bridge natural language text and math expressions. A CFG parser is implemented based on 9,600 semi-automatically created grammar rules. We conduct experiments on a test set of over 1,500 number word problems (i.e., verbally expressed num...

“Grounded” language learning employs training data in the form of sentences paired with relevant but ambiguous perceptual contexts. Börschinger et al. (2011) introduced an approach to grounded language learning based on unsupervised PCFG induction. Their approach works well when each sentence potentially refers to one of a small set of possible meanings, such as in the sportscasting task. Howev...

In this paper we present an automatic testing process to validate Avionic Systems. To do that, we have developed a tool that interprets scripts written in Automated Test Language and translate them to user codes written in C language. To carry out this work, the syntax of scripts has been defined by a context free grammar. This testing process is based on the execution of a pre-defined set of t...

Let A be a finitely generated semigroup with 0. An A–module over F1 (also called an A–set), is a pointed set (M, ∗) together with an action of A. We define and study the Hall algebraHA of the category CA of finite A–modules. HA is shown to be the universal enveloping algebra of a Lie algebra nA, called the Hall Lie algebra of CA. In the case of the 〈t〉 the free monoid on one generator 〈t〉, the ...