Skip to main content

Font identifier and Unicode converter for Hindi


Font identifier and Unicode converter for Hindi

Fonts are used to represent text in document. Fonts are mainly two kind non-Unicode and Unicode fonts. Complex scripts like Hindi and other Asian languages well represented in Unicode fonts. There are some other ways to write these languages for e.g we can use ASCII/ISCII codes to represent different characters of Hindi, but there are large numbers of characters in Hindi script as compared to English. Therefore, we always need multiple ASCII/ISCII encoded characters combination to represent a single character of Hindi Script. One major problem in these ASCII encoding based fonts is that we cannot easily transfer text from one system to another. The system must have these text fonts. There is hundreds of ASCII/ISCII encoding based fonts which are used to write Hindi text. New software systems are based on Unicode fonts.
                        Earlier the users had to inform about the type of font encoding, in which the text written. Therefore, to make this process automatic, an effort has been made to resolve this issue. Font identifier is a system that automatically detects the font of given text whereas Unicode converter is a system that involves changing a font into Unicode.

Sample Data To Test the system:
Ì·¤ÚUèÕÙ w® ȤèâÎè ·¤×ü¿æçÚUØô´ ·¤æ ·¤ãÙæ ãñ ç·¤ ¥»ÚU ·¤æØüSÍÜ ÂÚU ÈÔ¤âÕé·¤ Áñâè âôàæÜ ×èçÇØæ âæ§ÅU Ì·¤ ©ç¿Ì Âãé´¿ Ùãè´ Îè ÁæÌè ãñ Ìô ßð Ùõ·¤ÚUè ·¤è Âðàæ·¤àæ Æé·¤ÚUæÙð Æé·¤ÚUæÙð ·¤ô ÌñØæÚU ãñ´Ð

çÙØôQ¤æ ·¤´ÂÙè ãæØðâ ·Ô¤ }|® ·¤×ü¿æçÚUØô´ ¥õÚU çÙØôQ¤æ¥ô´ ÂÚU ¥ÂÙð ¥ŠØØÙ ×ð´ ÂæØæ ç·¤ ¥»ÚU âôàæÜ ×èçÇØæ Ì·¤ Âãé´¿ âèç×Ì ·¤è ÁæÌè ãñ Ìô v~.| ȤèâÎè ·¤×ü¿æÚUè Ùõ·¤ÚUè ·¤è Âðàæ·¤àæ Æé·¤ÚUæ â·¤Ìð ãñ´Ð âßüð ×ð´ çãSâæ ÜðÙð ßæÜð ·¤ÚUèÕ z® ȤèâÎè Üô»ô´ ·¤è ·¤æØüSÍÜ ÂÚU âôàæÜ âæ§ÅUô´ Ì·¤ Âãé´¿ ãñÐ vx.x ȤèâÎè §â·¤æ ÚUôÁÙæ §SÌð×æÜ ·¤ÚUÌð ãñ´ Ìô x{.y ȤèâÎè Üô» ·¤Öè ·¤ÖæÚU ãè §â ÂÚU ÙÁÚU ÇæÜÌð ãñ´Ð


çÙØôQ¤æ¥ô´ ×ð´ Öè ¥ÂÙð ·¤×ü¿æçÚUØô´ ·Ô¤ âôàæÜ ×èçÇØæ âæ§ÅU ÂÚU ÁæÙð ·¤ô Üð·¤ÚU ·¤ô§ü ¹æâ °ÌÚUæÁ Ùãè´ çιæÐ ·¤ÚUèÕ ¥æÏð (yy.x ȤèâÎè) çÙØôQ¤æ¥ô´ ·¤æ ׿ÙÙæ ãñ ç·¤ ·¤×ü¿æçÚUØô´ ·¤ô ·¤æØüSÍÜ ÂÚU âôàæÜ ×èçÇØæ âæ§ÅU ÂÚU ÁæÙð ÎðÙð ·¤è ¥Ùé×çÌ âð ·¤´ÂÙè ×ð´ ©‹ãð´ ÕÙæ° ÚU¹Ùð ×ð´ ȤæØÎæ ãè ãôÌæ ãñÐ ·¤ÚUèÕ °·¤ çÌãæ§ü çÙØôQ¤æ ·¤ô §â ÂÚU ·¤ô§ü ¥æÂçžæ Ùãè´ ãñÐ ÚUæØàæé׿ÚUè ·Ô¤ ¥ÙéâæÚU wx.| ÂýçÌàæÌ çÙØôQ¤æ âôàæÜ ×èçÇØæ ·Ô¤ §SÌð×æÜ ÂÚU Âæ´ÕÎè Ü»æÌð ãñ ¥õÚU yx.w ȤèâÎè ·Ô¤ßÜ âèç×Ì M¤Â âð §â·¤è ¥Ùé×çÌ ÎðÌð ãñ´Ð

For more information please read out our published paper;

I developed this system in VS 2010 ASP.NET C#, it free to use, please check it out and give me your valuable feed back.

Thanks

Comments

Popular posts from this blog

Binary Search Tree in ASP .Net

Binary Search Tree in ASP .Net To create Binary Search Tree(BST) in Asp.net application   first you need to create a Node class. Something like following : class Node {     public String data;     public int freq = 0;     public Node left, right;     public Node()     { }     public Node( String data)     {         this .data = data;         left = null ;         right = null ;     } } Next You need to create a class including different functions.Like class BinaryTreeImp {     Node root;     String outputfreq = "" ;     static int count = 0;     public BinaryTreeImp()     {      ...

Hindi to Punjabi Machine Translation System

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...