Functional Unification Grammar: a formalism for machine translation
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Language As a Cognitive Process: Syntax
Language As a Cognitive Process: Syntax
Re-usable tools for precision machine translation
COLING-ACL '06 Proceedings of the COLING/ACL on Interactive presentation sessions
Generated narratives for computer-aided language teaching
eLearn '04 Proceedings of the Workshop on eLearning for Computational Linguistics and Computational Linguistics for eLearning
Hi-index | 0.00 |
Computational semantics has become an interesting and important branch of computational linguistics. Born from the fusion of formal semantics and computer science, it is concerned with the automated processing of meaning associated with natural language expressions [2]. Systems of semantic representation, hereafter referred to as semantic formalisms, exist to describe meaning underlying natural language expressions. To date, several formalisms have been defined by researchers from a number of diverse disciplines including philosophy, logic, psychology and linguistics. These formalisms have a number of different applications in the realm of computer science. For example, in machine translation a sentence could be parsed and translated into a series of semantic expressions, which could then be used to generate an utterance with the same meaning in a different language [14]. This paper presents two existing formalisms and examines their user-friendliness. Additionally, a new form of semantic representation is proposed with wide coverage and user-friendliness suitable for a computational linguist.