Language transliteration is one of the important area in natural language processing. Accurate transliteration of named entities plays an important role in the performance of machine translation and cross-language information retrieval processes. The transliteration model must be design in such a way that the phonetic structure of words should be preserve as closely as possible. We have developed hybrid (statistical +rules) approach based transliteration system of person names; from a person name written in Punjabi (Gurumukhi Script), the system produces its English (Roman Script) transliteration. Experiments have shown that the performance is sufficiently high. The overall accuracy of system comes out to be 95.23%.

In this paper, we introduce product intuitionistic fuzzy graphs and prove several results which are analogous to intuitionistic fuzzy graphs. We conclude by giving properties for a product partial intuitionistic fuzzy sub graph.

In this paper we discuss several operations on intuitionistic fuzzy graph such as union, join, composition, Cartesian product and study their domination parameters.

Let G be an IFG. Then V D  is said to be a strong (weak)is strongly (weakly) dominated by some vertex in D. We denote the strong (weak) intunionistic fuzzy dominating set by sid-set (wid-set).The minimum vertex cardinality over all the sid-set (wid-set) is called the strong (weak) dominating number of an IFG and is denoted by.In this paper, introduce the strong (weak) domination in intunionistic fuzzy graphs and obtain some bounds in IFG.

Let G be an IFG. Then V D  is said to bae a strong (weak)is strongly (weakly) dominated by some vertex in D. We denote the strong (weak) intuitionistic fuzzy dominating set by sid-set (wid-set). The minimum vertex cardinality over all the sid-set (wid-set) is called the strong (weak) dominating number of an IFG and isIn this paper, we introduce the strong (weak) domination in intuitionistic fuzzy graphs and obtain some bounds in IFG.