Techniques to Improve the word alignments in Statistical Machine Translation from English to Malayalam

In Statistical Machine Translation from English to Malayalam, an unseen English sentence is translated into its equivalent Malayalam translation using statistical models like translation model, language model and a decoder. A parallel corpus of English-Malayalam is used in the training phase. Word to word alignments has to be set up among the sentence pairs of the source and target language before subjecting them for training. This paper is deals with the techniques which can be adopted for improving the alignment model of SMT. Incorporating the parts of speech information into the bilingual corpus has eliminated many of the insignificant alignments. Also identifying the name entities and cognates present in the sentence pairs has proved to be advantageous while setting up the alignments. Moreover, reduction of the unwanted alignments has brought in better training results. Experiments conducted on a sample corpus have generated reasonably good Malayalam translations and the results are verified with F measure, BLEU and WER evaluation metrics

Development of pure and doped gamma ferric oxide

Optimum conditions and experimental details for the formation of v-Fe203 from goethite have been worked out. In another method, a cheap complexing medium of starch was employed for precipitating acicular ferrous oxalate, which on decomposition in nitrogen and subsequent oxidation yielded acicular y-Fe203. On the basis of thermal decomposition in dry and moist nitrogen, DTA, XRD, GC and thermodynamic arguments, the mechanism of decomposition was elucidated. New materials obtained by doping ~'-Fe203 with 1-16 atomic percent magnesium, cobalt, nickel and copper, were synthesised and characterized

Degrees of Free Word-Order and Freely Rewriting Restarting Automata

In natural languages with a high degree of word-order freedom syntactic phenomena like dependencies (subordinations) or valencies do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of j-monotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the complexity of word-order in sentences (languages). Here we combine two types of parameters on computations of restarting automata: 1. the degree of j-monotonicity, and 2. the number of rewrites per cycle. We study these notions formally in order to obtain an adequate tool for modelling and comparing formal descriptions of (natural) languages with different degrees of word-order freedom and word-order complexity.

The Degree of Word-Expansion of Lexicalized RRWW-Automata

Restarting automata can be seen as analytical variants of classical automata as well as of regulated rewriting systems. We study a measure for the degree of nondeterminism of (context-free) languages in terms of deterministic restarting automata that are (strongly) lexicalized. This measure is based on the number of auxiliary symbols (categories) used for recognizing a language as the projection of its characteristic language onto its input alphabet. This type of recognition is typical for analysis by reduction, a method used in linguistics for the creation and verification of formal descriptions of natural languages. Our main results establish a hierarchy of classes of context-free languages and two hierarchies of classes of non-context-free languages that are based on the expansion factor of a language.

Economic evaluation of proposed pure and mixed stands in Central Vietnam highlands

In comparison with mixed forest stands, the cultivation of pure plantations in Vietnam entails serious ecological consequences such as loss of biodiversity and higher rate of soil erosion. The economic evaluation is elaborated between pure plantations and mixed forests where the fast-growing tree species are mixed with slow growing tree species which are planted in stripes separating the segments with fast-growing tree species (Acacia sp.). For the evaluation, the input values were used from local costs of goods, services and labour. The results show that the internal rate of return is the highest in the case of pure plantation in comparison with mixed forests – 86% to 77%(first planting pattern: Acacia sp. + noble hardwood species) and 54% (second planting pattern: Acacia + Dipterocarpus sp. + Sindora sp.). The average profit per hectare and year is almost five times higher in the case of mixed stands. The first planting pattern reaches 2,650 $, the second planting pattern 2,280 $ and the pure acacia plantation only 460 $. From an economic point of view, the cultivation of mixed forests that corresponds to the principles of sustainable forestry generates a good economical profit while maintaining habitat complexity and biodiversity.

A Government-Binding Based Parser for Warlpiri, a Free-Word Order Language

Free-word order languages have long posed significant problems for standard parsing algorithms. This thesis presents an implemented parser, based on Government-Binding (GB) theory, for a particular free-word order language, Warlpiri, an aboriginal language of central Australia. The words in a sentence of a free-word order language may swap about relatively freely with little effect on meaning: the permutations of a sentence mean essentially the same thing. It is assumed that this similarity in meaning is directly reflected in the syntax. The parser presented here properly processes free word order because it assigns the same syntactic structure to the permutations of a single sentence. The parser also handles fixed word order, as well as other phenomena. On the view presented here, there is no such thing as a "configurational" or "non-configurational" language. Rather, there is a spectrum of languages that are more or less ordered. The operation of this parsing system is quite different in character from that of more traditional rule-based parsing systems, e.g., context-free parsers. In this system, parsing is carried out via the construction of two different structures, one encoding precedence information and one encoding hierarchical information. This bipartite representation is the key to handling both free- and fixed-order phenomena. This thesis first presents an overview of the portion of Warlpiri that can be parsed. Following this is a description of the linguistic theory on which the parser is based. The chapter after that describes the representations and algorithms of the parser. In conclusion, the parser is compared to related work. The appendix contains a substantial list of test cases ??th grammatical and ungrammatical ??at the parser has actually processed.

Procesador de textos Word en la enseñanza : materiales para la formación a distancia del profesorado.

Resumen basado en la publicación

Procesador de textos Word en la enseñanza.

Resumen basado en la publicación

How to convert a Word file to PDF using Adobe Acrobat on an iSolutions workstation.

This PowerPoint provides a step-by-step guide to the process of converting a document (such as your thesis) from Word to PDF.

How to convert a Word 2003 document into HTML

How to convert Word 2003 into HTML with associated resources folder. Includes examples showing how to create simple navigation within the document.

INFO2009 Cwk - Reference List - Word Format - by 'Legal Issues'

A list of references in word format

e-Research Methods Module Specification Word File

This file contains a generic module specification for the e-Research Methods module which has been approved by AQSC for use at Masters level.

e-Research Methods Assessment 1 word file

Word files for assessment 1 and marking scheme

e-Research Methods Assessment 2 word file

Word files for assessment 2 and marking scheme