The Computational Dictionary, described in this paper, is structured on a knowledge base. The semantic features of each word, in a relevant grammatical category, can be determined through a hierarchical tree structure. Semantic knowledge of verbs is represented using predicate calculus definitions. This allows each expression, e.g. sentence or command, to be tested in order to determine whether it is meaningful and, if meaningful, what its meaning is or indeed whether it is ambiguous.
In this paper we take a broad look at the likely implications of future developments in machine translation. In order to do this effectively we consider firstly what constitutes machine translation in all its various forms. We then take a number of scenarios which differ in the extent to which machine translation is successful.