UMR-Blogs

Proposed by Dr. David A. Huffman in 1952 –         “A Method for the Construction of Minimum Redundancy Codes” Applicable to many forms of data transmission                  Algorithm for Huffman Tree Construct a set of trees with root nodes that contain each of the individual symbols and their weights. Place the set of trees into a priority queue. while the priority queue has more than one item Remove the two trees with the smallest weights. Combine them into a new binary tree in which the weight of the tree root is the sum of the weights of its children. Insert the newly created tree back into the priority queue. Huffman coding is a technique used to compress files for transmission Uses statistical coding –         more frequently used symbols have shorter code words W...

The Program was developed to Sort Numbers using Three Stacks. Initially, all the Numbers are in Stack One, then other Two Stacks used to Sort the Number. Max Limit of Number in the array is 100, You may increase it.  The program read all input numbers from Text File present in C:\ drive The Program was developed using VC++.net Code is Very simple and understandable, you may optimize it. #include&ltfstream&gt #include&ltiostream&gt #include&ltstdio.h&gt #include&ltstring&gt using namespace std; typedef struct { int top; float arr[ 100 ]; }Stack; void createStack (Stack *stack) { stack->top=- 1 ; } void push (Stack *stack, float ele) { if (stack->top==- 1 ) { stack->arr[ 0 ]=ele; stack->top= 0 ; } else stack->arr[++(stack->top)]=ele; } float pop (Stack *stack) { if (stack->top==- 1 ) return - 1 ; return stack->arr[(stack->top)--]; } float peek (Stack *stack) { if (stack->top==-...

Punjabi and Hindi are two closely related languages as both originated from the same origin and having lot of syntactic and semantic similarities. These similarities make direct translation methodology an obvious choice for Punjabi-Hindi language pair. The purposed system for Punjabi to Hindi translation has been implemented with various research techniques based on Direct MT architecture and language corpus. The accuracy percentage for the system is found out to be 90.67%.  Lexical Resources System use various resources as follow:  Root word Lexicon: It is a bilingual dictionary that contains Punjabi language word, its lexical category like whether it is noun, verb or adjective etc and corresponding Hindi word. It also contains the gender information in case of nouns and type information (i.e. transitive or intransitive) in case of verb. This dictionary contains about 33000 entries covering almost all the root words of Punjabi language.  Inflectional for...

The Hindi To Punjabi Machine Translation System has been developed using Direct/Rule based Approach by Dr.Vishal Goyal and Dr. G.S Lehal. Various large size Lexicon resources  have been used to map Source and Target language words.  In general, if the two languages are structurally similar, in particular as regards lexical correspondences, morphology and word order, the case for abstract syntactic analysis seems less convincing. Since the present research work deals with a pair of closely related language, so the direct translation system is the obvious choice. The overall system architecture shown below, is adopted for Hindi to Punjabi Machine Translation System. The system is divided into three stages: Preprocessing, Translation Engine, and Post Processing stage. Following is the description of various steps of this architecture.  PreProcessing   The pre-processing stage is a collection of operations that are applied on input  data to make it pr...