tailieunhanh - Báo cáo khoa học: "ON FORMALISMS AND ANALYSIS, GENERATION AND SYNTHESIS IN MACHINE TRANSLATION"

A formalism is a set of notation with well-defined semantics (namely for the interpretation of the symbols used and their manipulation), by means of which one formally expresses certain domain knowledge, which is to be utilised for specific purposes. In this paper, we are interested in formalisms which are being used or have applications in the domain of machine translation (MT). These can range from specialised languages for linguistic programming (SLLPs) in NIT, like ROBRA in the ARIANE system and GRADE in the Mu-system, to linguistic formalisms like those of the Government and Binding theory and the Lexical Functional. | ON FORMALISMS AND ANALYSIS GENERATION AND SYNTHESIS IN MACHINE TRANSLATION Zaharin Yusoff Projek Terjemahan Melalui Komputer PPS. Matematik Sains Komputer Universiti Sains Malaysia 11800 Penang Malaysia Introduction A formalism is a set of notation with well-defined semantics namely for the interpretation of the symbols used and thefr manipulation by means of which one formally expresses certain domain knowledge which is to be utilised for specific purposes. In this paper we are interested in formalisms which are being used or have applications in the domain of machine ttanslation MT . These can range from specialised languages for linguistic programming SLLPs in MT like ROBRA in the ARIANE system and GRADE in the Mu-system to linguistic formalisms like those of the Government and Binding theory and the Lexical Functional Grammar theory. Our interest lies mainly in theừ role in the domain in terms of the ease in expressing linguistic knowledge requừed for MT as well as the ease of implementation in MT systems. We begin by discussing formalisms within the general context of MT clearly separating the role of linguistic formalisms on one end which are more apt for expressing linguistic knowledge and on the other the SLLPS which are specifically designed for MT systems. We argue for another type of formalism the general formalism to bridge the gap between the two. Next we discuss the role of formalisms in analysis and in generation and then more specific to MT in synthesis. We sum up with a mention on a relevant part of our current work the building of a compiler that generates a synthesis program in SLLP from a set of specifications written in a general formalism. On formalisms in MT The field of computational linguistics has seen many formalisms been inttoduced studied and compared with other formalisms. Some get established and have been or are still being widely used some get modified to suit newer needs or to be used for other purposes while some simply die away.