CA2562366A1 - A system for multiligual machine translation from english to hindi and other indian languages using pseudo-interlingua and hybridized approach - Google Patents
A system for multiligual machine translation from english to hindi and other indian languages using pseudo-interlingua and hybridized approach Download PDFInfo
- Publication number
- CA2562366A1 CA2562366A1 CA002562366A CA2562366A CA2562366A1 CA 2562366 A1 CA2562366 A1 CA 2562366A1 CA 002562366 A CA002562366 A CA 002562366A CA 2562366 A CA2562366 A CA 2562366A CA 2562366 A1 CA2562366 A1 CA 2562366A1
- Authority
- CA
- Canada
- Prior art keywords
- text
- target language
- computer readable
- program code
- translation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/40—Processing or translation of natural language
- G06F40/42—Data-driven translation
- G06F40/45—Example-based machine translation; Alignment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/40—Processing or translation of natural language
- G06F40/55—Rule-based translation
Abstract
The present invention relates to a method and system for translating a source language into a target language comprising the steps of: - identifying the nature of text extracted from a source document, - filtering and storing the text formatting and structure information of the extracted text, - selecting an appropriate text translation engine based on the nature of the extracted text, - using the text translation engine for analysing and translating the extracted text into an unformatted translated text, and - using the stored text formatting and structure information to process the unformatted text for obtaining a structured translated text document in the target language.
Description
TITLE OF THE INVENTION
A SYSTEM FOR MULTILIGUAL-iVIACHINE TRANSLATION
FROM ENGLISH TO IiINDI AND OTHER INDIAN LANGUAGES
USING PSEUDO-INTERLINGUA AND HYBRIDIZED APPROACH
FIELD OF THE INVENTION ' The patent relates to the field of translation systems, more particularly it relates to a system and method for a multilingual translation system for translating from English to Hindi and other Indian languages using a pseudo-interlingua and hybrid approach.
DESCRIPTION OF PRIOR ART:
Language either in written or spoken forms is the most frequently used and effective means for communication. The only drawback being the difference in the language adopted by different group of people. There have been various means. adopted by people to get around this hindrance.
Multilingual dictionaries to human interpreters have been tried in the past.
With the evolution of better computers, automated systems for translation have emerged which are constantly under research and subsequent betterment.
There are four basic approaches to machine translation, which are as follows:
Direct translation Approach: Using this approach, systems are designed in all details specifically for one particular pair of languages. The basic assumption is that the vocabulary and. syntax of source language texts need not be analyzed any more than strictly necessary for the resolution of.
r ambiguities, the correct identification of appropriate target language expressions and the specification of target language word order. Direct translation involves a series of stages commencing with word-for-word translation. Each stage refines the output frOIIl the previous stage by substituting translation for word-groups, by word-order changes etc.. The majority of machine translation systems of the 1950's and 1960's were based on this approach. The direct translation approach suffers from being , very rudimentary, requiring a lot of manual effort in building up the stages and has met with a very limited success for unidirectional specific pair of l0 similar languages in specific domains.
Interlingual approach: In this approach, translation from source language to target language is performed in two distinct and independent stages. In the first stage source language texts are fully analysed and converted into an interlingual representations where it is assumed that all 15 ambiguities have been resolved, and in the second stage this interlingual representation is used for synthesizing the target language text. The basic assumption of the interlingua method is that 'meanings' are language independent and so if meanings have once been extracted and represented, the target text generation is independent of the source language.
20 Interlingual systems differ in their conceptions of an interlingual language, the extent of emphasis on semantic aspects and on syntactic aspects.
As the interlingua approach first translates the source language into an intermediate language which is a knowledge representation schema with complete disambiguation of the constituents of the source text, and that 25 such a complete knowledge representation is not practically possible, the interlingua method has met with only a limited success.
Transfer approach: In this approach the source language is syntactically analyzed and transformed as per target language. The transfer will also be at the semantic and lexical level from source to the target 30 language. The source language text is first converted into source language 'transfer' representations, and then these are converted into target language 'transfer' representations, and~then finally, from these the final target language text forms are synthesized. The accuracy of the system depends - upon the~level of syntactic, semantic and lexical analysis and synthesis -incorporated into the transfer representations used the system. Whereas the interlingual approach necessarily requires complete resolution of all ambiguities of source language texts-so -that translation should be possible l0 into any other language, in the 'transfer' approach only those ambiguities inherent in the language in question are tackled. These systems have also been referred to as rule-based or knowledge-based MT systems.
The transfer approach requires crafting and validation of rules for syntactic, semantic and lexical transfer which has limitations of its own in terms of scalability besides being error-prone.
Example-based/Corpus-based/Statistics-based/Translation-memory based approaches: The fourth generation of approaches (post 1990) to overall machine translation strategy is to: use examples of previously translated sentences. A sentence in source language is compared with pre-stored example sentences and the translation is obtained by picking up the closest example. The example-base and translation memory are created from bilingual corpora. The disambiguation is achieved by examples through distance computation and/or statistical analysis of constituent symbols and/or exact match from translation-memory.
The translation-memory are mostly used in restricted domains, Statistics-based systems require training on huge, good quality bilingual corpora for obtaining acceptable quality. The distance computation in example-based MT requires integration of a number of linguistic, pragmatic and statistical information, and adequate training to the system for weighting the constituent parts. The example-base may also become very large for achieving correct translation.
US Patent No. 6,278,967 provides "An automated system for generating natural'larlguage translation that are_~domain specific; grammar.
rule based and/or based on part of speech analysis". The aforementioned patent uses keywords to identify the domain to which the text to be translated belongs. However, this approach has its drawbacks because the IO database of keywords might not be exhaustive enough to indicate the correct domain or the keywords.in the document might not appear in the database. Further the aforementioned patent requires a lot of training for arriving at weights of lexical items and other constituents for selection of correct translation and desired accuracy of the translated output may not be achieved.
US patent no. 5,426,583 refers to an "Automatic interlingual translation system", that uses two intermediate languages with two stages of transfer. The method of the aforementioned patent suffers fiom all the drawbacks of the interlingual approach. Further, in this approach, an .
increase in the number of stages for performing the translation may lead to a loss of information and thereby, decrease the accuracy of the translated output.
Euxopean Patent no. 0,568,319,A2 refer to "Machine translation system" wherein a number of knowledge sources are used to create information repositories deduced from the source language text. These information repositories are used to generate information repositories for the target language which in turn are used by the target language generation module. The generator module uses constraint checker and tree builder to produce a set of candidate translations. The method of the aforementioned patent suffers from the drawbacks that it relies heavily on its ability to deduce complete and all necessary information repositories of the source.
.a and establish its correspondence in the target languages incorporating multiple interpretations which is not very practical. Further, the constraint checker arid tree. builder success is limited by the.richness of the associated lexical information which cannot be assumed' in a practical situation.
OBJECT AND SUMMARY ~OF THE INVENTION:
The main object of this inventi~ori is to obviate the above mentioned to drawbacks of the prior art and provide a system and method for performing more accurate and faster machine translation primarily from English to a plurality of Indian languages using the pseudo interlingua and hybrid approach.
The second object of this invention is to provide an approach wherein translation from a source language to a group of languages belonging to a common family is more efficient.
A further object of this invention is that the system methodology be applicable to all Indian languages.
A yet another object of this invention is to provide a machine 2o translation system that is scalable in performance and coverage of domains.
These and other objects are achieved by providing a system consisting of a number of modules that communicates with each other for translating texts written in English to Hindi and other Indian language at improved performance in terms of speed and accuracy.
In the instant invention, the concept of pseudo-interlingua is introduced wherein the source language is translated into an inter mediate language that exploits the properties common to a family of target languages. In the pseudo-int~rlingual approach, the soLUCe language disambiguation is limited to the extent considered necessary for the family of target languages. Further; the intermediate language can be tuned to the family of target languages, thereby improving the accuracy and the acceptability of the translated text.
In the instant invention, the concept of an Abstracted example-base is introduced wherein~the raw examples are transformed-into a more compacted abstract form. The abstracted example may contain 'constants and 'variable' parts. For example, a raw example such as 'Welcome to Delhi' is abstracted to 'Welcome to ~city>' (meaning that 'you are welcome to the city') whereas 'Welcome to President' is abstracted to 'Welcome to <person>' (meaning that 'we welcome the person'). This way the size of the example-base is considerably reduced leading to improvement in accuracy and efficient search.
In the instant invention, the concept of an Interactive development of example-base is introduced wherein instead of relying on a bi-lingual parallel corpora whose quality and coverage may not be insured for development of example-base, the example-base is grown incrementally through user interaction. When the user finds that the translated output of the system is unsatisfactory, the input sentence is added to the example-base. With time, the number of examples added gets tapered indicating the extent of coverage.
In the instant invention, the concept of Hybridization is introduced wherein both the rule-based and example-based approaches are used in a judicious manner. While developing the translation system, first the rule-base is used for translation, and in case of unsatisfactory translation, the input sentence is entered as an example in the example-base. Whereas at the time of translation, the translation system first uses example-base for translation and in case it is below a specified matching threshold, the rule-base is invoked. This hybridization of rule-based and example-based approaches yields better accuracy and speed as it overcomes shortcomings of both of these approaches.
G
The machine translation system of this invention identifies the nature of the text to be translated and.based on. its nature, an appropriate main translation engine is invoked. The different translation engines differ in their grammar formalism and example base. A module in the identified main translation engine performs lexical analysis of each word of the input l0 sentence using a hierarchical domain specific multilingual lexical database and in the process, it also identifies acronyms and unknown words. The hierarchical domain specific multilingual lexical database is organized as a Directed Acyclic Graph (DAG) linking domains with sub-domains.
An example-base storing frequently occurring phrasals and a rule-base is then used to translate English text to an intermediate form as per pseudo-interlingua where the word order is that of the family of target languages (Hindi or any other Indian language). The intermediate form is converted to Hindi or other Indian language by text-generators(s) using a number of target specific knowledge bases mostly derived from 'KARAK' theory of Sanskrit using Paninian framework. The~unknown lexicons are transliterated into the script of the target language and suitably transformed as per their guessed part of speech. An automated post-editing is penormed to achieve greater accuracy in form and style of presentation in the target language.
BRIEF DESCRIPTION OF THE ACCOMPANYING DRAWINGS:
For a more complete understanding of the present invention and the advan xages thereof, the invention will now be described with the help of the accompanying drawings:
Figure 1 is a block diagram of the computing system on which the present invention might be practiced.
Figure 2 is a block scli~matic of the overall system of the present invention.
Figure 3 shows a flow chart explaining the translation method of this invention.
Figure 4 shows a block schematic of the module embodying main-translation engine of the present invention.
Figure S shows an example of Domain Hierarchy in the form of DAG (Directed Acyclic Graph) used in the present in invention.
Figure 6 shows a Block schematic of inputs used by the Text Generator Module for Hindi or other target Indian languages in the present invention.
Figure 7 shows a Block schematic of Interactive method of Example-base creation.
DETAILED DESCRIPTION OF THE INVENTION:
Figure I is a block diagram that illustrates a typical device incorporating the invention. The device (1.1) consists of various subsystems interconnected with the help of a system bus (1.2). Each device (1.1) incorporates networking interface (1.8) that is used to connect the device to various networks such as a LAN, WAN or the Tnternet (1.14).
The instructions encoded in the various means used in the invention are stored in the storage device (1.5) and are transferred to the memory (1.4) through the internal communication bus (1.2) when the program is executed. The memory (1.4) holds the current instructions to be executed by the processor (1.3) along with their results. The processor (1.3) executes the instructions for translating the source document in the source language to the target language by fetching them from the memory ( 1.4). The processor (1.3) could be a microprocessor in case of a PC or a workstation, a dedicated semiconductor chip,~an.d the like. The keyboard (1.10), mouse ( 1.11) and other input devices such as Optical Character Recognition ( 1.12) and speech recognition system (1.13) connected to the computer system - - through the Input interface (1.9) are used-for providing the user input such as adding entries in the example base, performing post editing on the translated document and the like.
The processor (I.3) executes the~text extraction means for extracting i0 the text to be translated and identifying its nature using a source language specific knowledge base. Following this, the text formatting-filtering means filter and store text formatting and structure information of the text. Then, the Text translation engine invoking means cause the instructions encoded in the suitable text translation engine identified based on the nature of the text to be executed for analysing and translating the extracted text into an unformatted translated text. The unformatted translated text is formatted into a structured form for obtaining the translated text in the target language by the text formatting means. The structured translated text in the target language is displayed to the user through the video display (1.7), printed using a printer (1.15) and/or converted to speech through speech synthesizer (1.16) connected to the computing device through the output interface (1.6) for carrying out post-editing if necessary.
Those of ordinary skill in the art will appreciate that the means herein described are instructions for operating on the computing system.
The means are capable of existing in an embedded form within the hardware of a-computing system or may be embodied on various computer readable media. The computer readable media may take the form of coded formats that are decoded for actual use in a particular information z processing system. Computer program means or a computer program in the present context mean any expression, in any language, code, or notation, of a set of instructions intended to cause a system having information processing capability to perform the particular function either directly or after performing either or both of the following:
a) conversion to another language, code or notation b) reproduction in a different material form.
The depicted example in Figure 1 is not meant to imply architectural limitations and the configuration of the incorporating device of the said means may vary depending on the implementation. The invention can be .
realized in hardware, software, or a combination of hardware and software.
Any kind of computer system or other apparatus adapted for carrying out the means described herein can be employed for practicing the invention. A
typical combination of hardware and software could be a general purpose computer system with a computer program that when loaded and executed, controls the computer system such that it carries out the means described herein.
In accordance with the present invention, the translation system comprises a number of modules that communicate with each other. Figure 2 depicts a block schematic of the overall system of the present invention..
A module (2.1) inputs text from a source file that can contain text from a plurality of sources including fax, e-mail, optical scanner, web page, .
character recognition, speech recognition and the like. Module (2.2) extracts the various text zones from the text input and subsequently, another module (?.3) identifies the nature of the text zones. The text zones are based on such criteria as running text with full sentences, running text with partial sentences, address, text heading, news heading, mathematical expression, table, transcripted speech text, text in mixed languages such as English and Hindi, parenthesized items, items within quote marks.
S footnotes and the like using a knowledge base (2.11). The knowledge base .
(2. T 1 ) primarily consists of heuristics on document vstructures.
Various text translation engines are provided by the invention based on the nature of the identified text zone. Therefore, after the text nature has been identified by module (2.3), the appropriate translation engine is LO invoked (2.4). The different translation engines (2.6a, 2.6b... 2.6z) differ in their grammar formalism and example-base. For example, "DDA Flats"
will get translated differently in an address field. Similarly news heading "eleven die in flash flood" will get translated in the past tense in Hindi.
The translated output (2.7), as obtained from the target language text 15 generator (explained Iater in figure 5) is composed and re-structured into an output document (2.8) using the document formatting and structuring information (2.5) extracted by module (2.3). A further improvement in the presentation style and accuracy of the translated output is done by means of an automated post-editing module (2.9). An example of such an 20 improvement is treating nouns/pronouns used to address persons held in respect as plurals in a target language even though they may be used as singular in the English text. This is a peculiarity of all Indian languages.
For example, the English word "you" will be translated to "tum" or "aap"
in Hindi based on whether you hold the addressed person in r espect aIld , 25 honour or not. This correction module embodies a number of heuristics to yield a more acceptable and.riatural form of the output text. In case some ambiguities remain unresolved at the end of the text generation process, a human engineered post-editing interface (2.10) is provided for the user of the invention to make the desired corrections. °
,0 Figure 3 depicts a flow chart explaining the translation method of the invention. The process is initiated by extracting the text zones from the inputted text document, identifying the nature of each text zone and invoking the appropriate translation engine for each text zone based on its nature (3.1). The next step is to_ identifyahe sentence unit delimiter (3.2) for yielding a full or partial sentence as obtained in the identified text zone.
The translation engine performs a lexical and morphological analysis (3.3) of each word in the full or partial sentence and in the process also identifies to the acronyms, abbreviations and unknown words that may be present. The analysed lexicons are stored into an online lexicon to reduce the search time for any subsequent searches. The online lexicon list is initialized with the most frequently occurring domain specific words, acronyms, names etc. at the start up time and expanded as the translation process goes on.
Following this an Abstracted example base is used for matching the analysed input sentence with each entry on the Left hand side of the Example base (3.4) containing words, phrasals and sentences in the English language. The corresponding Right hand side entries contain the translated entries in the pseudo-interlingua language. If a match is found then the matched part of the input sentence is replaced with a dummy symbol and an intermediate form corresponding to the symbol as obtained from the example base is entered into another table against the symbol (3.6). If a match is not found (3.7), then a rule base is used to convert the input sentence to the intermediate form. In case the entire input sentence matches with the example base, the rule-base module will simply find a durruny symbol and the rule-base only substitutes the stored intermediate form against the dummy symbol as its output.
The intermediate form, thus obtained, is converted to the target language text using a text language generator (3.8) following which an automated post editing (3.~) islprovided to improve the accuracy of the text output and also to improve its style of presentation. A human engineered post editing interface (3.9) is also provided to allow the user to remove any ambiguities that may remain after the automated post editing 'is over.
Figure 4 shows a block schematic of the module embodying main-translation engine of the present invention. The module (4.1) receives its input from the module (2.4) that invokes the appropriate translation engine l0 based on the nature of the text and identifies the sentence delimiter yielding a full sentence or a partial sentence as obtained in the identified text-zones.
This~module also records the input formatting information. that is used for formatting the target language text as obtained from the translation system.
15 The module (4.2) embodies algorithms for detecting acronyms and unknown words (4.12) and also, performing lexical and morphological analysis for each input word to facilitate search in the abstracted example database (4.3). The lexicons along with their properties, acronyms and unknown words with postulated tags, are stored in the on-line lexicons and 20 phrasals module (4.9) to reduce the search time for each subsequent search.
For a subsequent lexicon search, this module is searched first and if the lexicon is not found online it is later searched in the lexical database.
The module (4.3) is an abstracted example-base storing examples of source to target language translations. These examples are the most 25 commonly encountered phrases, groups of words, or full or partial sentences in the target language. The examples can be stored in raw form, i.e. the form in which they actually bccur, or in an abstracted form where the individual words or groups of words may be replaced by their r categories along with their properties. An abstracted example-base makes 30 the database compact as a number of actual examples may match a single entry in the target language. An,example can be used to clarify the difference. between an entry in the raw form and in the abstracted form stored in the example base (4.3). The sentence "Ram goes to Delhi" is in ' ' the raw form as it is .used in the source language, i.e., English.
However; the basic structure of the sentence can be abstracted to the form "<NP1>
<verb2-movement-type> to {City}". In other words, the constants in a sentence can be replaced with variables making it broader and generic. This to abstracted form can be stored in the example base and thereafter; any other sentence that uses the same structure such as "Fred goes to London" can be translated using this abstracted form. Another example of a sample entry in the abstracted example-base may be "inspite of <NP1> being <PP2>
{ place } $ADV$ _> <NP1><PP2>KS { BE verbs } { inspite of } ". This will match a number of sentence fragments such as " inspite of me being there' or ' inspite of a lot of people being at the premises of the court' or 'inspite of John and Mary being here' and so on. Thus, this approach helps to reduce the storage space requirements of the database and increase its efficiency.
An example in the example-base consists of two parts: Left-hand side (source language part) contains English words and variables (which could be substituted by only an English word or a group of words, that satisfy the properties associated with the variable). The Right-hand side contains the corresponding intermediate form representation as per the .
word order of the target Indian language.
An input sentence is first matched with the left-hand side of the example base to locate the largest matching chunk of example sentence corresponding to the input sentence. If a match is found above a certain threshold minimum distance value, the intermediate form on the right hand-side of the matching example is stored against a distinct dummy variable name by the module (4.10). At. the same time, part of the sentence that matched with the example-base, is substituted with the distinct dummy variable name along with the properties of that component as obtained from - the example-base. -The example-base can be created interactively using the translation system of this invention as depicted in figure 7 andlor by using a bi-lingual corpora. The example base can be further expanded by incorporating new l0 examples in the source language along with their corresponding translation in the target language for improving the quality of the translation.
Statistical information can be used for more efficiently expanding the database based on the frequency of occurrence of phrases in the source language. The most often occurring phrases can be tracked and added to the example base in .
this manner. The quality of translation is improved as the examples capture the contextual information under which meanings of a word or word groups may differ. Different contexts lead to distinct examples in the example-base leading to minimal or no effort in disambiguation in obtaining the translation.
A Pattern directed rule-based converter module (4.4) transforms the input sentence of the source language to an intermediate form based on the grammatical pattern of the input sentence. A rule is invoked when the grammatical pattern matches that of the input sentence. This matching may be performed recursively and multiple matches yield multiple translations.
For each match there is a corresponding intermediate form. The intermediate form contains all the information obtained from the lexical .
date-base and has the word order as per target Indian language. The intermediate form is pseudo-interlingua for Indian languages.
r The two modules (4.3, 4.4) together form the heart of the text translation engine of the system and ensure hybridization of example-based and rule-based methodologies. 'fhe hybridization method presented in this invention attempts to get the best results from both the methodologies.
When a source language text is being translated, tlae system of this invention, first uses the example-base and then the rule-base for translation for remaining unmatched part, if any. On the other hand, at the time of system development, the example base is expandable in an user interactive manner. The input sentence is first translated using the pattern directed rule base and if the translation is found unsatisfactory, then the sentence is added to the example base in the abstracted form. In this way, the example base grows over a period of time and starts bending towards saturation. .
This is further illustrated in figure 7.
The output of the Pattern directed rule base or the example base is an intermediate form (4.5).
All nouns encountered by modules (4.3,4.4) are stored in a history list of nouns (4.11) that is used for resolving pronoun reference ambiguity.
The hierarchical domain specific multilingual lexical database (4.8) is organized as Directed Acyclic Graph (DAG) linking domains with sub domains. This is further illustrated through an example in Figure 5. The structure of the database as depicted in figure 5 is only for illustrative purposes and it may be expanded by adding new domains and sub-domains if required. The structure of the multilingual lexical database helps to reduce the sense ambiguity of the words in an input sentence.
The text generator modules -(4.6, 4.7), each provided for a particular target language, takes the intermediate form generated by the rule base .
module (4.5) and also as obtained from the example base (4.10) and converts it into the unstructured target language text output.
Figure 5 depicts an example of Domain Hierarchy in the form of DAG (Directed Acyclic Graph) used in the present invention. The top node of the DAG is the iGeneral' dpW a'in (5.1) that contains the words and phrases not belonging to any particular specialised sub domain. The sub domains at the next level in the hierarchy are broad domains such as General .science.(5.2), Social science (5.3), History (5-.4),: Geography (5.5), Political science (5.6), Health and medicine (5.7), Religion (5.8) and others like these. A domain at this level might have more specialised sub domains, for example, the General science (5:2)'domain can have 3 sub domains l0 namely Physics (5.9), Chemistry (5.10) and Biological science (5.11 ). The Biological science (5.11) sub domain can further have even more specialised sub domains as Zoology (5.r13) and Botany (5.14). One or more parent domains can share the specialised sub domains. For example, Zoology (5.13) and Botany (5.14) sub domains are shared by Biological science (5.11) and Health and medicine (5.7) parent domains. The domain hierarchy as described herein is meant for illustrative purposes only and is not a limitation of the hierarchical multilingual database used by the invention. It can be easily scaled up to include more domains and sub domains and expand the hierarchy.
When the domain of the text to be translated is identified, the system looks for lexical entries in the identified domain. For example, if the identified domain is Botany (5.14), the system searches this domain for any lexical entries to be matched. If it does not find an entry in this domain, the lexical entries in the parent domains of Biological science (5.11) and Health & Medicines in the hierarchy are searched in parallel. Tf the entries are still not found then the hierarchy is searched all the way up to the 'General' domain (5.1), that is searched in the end. The lexical database organized in this fashion helps in disambiguating meanings of the words in the input text r that is a specific object of. the system. As an example, if a user is translating text from Health and medicine domain (5.7), a word such as 'treatment' will get assigned the meaning~i~n the sense of 'behaviour' (in Hindi:
r 'vyavahaar').
Figure 6.is a block schematic of inputs used by the Text Generator Module for Hindi or other target Indian languages in the present invention.
The text generator module takes as its inputs: an intermediate code for sentences (&.1) and sentence part/phrasal intermediate code (6.2). The text generator uses verb categorization.aiid~expectation xules (6.7), semantic, l0 ontological (6.6) and morphological composition information (6.5) and a number of rules derived from Sanskrit 'Kayak' theory (6.9~ to synthesize text in the target Indian language leading to a more acceptable 'parsarg' symbols (post-positions) and help disambiguation. The pronoun z-eference disambiguation is achieved using a history list of nouns (6.3) and 15 disambiguation rules (6.8}. The unknown lexicons are transliterated into the script of the target language (6.11) and suitably transformed as per their guessed part of speech in the target language, For example, assume that an English verb "abort" is not present in the lexical database and the input sentence encounters the word "aborted" in the input sentence. This module 20 will take the meaning of "aborted" as "ebaurt kar" in Hindi ("ebaurt" is transliterated form of ~~oxd "abort" and "kar" is appended to obtain its form) if the unknown lexicon is guessed to be a verb in past tense. The final transliterated form for this part as per rules of composition will be " ebaurt kiyaa" which is quite an acceptable form in day-to-day usage in Zndia. The 2S output of the text generator module is the translated text in the target language (6.10).
Figure 7 shows a Block schematic illustrating the interactive method of Example-.base creation used in this invention. The input soLlrCe language text (7.1) is matched with the entries of the abstracted example-base (7.?) 30 by the Best-Match-Finder module (7.4). The best match finder module computes distance of the input source language text with each entry of the abstracted example-base available with the system at the time of ~s development. This distance computation is based on aggregated (weighted - sum) distances of attributes/properties associated with individual constituent symbols/words of the source and example texts. This distance is compared with a preset threshold (a parameter Leant by the system during experimentation) and a translation is~ produced (7.5) only when the l0 computed distance is less than the threshold value. For efficient searching of the example-base, the example-base is portioned in a logical manner and the search is confined to a partition or partition hierarchy. When the system developer does not find the translated output to be satisfactory or there is no translation produced due to thresholding, the system developer enters the correct translation as an additional example in the example-base (7.3). This way the system's example-base grows with exposure to more and more user interaction during the development stage and the curve of example-base growth starts showing a bending. The system developer may decide.an appropriate level of saturation for the system delivery for actual usage.
A SYSTEM FOR MULTILIGUAL-iVIACHINE TRANSLATION
FROM ENGLISH TO IiINDI AND OTHER INDIAN LANGUAGES
USING PSEUDO-INTERLINGUA AND HYBRIDIZED APPROACH
FIELD OF THE INVENTION ' The patent relates to the field of translation systems, more particularly it relates to a system and method for a multilingual translation system for translating from English to Hindi and other Indian languages using a pseudo-interlingua and hybrid approach.
DESCRIPTION OF PRIOR ART:
Language either in written or spoken forms is the most frequently used and effective means for communication. The only drawback being the difference in the language adopted by different group of people. There have been various means. adopted by people to get around this hindrance.
Multilingual dictionaries to human interpreters have been tried in the past.
With the evolution of better computers, automated systems for translation have emerged which are constantly under research and subsequent betterment.
There are four basic approaches to machine translation, which are as follows:
Direct translation Approach: Using this approach, systems are designed in all details specifically for one particular pair of languages. The basic assumption is that the vocabulary and. syntax of source language texts need not be analyzed any more than strictly necessary for the resolution of.
r ambiguities, the correct identification of appropriate target language expressions and the specification of target language word order. Direct translation involves a series of stages commencing with word-for-word translation. Each stage refines the output frOIIl the previous stage by substituting translation for word-groups, by word-order changes etc.. The majority of machine translation systems of the 1950's and 1960's were based on this approach. The direct translation approach suffers from being , very rudimentary, requiring a lot of manual effort in building up the stages and has met with a very limited success for unidirectional specific pair of l0 similar languages in specific domains.
Interlingual approach: In this approach, translation from source language to target language is performed in two distinct and independent stages. In the first stage source language texts are fully analysed and converted into an interlingual representations where it is assumed that all 15 ambiguities have been resolved, and in the second stage this interlingual representation is used for synthesizing the target language text. The basic assumption of the interlingua method is that 'meanings' are language independent and so if meanings have once been extracted and represented, the target text generation is independent of the source language.
20 Interlingual systems differ in their conceptions of an interlingual language, the extent of emphasis on semantic aspects and on syntactic aspects.
As the interlingua approach first translates the source language into an intermediate language which is a knowledge representation schema with complete disambiguation of the constituents of the source text, and that 25 such a complete knowledge representation is not practically possible, the interlingua method has met with only a limited success.
Transfer approach: In this approach the source language is syntactically analyzed and transformed as per target language. The transfer will also be at the semantic and lexical level from source to the target 30 language. The source language text is first converted into source language 'transfer' representations, and then these are converted into target language 'transfer' representations, and~then finally, from these the final target language text forms are synthesized. The accuracy of the system depends - upon the~level of syntactic, semantic and lexical analysis and synthesis -incorporated into the transfer representations used the system. Whereas the interlingual approach necessarily requires complete resolution of all ambiguities of source language texts-so -that translation should be possible l0 into any other language, in the 'transfer' approach only those ambiguities inherent in the language in question are tackled. These systems have also been referred to as rule-based or knowledge-based MT systems.
The transfer approach requires crafting and validation of rules for syntactic, semantic and lexical transfer which has limitations of its own in terms of scalability besides being error-prone.
Example-based/Corpus-based/Statistics-based/Translation-memory based approaches: The fourth generation of approaches (post 1990) to overall machine translation strategy is to: use examples of previously translated sentences. A sentence in source language is compared with pre-stored example sentences and the translation is obtained by picking up the closest example. The example-base and translation memory are created from bilingual corpora. The disambiguation is achieved by examples through distance computation and/or statistical analysis of constituent symbols and/or exact match from translation-memory.
The translation-memory are mostly used in restricted domains, Statistics-based systems require training on huge, good quality bilingual corpora for obtaining acceptable quality. The distance computation in example-based MT requires integration of a number of linguistic, pragmatic and statistical information, and adequate training to the system for weighting the constituent parts. The example-base may also become very large for achieving correct translation.
US Patent No. 6,278,967 provides "An automated system for generating natural'larlguage translation that are_~domain specific; grammar.
rule based and/or based on part of speech analysis". The aforementioned patent uses keywords to identify the domain to which the text to be translated belongs. However, this approach has its drawbacks because the IO database of keywords might not be exhaustive enough to indicate the correct domain or the keywords.in the document might not appear in the database. Further the aforementioned patent requires a lot of training for arriving at weights of lexical items and other constituents for selection of correct translation and desired accuracy of the translated output may not be achieved.
US patent no. 5,426,583 refers to an "Automatic interlingual translation system", that uses two intermediate languages with two stages of transfer. The method of the aforementioned patent suffers fiom all the drawbacks of the interlingual approach. Further, in this approach, an .
increase in the number of stages for performing the translation may lead to a loss of information and thereby, decrease the accuracy of the translated output.
Euxopean Patent no. 0,568,319,A2 refer to "Machine translation system" wherein a number of knowledge sources are used to create information repositories deduced from the source language text. These information repositories are used to generate information repositories for the target language which in turn are used by the target language generation module. The generator module uses constraint checker and tree builder to produce a set of candidate translations. The method of the aforementioned patent suffers from the drawbacks that it relies heavily on its ability to deduce complete and all necessary information repositories of the source.
.a and establish its correspondence in the target languages incorporating multiple interpretations which is not very practical. Further, the constraint checker arid tree. builder success is limited by the.richness of the associated lexical information which cannot be assumed' in a practical situation.
OBJECT AND SUMMARY ~OF THE INVENTION:
The main object of this inventi~ori is to obviate the above mentioned to drawbacks of the prior art and provide a system and method for performing more accurate and faster machine translation primarily from English to a plurality of Indian languages using the pseudo interlingua and hybrid approach.
The second object of this invention is to provide an approach wherein translation from a source language to a group of languages belonging to a common family is more efficient.
A further object of this invention is that the system methodology be applicable to all Indian languages.
A yet another object of this invention is to provide a machine 2o translation system that is scalable in performance and coverage of domains.
These and other objects are achieved by providing a system consisting of a number of modules that communicates with each other for translating texts written in English to Hindi and other Indian language at improved performance in terms of speed and accuracy.
In the instant invention, the concept of pseudo-interlingua is introduced wherein the source language is translated into an inter mediate language that exploits the properties common to a family of target languages. In the pseudo-int~rlingual approach, the soLUCe language disambiguation is limited to the extent considered necessary for the family of target languages. Further; the intermediate language can be tuned to the family of target languages, thereby improving the accuracy and the acceptability of the translated text.
In the instant invention, the concept of an Abstracted example-base is introduced wherein~the raw examples are transformed-into a more compacted abstract form. The abstracted example may contain 'constants and 'variable' parts. For example, a raw example such as 'Welcome to Delhi' is abstracted to 'Welcome to ~city>' (meaning that 'you are welcome to the city') whereas 'Welcome to President' is abstracted to 'Welcome to <person>' (meaning that 'we welcome the person'). This way the size of the example-base is considerably reduced leading to improvement in accuracy and efficient search.
In the instant invention, the concept of an Interactive development of example-base is introduced wherein instead of relying on a bi-lingual parallel corpora whose quality and coverage may not be insured for development of example-base, the example-base is grown incrementally through user interaction. When the user finds that the translated output of the system is unsatisfactory, the input sentence is added to the example-base. With time, the number of examples added gets tapered indicating the extent of coverage.
In the instant invention, the concept of Hybridization is introduced wherein both the rule-based and example-based approaches are used in a judicious manner. While developing the translation system, first the rule-base is used for translation, and in case of unsatisfactory translation, the input sentence is entered as an example in the example-base. Whereas at the time of translation, the translation system first uses example-base for translation and in case it is below a specified matching threshold, the rule-base is invoked. This hybridization of rule-based and example-based approaches yields better accuracy and speed as it overcomes shortcomings of both of these approaches.
G
The machine translation system of this invention identifies the nature of the text to be translated and.based on. its nature, an appropriate main translation engine is invoked. The different translation engines differ in their grammar formalism and example base. A module in the identified main translation engine performs lexical analysis of each word of the input l0 sentence using a hierarchical domain specific multilingual lexical database and in the process, it also identifies acronyms and unknown words. The hierarchical domain specific multilingual lexical database is organized as a Directed Acyclic Graph (DAG) linking domains with sub-domains.
An example-base storing frequently occurring phrasals and a rule-base is then used to translate English text to an intermediate form as per pseudo-interlingua where the word order is that of the family of target languages (Hindi or any other Indian language). The intermediate form is converted to Hindi or other Indian language by text-generators(s) using a number of target specific knowledge bases mostly derived from 'KARAK' theory of Sanskrit using Paninian framework. The~unknown lexicons are transliterated into the script of the target language and suitably transformed as per their guessed part of speech. An automated post-editing is penormed to achieve greater accuracy in form and style of presentation in the target language.
BRIEF DESCRIPTION OF THE ACCOMPANYING DRAWINGS:
For a more complete understanding of the present invention and the advan xages thereof, the invention will now be described with the help of the accompanying drawings:
Figure 1 is a block diagram of the computing system on which the present invention might be practiced.
Figure 2 is a block scli~matic of the overall system of the present invention.
Figure 3 shows a flow chart explaining the translation method of this invention.
Figure 4 shows a block schematic of the module embodying main-translation engine of the present invention.
Figure S shows an example of Domain Hierarchy in the form of DAG (Directed Acyclic Graph) used in the present in invention.
Figure 6 shows a Block schematic of inputs used by the Text Generator Module for Hindi or other target Indian languages in the present invention.
Figure 7 shows a Block schematic of Interactive method of Example-base creation.
DETAILED DESCRIPTION OF THE INVENTION:
Figure I is a block diagram that illustrates a typical device incorporating the invention. The device (1.1) consists of various subsystems interconnected with the help of a system bus (1.2). Each device (1.1) incorporates networking interface (1.8) that is used to connect the device to various networks such as a LAN, WAN or the Tnternet (1.14).
The instructions encoded in the various means used in the invention are stored in the storage device (1.5) and are transferred to the memory (1.4) through the internal communication bus (1.2) when the program is executed. The memory (1.4) holds the current instructions to be executed by the processor (1.3) along with their results. The processor (1.3) executes the instructions for translating the source document in the source language to the target language by fetching them from the memory ( 1.4). The processor (1.3) could be a microprocessor in case of a PC or a workstation, a dedicated semiconductor chip,~an.d the like. The keyboard (1.10), mouse ( 1.11) and other input devices such as Optical Character Recognition ( 1.12) and speech recognition system (1.13) connected to the computer system - - through the Input interface (1.9) are used-for providing the user input such as adding entries in the example base, performing post editing on the translated document and the like.
The processor (I.3) executes the~text extraction means for extracting i0 the text to be translated and identifying its nature using a source language specific knowledge base. Following this, the text formatting-filtering means filter and store text formatting and structure information of the text. Then, the Text translation engine invoking means cause the instructions encoded in the suitable text translation engine identified based on the nature of the text to be executed for analysing and translating the extracted text into an unformatted translated text. The unformatted translated text is formatted into a structured form for obtaining the translated text in the target language by the text formatting means. The structured translated text in the target language is displayed to the user through the video display (1.7), printed using a printer (1.15) and/or converted to speech through speech synthesizer (1.16) connected to the computing device through the output interface (1.6) for carrying out post-editing if necessary.
Those of ordinary skill in the art will appreciate that the means herein described are instructions for operating on the computing system.
The means are capable of existing in an embedded form within the hardware of a-computing system or may be embodied on various computer readable media. The computer readable media may take the form of coded formats that are decoded for actual use in a particular information z processing system. Computer program means or a computer program in the present context mean any expression, in any language, code, or notation, of a set of instructions intended to cause a system having information processing capability to perform the particular function either directly or after performing either or both of the following:
a) conversion to another language, code or notation b) reproduction in a different material form.
The depicted example in Figure 1 is not meant to imply architectural limitations and the configuration of the incorporating device of the said means may vary depending on the implementation. The invention can be .
realized in hardware, software, or a combination of hardware and software.
Any kind of computer system or other apparatus adapted for carrying out the means described herein can be employed for practicing the invention. A
typical combination of hardware and software could be a general purpose computer system with a computer program that when loaded and executed, controls the computer system such that it carries out the means described herein.
In accordance with the present invention, the translation system comprises a number of modules that communicate with each other. Figure 2 depicts a block schematic of the overall system of the present invention..
A module (2.1) inputs text from a source file that can contain text from a plurality of sources including fax, e-mail, optical scanner, web page, .
character recognition, speech recognition and the like. Module (2.2) extracts the various text zones from the text input and subsequently, another module (?.3) identifies the nature of the text zones. The text zones are based on such criteria as running text with full sentences, running text with partial sentences, address, text heading, news heading, mathematical expression, table, transcripted speech text, text in mixed languages such as English and Hindi, parenthesized items, items within quote marks.
S footnotes and the like using a knowledge base (2.11). The knowledge base .
(2. T 1 ) primarily consists of heuristics on document vstructures.
Various text translation engines are provided by the invention based on the nature of the identified text zone. Therefore, after the text nature has been identified by module (2.3), the appropriate translation engine is LO invoked (2.4). The different translation engines (2.6a, 2.6b... 2.6z) differ in their grammar formalism and example-base. For example, "DDA Flats"
will get translated differently in an address field. Similarly news heading "eleven die in flash flood" will get translated in the past tense in Hindi.
The translated output (2.7), as obtained from the target language text 15 generator (explained Iater in figure 5) is composed and re-structured into an output document (2.8) using the document formatting and structuring information (2.5) extracted by module (2.3). A further improvement in the presentation style and accuracy of the translated output is done by means of an automated post-editing module (2.9). An example of such an 20 improvement is treating nouns/pronouns used to address persons held in respect as plurals in a target language even though they may be used as singular in the English text. This is a peculiarity of all Indian languages.
For example, the English word "you" will be translated to "tum" or "aap"
in Hindi based on whether you hold the addressed person in r espect aIld , 25 honour or not. This correction module embodies a number of heuristics to yield a more acceptable and.riatural form of the output text. In case some ambiguities remain unresolved at the end of the text generation process, a human engineered post-editing interface (2.10) is provided for the user of the invention to make the desired corrections. °
,0 Figure 3 depicts a flow chart explaining the translation method of the invention. The process is initiated by extracting the text zones from the inputted text document, identifying the nature of each text zone and invoking the appropriate translation engine for each text zone based on its nature (3.1). The next step is to_ identifyahe sentence unit delimiter (3.2) for yielding a full or partial sentence as obtained in the identified text zone.
The translation engine performs a lexical and morphological analysis (3.3) of each word in the full or partial sentence and in the process also identifies to the acronyms, abbreviations and unknown words that may be present. The analysed lexicons are stored into an online lexicon to reduce the search time for any subsequent searches. The online lexicon list is initialized with the most frequently occurring domain specific words, acronyms, names etc. at the start up time and expanded as the translation process goes on.
Following this an Abstracted example base is used for matching the analysed input sentence with each entry on the Left hand side of the Example base (3.4) containing words, phrasals and sentences in the English language. The corresponding Right hand side entries contain the translated entries in the pseudo-interlingua language. If a match is found then the matched part of the input sentence is replaced with a dummy symbol and an intermediate form corresponding to the symbol as obtained from the example base is entered into another table against the symbol (3.6). If a match is not found (3.7), then a rule base is used to convert the input sentence to the intermediate form. In case the entire input sentence matches with the example base, the rule-base module will simply find a durruny symbol and the rule-base only substitutes the stored intermediate form against the dummy symbol as its output.
The intermediate form, thus obtained, is converted to the target language text using a text language generator (3.8) following which an automated post editing (3.~) islprovided to improve the accuracy of the text output and also to improve its style of presentation. A human engineered post editing interface (3.9) is also provided to allow the user to remove any ambiguities that may remain after the automated post editing 'is over.
Figure 4 shows a block schematic of the module embodying main-translation engine of the present invention. The module (4.1) receives its input from the module (2.4) that invokes the appropriate translation engine l0 based on the nature of the text and identifies the sentence delimiter yielding a full sentence or a partial sentence as obtained in the identified text-zones.
This~module also records the input formatting information. that is used for formatting the target language text as obtained from the translation system.
15 The module (4.2) embodies algorithms for detecting acronyms and unknown words (4.12) and also, performing lexical and morphological analysis for each input word to facilitate search in the abstracted example database (4.3). The lexicons along with their properties, acronyms and unknown words with postulated tags, are stored in the on-line lexicons and 20 phrasals module (4.9) to reduce the search time for each subsequent search.
For a subsequent lexicon search, this module is searched first and if the lexicon is not found online it is later searched in the lexical database.
The module (4.3) is an abstracted example-base storing examples of source to target language translations. These examples are the most 25 commonly encountered phrases, groups of words, or full or partial sentences in the target language. The examples can be stored in raw form, i.e. the form in which they actually bccur, or in an abstracted form where the individual words or groups of words may be replaced by their r categories along with their properties. An abstracted example-base makes 30 the database compact as a number of actual examples may match a single entry in the target language. An,example can be used to clarify the difference. between an entry in the raw form and in the abstracted form stored in the example base (4.3). The sentence "Ram goes to Delhi" is in ' ' the raw form as it is .used in the source language, i.e., English.
However; the basic structure of the sentence can be abstracted to the form "<NP1>
<verb2-movement-type> to {City}". In other words, the constants in a sentence can be replaced with variables making it broader and generic. This to abstracted form can be stored in the example base and thereafter; any other sentence that uses the same structure such as "Fred goes to London" can be translated using this abstracted form. Another example of a sample entry in the abstracted example-base may be "inspite of <NP1> being <PP2>
{ place } $ADV$ _> <NP1><PP2>KS { BE verbs } { inspite of } ". This will match a number of sentence fragments such as " inspite of me being there' or ' inspite of a lot of people being at the premises of the court' or 'inspite of John and Mary being here' and so on. Thus, this approach helps to reduce the storage space requirements of the database and increase its efficiency.
An example in the example-base consists of two parts: Left-hand side (source language part) contains English words and variables (which could be substituted by only an English word or a group of words, that satisfy the properties associated with the variable). The Right-hand side contains the corresponding intermediate form representation as per the .
word order of the target Indian language.
An input sentence is first matched with the left-hand side of the example base to locate the largest matching chunk of example sentence corresponding to the input sentence. If a match is found above a certain threshold minimum distance value, the intermediate form on the right hand-side of the matching example is stored against a distinct dummy variable name by the module (4.10). At. the same time, part of the sentence that matched with the example-base, is substituted with the distinct dummy variable name along with the properties of that component as obtained from - the example-base. -The example-base can be created interactively using the translation system of this invention as depicted in figure 7 andlor by using a bi-lingual corpora. The example base can be further expanded by incorporating new l0 examples in the source language along with their corresponding translation in the target language for improving the quality of the translation.
Statistical information can be used for more efficiently expanding the database based on the frequency of occurrence of phrases in the source language. The most often occurring phrases can be tracked and added to the example base in .
this manner. The quality of translation is improved as the examples capture the contextual information under which meanings of a word or word groups may differ. Different contexts lead to distinct examples in the example-base leading to minimal or no effort in disambiguation in obtaining the translation.
A Pattern directed rule-based converter module (4.4) transforms the input sentence of the source language to an intermediate form based on the grammatical pattern of the input sentence. A rule is invoked when the grammatical pattern matches that of the input sentence. This matching may be performed recursively and multiple matches yield multiple translations.
For each match there is a corresponding intermediate form. The intermediate form contains all the information obtained from the lexical .
date-base and has the word order as per target Indian language. The intermediate form is pseudo-interlingua for Indian languages.
r The two modules (4.3, 4.4) together form the heart of the text translation engine of the system and ensure hybridization of example-based and rule-based methodologies. 'fhe hybridization method presented in this invention attempts to get the best results from both the methodologies.
When a source language text is being translated, tlae system of this invention, first uses the example-base and then the rule-base for translation for remaining unmatched part, if any. On the other hand, at the time of system development, the example base is expandable in an user interactive manner. The input sentence is first translated using the pattern directed rule base and if the translation is found unsatisfactory, then the sentence is added to the example base in the abstracted form. In this way, the example base grows over a period of time and starts bending towards saturation. .
This is further illustrated in figure 7.
The output of the Pattern directed rule base or the example base is an intermediate form (4.5).
All nouns encountered by modules (4.3,4.4) are stored in a history list of nouns (4.11) that is used for resolving pronoun reference ambiguity.
The hierarchical domain specific multilingual lexical database (4.8) is organized as Directed Acyclic Graph (DAG) linking domains with sub domains. This is further illustrated through an example in Figure 5. The structure of the database as depicted in figure 5 is only for illustrative purposes and it may be expanded by adding new domains and sub-domains if required. The structure of the multilingual lexical database helps to reduce the sense ambiguity of the words in an input sentence.
The text generator modules -(4.6, 4.7), each provided for a particular target language, takes the intermediate form generated by the rule base .
module (4.5) and also as obtained from the example base (4.10) and converts it into the unstructured target language text output.
Figure 5 depicts an example of Domain Hierarchy in the form of DAG (Directed Acyclic Graph) used in the present invention. The top node of the DAG is the iGeneral' dpW a'in (5.1) that contains the words and phrases not belonging to any particular specialised sub domain. The sub domains at the next level in the hierarchy are broad domains such as General .science.(5.2), Social science (5.3), History (5-.4),: Geography (5.5), Political science (5.6), Health and medicine (5.7), Religion (5.8) and others like these. A domain at this level might have more specialised sub domains, for example, the General science (5:2)'domain can have 3 sub domains l0 namely Physics (5.9), Chemistry (5.10) and Biological science (5.11 ). The Biological science (5.11) sub domain can further have even more specialised sub domains as Zoology (5.r13) and Botany (5.14). One or more parent domains can share the specialised sub domains. For example, Zoology (5.13) and Botany (5.14) sub domains are shared by Biological science (5.11) and Health and medicine (5.7) parent domains. The domain hierarchy as described herein is meant for illustrative purposes only and is not a limitation of the hierarchical multilingual database used by the invention. It can be easily scaled up to include more domains and sub domains and expand the hierarchy.
When the domain of the text to be translated is identified, the system looks for lexical entries in the identified domain. For example, if the identified domain is Botany (5.14), the system searches this domain for any lexical entries to be matched. If it does not find an entry in this domain, the lexical entries in the parent domains of Biological science (5.11) and Health & Medicines in the hierarchy are searched in parallel. Tf the entries are still not found then the hierarchy is searched all the way up to the 'General' domain (5.1), that is searched in the end. The lexical database organized in this fashion helps in disambiguating meanings of the words in the input text r that is a specific object of. the system. As an example, if a user is translating text from Health and medicine domain (5.7), a word such as 'treatment' will get assigned the meaning~i~n the sense of 'behaviour' (in Hindi:
r 'vyavahaar').
Figure 6.is a block schematic of inputs used by the Text Generator Module for Hindi or other target Indian languages in the present invention.
The text generator module takes as its inputs: an intermediate code for sentences (&.1) and sentence part/phrasal intermediate code (6.2). The text generator uses verb categorization.aiid~expectation xules (6.7), semantic, l0 ontological (6.6) and morphological composition information (6.5) and a number of rules derived from Sanskrit 'Kayak' theory (6.9~ to synthesize text in the target Indian language leading to a more acceptable 'parsarg' symbols (post-positions) and help disambiguation. The pronoun z-eference disambiguation is achieved using a history list of nouns (6.3) and 15 disambiguation rules (6.8}. The unknown lexicons are transliterated into the script of the target language (6.11) and suitably transformed as per their guessed part of speech in the target language, For example, assume that an English verb "abort" is not present in the lexical database and the input sentence encounters the word "aborted" in the input sentence. This module 20 will take the meaning of "aborted" as "ebaurt kar" in Hindi ("ebaurt" is transliterated form of ~~oxd "abort" and "kar" is appended to obtain its form) if the unknown lexicon is guessed to be a verb in past tense. The final transliterated form for this part as per rules of composition will be " ebaurt kiyaa" which is quite an acceptable form in day-to-day usage in Zndia. The 2S output of the text generator module is the translated text in the target language (6.10).
Figure 7 shows a Block schematic illustrating the interactive method of Example-.base creation used in this invention. The input soLlrCe language text (7.1) is matched with the entries of the abstracted example-base (7.?) 30 by the Best-Match-Finder module (7.4). The best match finder module computes distance of the input source language text with each entry of the abstracted example-base available with the system at the time of ~s development. This distance computation is based on aggregated (weighted - sum) distances of attributes/properties associated with individual constituent symbols/words of the source and example texts. This distance is compared with a preset threshold (a parameter Leant by the system during experimentation) and a translation is~ produced (7.5) only when the l0 computed distance is less than the threshold value. For efficient searching of the example-base, the example-base is portioned in a logical manner and the search is confined to a partition or partition hierarchy. When the system developer does not find the translated output to be satisfactory or there is no translation produced due to thresholding, the system developer enters the correct translation as an additional example in the example-base (7.3). This way the system's example-base grows with exposure to more and more user interaction during the development stage and the curve of example-base growth starts showing a bending. The system developer may decide.an appropriate level of saturation for the system delivery for actual usage.
Claims (40)
1. A method for translating a source language into a target language comprising the steps of:
- identifying the nature of text extracted from a source document, - filtering and storing the text formatting and structure information of the extracted text, - selecting an appropriate text translation engine based on the nature of the extracted text, - using the text translation engine for analysing and translating the extracted text into an unformatted translated text, and - using the stored text formatting and structure information to process the unformatted text for obtaining a structured translated text document in the target language.
- identifying the nature of text extracted from a source document, - filtering and storing the text formatting and structure information of the extracted text, - selecting an appropriate text translation engine based on the nature of the extracted text, - using the text translation engine for analysing and translating the extracted text into an unformatted translated text, and - using the stored text formatting and structure information to process the unformatted text for obtaining a structured translated text document in the target language.
2. The method as claimed in claim 1 further comprising the step of performing post editing on the structured translated text document for improving the accuracy of the translation and its presentation style.
3. The method as claimed in claim 2 wherein the post editing step is performed automatically on the structured translated text document for removing target language specific ambiguities and errors that maybe present.
4. The method as claimed in claim 2 wherein the post editing step is performed by a manually on the structured translated text document for removing ambiguities and errors that maybe present.
5. The method as claimed:in claim 1 wherein the nature of the extracted text is identified by a source language specific knowledge base.
6. The method as claimed in claim 1 wherein nature of the text includes running text with full sentences, running text with partial sentences, address, text heading, news heading, mathematical expression, table, a transcripted speech text, a text in mixed languages, footnotes, text within quote marks, parenthesized items and like.
7. The method as claim 1 wherein text portions having different nature are translated using different text translation engines.
8. The method as claimed in claim 1 wherein the step of analysing the extracted text comprises the steps of:
- identifying the sentence unit delimiter of the extracted text for breaking the text into separate sentences, - performing the lexical analysis on each word of the sentence using a domain specific lexical database for disambiguating the meaning and identifying acronyms, abbreviations and unknown words in the sentence by identifying their domain, and - storing the analysed words (lexicons) along with their properties in an online-lexical and phrasal database and storing the unknown lexicons in a separate database for increasing the translation speed.
- identifying the sentence unit delimiter of the extracted text for breaking the text into separate sentences, - performing the lexical analysis on each word of the sentence using a domain specific lexical database for disambiguating the meaning and identifying acronyms, abbreviations and unknown words in the sentence by identifying their domain, and - storing the analysed words (lexicons) along with their properties in an online-lexical and phrasal database and storing the unknown lexicons in a separate database for increasing the translation speed.
9. The method as claimed in claim 8 wherein new domains and domain specific words can be added to said database for improving the accuracy of translation.
10. The method as claimed in claim 8 wherein a history list of nouns is maintained while analysing the words in the source language for resolving pronoun reference ambiguity.
11. The method as claimed in claim 1 wherein the step of translating the extracted text comprises the steps of:
- converting the analysed text or a part of it to an intermediate form, and translating the text in the intermediate form to the unformatted translated text.
- converting the analysed text or a part of it to an intermediate form, and translating the text in the intermediate form to the unformatted translated text.
12. The method as claimed in claim 11 wherein the analysed text is translated using an abstracted example base comprising commonly encountered phrases, groups of words and sentences.
13. The method as claimed in claim 12 wherein the analysed text is compared with the entries in the abstracted example base and is substituted with its corresponding translation in the pseudo-interlingua, when a match is found, to obtain an intermediate translated text.
14. The method as claimed in claim 12 wherein the example base is expanded by adding new entries based on users' feedback on accuracy of the obtained translated output for improving the quality of the translation.
15. The method as claimed in claim 12 wherein the example base can be expanded by adding new entries based on statistical information regarding the frequency of occurrence of the phrases in the source language for improving the quality of the translation.
16. The method as claimed in claim 11 wherein a rule based translation is done for the text or part of the text that are not present in the abstracted example base to obtain an intermediate translated text.
17. The method as claimed in claim 11 wherein a target language text generator is used for translating the intermediate text to the unformatted target language text.
18. The method as claimed in claim 17 wherein the text generator performs at least one of the following steps for translating the text in the intermediate form to the target language:
- morphological synthesis of different lexicons for the target language, - transliterating the unknown lexicons, - generating an appropriate form for unknown lexicons in the target language, - establishing semantic and ontological relationship, - using the history list of nouns and related rules for pronoun reference disambiguation, and - composing and restructuring the target language document using the stored text formatting and structure information to obtain a structured translated text document.
- morphological synthesis of different lexicons for the target language, - transliterating the unknown lexicons, - generating an appropriate form for unknown lexicons in the target language, - establishing semantic and ontological relationship, - using the history list of nouns and related rules for pronoun reference disambiguation, and - composing and restructuring the target language document using the stored text formatting and structure information to obtain a structured translated text document.
19. A system for translating a source language into a target language comprising:
- means for identifying the nature of text extracted from a source document, - means for filtering and storing the text formatting and structure information of the extracted text, - means for selecting an appropriate text translation engine based on the nature of the extracted text, - means for analysing and translating the extracted text into an unformatted translated text, and - means for using the stored text formatting and structure information to process the unformatted text for obtaining a structured translated text document in the target language.
- means for identifying the nature of text extracted from a source document, - means for filtering and storing the text formatting and structure information of the extracted text, - means for selecting an appropriate text translation engine based on the nature of the extracted text, - means for analysing and translating the extracted text into an unformatted translated text, and - means for using the stored text formatting and structure information to process the unformatted text for obtaining a structured translated text document in the target language.
20. The system as claimed in claim 19 further comprising editing means for performing post editing on the structured translated text document for improving the accuracy of the translation and its presentation style.
21. The system as claimed in claim 19 wherein means for identifying the nature of the extracted text is a source language specific knowledge base.
22. The system as claimed in claim 19 wherein means for analysing and translating the extracted text are text nature specific text translation engines.
23. The system as claimed in claim 19 wherein means for analysing and translating the extracted text comprises:
- means for identifying the sentence unit delimiter of the extracted text for breaking the text into separate sentences, - means for performing the lexical analysis on each word of the sentence, and - means for storing the analysed words (lexicons) along with their properties in an online-lexical and phrasal database and storing the unknown lexicons in a separate database for increasing the translation speed.
- means for identifying the sentence unit delimiter of the extracted text for breaking the text into separate sentences, - means for performing the lexical analysis on each word of the sentence, and - means for storing the analysed words (lexicons) along with their properties in an online-lexical and phrasal database and storing the unknown lexicons in a separate database for increasing the translation speed.
24. The system as claimed in claim 23 wherein means for performing the lexical analysis is a hierarchical domain specific multilingual database that can be expanded by adding new domains and domain specific words.
25. The system as claimed in claim 23 wherein said hierarchical domain specific multilingual database is organised as a Directed Acyclic Graph linking domains and sub-domains and stores verbs and nouns using paradigm coding for morphological synthesis rules in translation.
26. The system as claimed in claim 23 further comprising means for maintaining a history list of nouns for resolving pronoun reference ambiguity.
27. The system as claimed in claim 23 wherein means for translating the lexicons into an intermediate text is an expandable abstracted target language specific example base comprising commonly encountered phrases, groups of words and sentences.
28. The system as claimed in claim 23 further comprising rule based translating means for translating the text or part of text not present in the abstracted example base into an intermediate text.
29. The system as claimed in claim 27 or 28 wherein means for translating the intermediate text to the target language text is a target language text generator.
30. The system as claimed in claim 29 wherein the target language text generator comprises:
- means for morphological synthesis of different lexicons for the target language, - means for transliterating the unknown lexicons, - means for generating an appropriate form for unknown lexicons in the target language, - means for establishing semantic and ontological relationship, - means for using the history list of nouns and related rules for pronoun reference disambiguation, and - means for composing and restructuring the target language document using the stored text formatting and structure information to obtain a structured translated text document.
- means for morphological synthesis of different lexicons for the target language, - means for transliterating the unknown lexicons, - means for generating an appropriate form for unknown lexicons in the target language, - means for establishing semantic and ontological relationship, - means for using the history list of nouns and related rules for pronoun reference disambiguation, and - means for composing and restructuring the target language document using the stored text formatting and structure information to obtain a structured translated text document.
31. The system as claimed in claim 19 wherein the computing system nodes for translating a source language into a target language comprises:
- at least one system bus, - at least one communication unit connected to the system bus, - at least one memory unit connected to the system bus, wherein the memory includes a set of instructions, and - at least one central processing unit connected to the system bus, wherein the central processing unit executes the instructions in the memory for translating a source language into a target language.
- at least one system bus, - at least one communication unit connected to the system bus, - at least one memory unit connected to the system bus, wherein the memory includes a set of instructions, and - at least one central processing unit connected to the system bus, wherein the central processing unit executes the instructions in the memory for translating a source language into a target language.
32. The system as claimed in claim 31 further connected to other similar systems and that may contain means to complement and supplement the aforementioned means.
33. A computer program product comprising computer readable program code stored on computer readable storage medium embodied therein for translating a source language into a target language, comprising:
- computer readable program code means configured for identifying the nature of text extracted from a source document, - computer readable program code means configured for filtering and storing the text formatting and structure information of the extracted text, - computer readable program code means configured for selecting an appropriate text translation engine based on the nature of the extracted text, - computer readable program code means configured for analysing and translating the extracted text into an unformatted translated text, and - computer readable program code means configured for using the stored text formatting and structure information to process the unformatted text for obtaining a structured translated text document in the target language.
- computer readable program code means configured to expand the example-base interactively.
- computer readable program code means configured to derive abstracted examples from the raw examples.
- computer readable program code means configured for identifying the nature of text extracted from a source document, - computer readable program code means configured for filtering and storing the text formatting and structure information of the extracted text, - computer readable program code means configured for selecting an appropriate text translation engine based on the nature of the extracted text, - computer readable program code means configured for analysing and translating the extracted text into an unformatted translated text, and - computer readable program code means configured for using the stored text formatting and structure information to process the unformatted text for obtaining a structured translated text document in the target language.
- computer readable program code means configured to expand the example-base interactively.
- computer readable program code means configured to derive abstracted examples from the raw examples.
34. The computer program product as claimed in claim 33 further comprising computer readable program code means configured for performing post editing on the structured translated text document for improving the accuracy of the translation and its presentation style.
35. The computer program product as claimed in claim 33 wherein computer readable program code means configured for analysing the extracted text comprises:
- computer readable program code means configured for identifying the sentence unit delimiter of the extracted text for breaking the text into separate sentences, - computer readable program code means configured for performing the lexical analysis on each word of the sentence using a lexical database for disambiguating the meaning and identifying acronyms, abbreviations and unknown words in the sentence, and - computer readable program code means configured for storing the analysed words (lexicons) along with their properties in an online-lexical and phrasal database and storing the unknown lexicons in a separate database for increasing the translation speed.
- computer readable program code means configured for performing match and compute distance of the input source text or its part with an abstracted example-base and thresholding the distance for deciding acceptability of the translated output.
- computer readable program code means configured for invoking the rule-base associated with the translation engine.
- computer readable program code means configured for identifying the sentence unit delimiter of the extracted text for breaking the text into separate sentences, - computer readable program code means configured for performing the lexical analysis on each word of the sentence using a lexical database for disambiguating the meaning and identifying acronyms, abbreviations and unknown words in the sentence, and - computer readable program code means configured for storing the analysed words (lexicons) along with their properties in an online-lexical and phrasal database and storing the unknown lexicons in a separate database for increasing the translation speed.
- computer readable program code means configured for performing match and compute distance of the input source text or its part with an abstracted example-base and thresholding the distance for deciding acceptability of the translated output.
- computer readable program code means configured for invoking the rule-base associated with the translation engine.
36. The computer program product;as. claimed in claim 35 further comprising computer readable program code means configured for maintaining a history list of nouns for resolving pronoun reference ambiguity.
37. The computer program product.as claimed in claim 35 further comprising computer readable program code means configured for maintaining an abstracted example base of commonly encountered phrases, groups of words and sentences.
38. The computer program product as claimed in claim 35 comprising computer readable program code means configured for performing rule based translation of text or part of text that are not present in the abstracted example base.
39. The computer program product as claimed in claims 37 or 38 comprising computer readable program code means configured for translating the intermediate text into the target language text.
40. The computer program product as claimed in claim 39 wherein computer readable program code means configured for translating the intermediate text into the target language text the text comprises:
- computer readable program code means configured for performing morphological synthesis of different lexicons for the target language, - computer readable program code means configured for transliterating the unknown lexicons, - computer readable program code means configured for generating. an-appropriate form for unknown lexicons in the target language, - computer readable program code means configured for establishing semantic and ontological relationship, - computer readable program code means configured for using the history list of nouns and related rules for pronoun reference disambiguation, and - computer readable program code means configured for composing and restructuring the target language document using the stored text formatting and structure information to obtain a structured translated text document.
- computer readable program code means configured for performing morphological synthesis of different lexicons for the target language, - computer readable program code means configured for transliterating the unknown lexicons, - computer readable program code means configured for generating. an-appropriate form for unknown lexicons in the target language, - computer readable program code means configured for establishing semantic and ontological relationship, - computer readable program code means configured for using the history list of nouns and related rules for pronoun reference disambiguation, and - computer readable program code means configured for composing and restructuring the target language document using the stored text formatting and structure information to obtain a structured translated text document.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/IN2004/000093 WO2005096708A2 (en) | 2004-04-06 | 2004-04-06 | A system for multiligual machine translation from english to hindi and other indian languages using pseudo-interlingua and hybridized approach |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2562366A1 true CA2562366A1 (en) | 2005-10-20 |
Family
ID=35125496
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002562366A Abandoned CA2562366A1 (en) | 2004-04-06 | 2004-04-06 | A system for multiligual machine translation from english to hindi and other indian languages using pseudo-interlingua and hybridized approach |
Country Status (6)
| Country | Link |
|---|---|
| US (1) | US20080040095A1 (en) |
| EP (1) | EP1754169A4 (en) |
| JP (1) | JP2007532995A (en) |
| AU (1) | AU2004318192A1 (en) |
| CA (1) | CA2562366A1 (en) |
| WO (1) | WO2005096708A2 (en) |
Families Citing this family (62)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040243531A1 (en) * | 2003-04-28 | 2004-12-02 | Dean Michael Anthony | Methods and systems for representing, using and displaying time-varying information on the Semantic Web |
| WO2005057425A2 (en) * | 2005-03-07 | 2005-06-23 | Linguatec Sprachtechnologien Gmbh | Hybrid machine translation system |
| JP2006252049A (en) * | 2005-03-09 | 2006-09-21 | Fuji Xerox Co Ltd | Translation system, translation method and program |
| US20060229866A1 (en) * | 2005-04-07 | 2006-10-12 | Business Objects, S.A. | Apparatus and method for deterministically constructing a text question for application to a data source |
| US20060245005A1 (en) * | 2005-04-29 | 2006-11-02 | Hall John M | System for language translation of documents, and methods |
| US10319252B2 (en) | 2005-11-09 | 2019-06-11 | Sdl Inc. | Language capability assessment and training apparatus and techniques |
| US20080003551A1 (en) * | 2006-05-16 | 2008-01-03 | University Of Southern California | Teaching Language Through Interactive Translation |
| US8706471B2 (en) * | 2006-05-18 | 2014-04-22 | University Of Southern California | Communication system using mixed translating while in multilingual communication |
| US8032355B2 (en) * | 2006-05-22 | 2011-10-04 | University Of Southern California | Socially cognizant translation by detecting and transforming elements of politeness and respect |
| US8032356B2 (en) * | 2006-05-25 | 2011-10-04 | University Of Southern California | Spoken translation system using meta information strings |
| WO2008007386A1 (en) * | 2006-07-14 | 2008-01-17 | Koranahally Chandrashekar Rudr | A method for run time translation to create language interoperability environment [lie] and system thereof |
| US9122674B1 (en) | 2006-12-15 | 2015-09-01 | Language Weaver, Inc. | Use of annotations in statistical machine translation |
| CA2675208A1 (en) * | 2007-01-10 | 2008-07-17 | National Research Council Of Canada | Means and method for automatic post-editing of translations |
| US8131536B2 (en) * | 2007-01-12 | 2012-03-06 | Raytheon Bbn Technologies Corp. | Extraction-empowered machine translation |
| US7890539B2 (en) * | 2007-10-10 | 2011-02-15 | Raytheon Bbn Technologies Corp. | Semantic matching using predicate-argument structure |
| JP5007977B2 (en) * | 2008-02-13 | 2012-08-22 | 独立行政法人情報通信研究機構 | Machine translation apparatus, machine translation method, and program |
| KR101462932B1 (en) * | 2008-05-28 | 2014-12-04 | 엘지전자 주식회사 | Mobile terminal and text correction method |
| US20090326916A1 (en) * | 2008-06-27 | 2009-12-31 | Microsoft Corporation | Unsupervised chinese word segmentation for statistical machine translation |
| US9798720B2 (en) | 2008-10-24 | 2017-10-24 | Ebay Inc. | Hybrid machine translation |
| US8332205B2 (en) * | 2009-01-09 | 2012-12-11 | Microsoft Corporation | Mining transliterations for out-of-vocabulary query terms |
| US8990064B2 (en) * | 2009-07-28 | 2015-03-24 | Language Weaver, Inc. | Translating documents based on content |
| US8655644B2 (en) * | 2009-09-30 | 2014-02-18 | International Business Machines Corporation | Language translation in an environment associated with a virtual application |
| KR101301536B1 (en) * | 2009-12-11 | 2013-09-04 | 한국전자통신연구원 | Method and system for serving foreign language translation |
| US10417646B2 (en) | 2010-03-09 | 2019-09-17 | Sdl Inc. | Predicting the cost associated with translating textual content |
| WO2011163477A2 (en) * | 2010-06-24 | 2011-12-29 | Whitesmoke, Inc. | Systems and methods for machine translation |
| RU2010151821A (en) * | 2010-12-17 | 2012-06-27 | Виталий Евгеньевич Пилкин (RU) | METHOD FOR AUTOMATED TRANSFER OF INFORMATION |
| CN102622342B (en) * | 2011-01-28 | 2018-09-28 | 上海肇通信息技术有限公司 | Intermediate family of languages system, intermediate language engine, intermediate language translation system and correlation method |
| US9063931B2 (en) * | 2011-02-16 | 2015-06-23 | Ming-Yuan Wu | Multiple language translation system |
| US10140320B2 (en) | 2011-02-28 | 2018-11-27 | Sdl Inc. | Systems, methods, and media for generating analytical data |
| US11003838B2 (en) | 2011-04-18 | 2021-05-11 | Sdl Inc. | Systems and methods for monitoring post translation editing |
| WO2012145782A1 (en) * | 2011-04-27 | 2012-11-01 | Digital Sonata Pty Ltd | Generic system for linguistic analysis and transformation |
| KR20130014106A (en) * | 2011-07-29 | 2013-02-07 | 한국전자통신연구원 | Apparatus and method for translating using multiple translation engine |
| US9984054B2 (en) | 2011-08-24 | 2018-05-29 | Sdl Inc. | Web interface including the review and manipulation of a web document and utilizing permission based control |
| US8954315B2 (en) | 2011-10-10 | 2015-02-10 | Ca, Inc. | System and method for mixed-language support for applications |
| US9367539B2 (en) | 2011-11-03 | 2016-06-14 | Microsoft Technology Licensing, Llc | Techniques for automated document translation |
| US10261994B2 (en) | 2012-05-25 | 2019-04-16 | Sdl Inc. | Method and system for automatic management of reputation of translators |
| US9152622B2 (en) | 2012-11-26 | 2015-10-06 | Language Weaver, Inc. | Personalized machine translation via online adaptation |
| US20140244237A1 (en) * | 2013-02-28 | 2014-08-28 | Intuit Inc. | Global product-survey |
| CN105408891B (en) * | 2013-06-03 | 2019-05-21 | Mz Ip控股有限责任公司 | System and method for the multilingual communication of multi-user |
| US9613021B2 (en) | 2013-06-13 | 2017-04-04 | Red Hat, Inc. | Style-based spellchecker tool |
| JP2015060458A (en) * | 2013-09-19 | 2015-03-30 | 株式会社東芝 | Machine translation system, method and program |
| US9213694B2 (en) | 2013-10-10 | 2015-12-15 | Language Weaver, Inc. | Efficient online domain adaptation |
| US9330331B2 (en) | 2013-11-11 | 2016-05-03 | Wipro Limited | Systems and methods for offline character recognition |
| RU2592395C2 (en) * | 2013-12-19 | 2016-07-20 | Общество с ограниченной ответственностью "Аби ИнфоПоиск" | Resolution semantic ambiguity by statistical analysis |
| RU2642343C2 (en) * | 2013-12-19 | 2018-01-24 | Общество с ограниченной ответственностью "Аби Продакшн" | Automatic composition of semantic description of target language |
| US9530161B2 (en) | 2014-02-28 | 2016-12-27 | Ebay Inc. | Automatic extraction of multilingual dictionary items from non-parallel, multilingual, semi-structured data |
| US9940658B2 (en) | 2014-02-28 | 2018-04-10 | Paypal, Inc. | Cross border transaction machine translation |
| US9569526B2 (en) | 2014-02-28 | 2017-02-14 | Ebay Inc. | Automatic machine translation using user feedback |
| US9881006B2 (en) | 2014-02-28 | 2018-01-30 | Paypal, Inc. | Methods for automatic generation of parallel corpora |
| CN105159889B (en) * | 2014-06-16 | 2017-09-15 | 吕海港 | A kind of interpretation method for the intermediary's Chinese language model for generating C MT |
| WO2016033617A2 (en) * | 2014-08-28 | 2016-03-03 | Duy Thang Nguyen | Method of asynchronous machine translation |
| US9959271B1 (en) | 2015-09-28 | 2018-05-01 | Amazon Technologies, Inc. | Optimized statistical machine translation system with rapid adaptation capability |
| US10268684B1 (en) | 2015-09-28 | 2019-04-23 | Amazon Technologies, Inc. | Optimized statistical machine translation system with rapid adaptation capability |
| US10185713B1 (en) * | 2015-09-28 | 2019-01-22 | Amazon Technologies, Inc. | Optimized statistical machine translation system with rapid adaptation capability |
| US10503832B2 (en) | 2016-07-29 | 2019-12-10 | Rovi Guides, Inc. | Systems and methods for disambiguating a term based on static and temporal knowledge graphs |
| WO2018047436A1 (en) * | 2016-09-09 | 2018-03-15 | パナソニックＩｐマネジメント株式会社 | Translation device and translation method |
| CN107526726B (en) * | 2017-07-27 | 2020-09-22 | 山东科技大学 | Method for automatically converting Chinese process model into English natural language text |
| JP6784718B2 (en) * | 2018-04-13 | 2020-11-11 | グリー株式会社 | Game programs and game equipment |
| US11836454B2 (en) | 2018-05-02 | 2023-12-05 | Language Scientific, Inc. | Systems and methods for producing reliable translation in near real-time |
| US20200210530A1 (en) * | 2018-12-28 | 2020-07-02 | Anshuman Mishra | Systems, methods, and storage media for automatically translating content using a hybrid language |
| CN111798832A (en) * | 2019-04-03 | 2020-10-20 | 北京京东尚科信息技术有限公司 | Speech synthesis method, apparatus and computer-readable storage medium |
| CN114168251A (en) * | 2022-02-14 | 2022-03-11 | 龙旗电子(惠州)有限公司 | Language switching method, device, equipment, computer readable storage medium and product |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| ES2101613B1 (en) * | 1993-02-02 | 1998-03-01 | Uribe Echebarria Diaz De Mendi | COMPUTER-ASSISTED INTERLINGUAL AUTOMATIC TRANSLATION METHOD. |
| US6470306B1 (en) * | 1996-04-23 | 2002-10-22 | Logovista Corporation | Automated translation of annotated text based on the determination of locations for inserting annotation tokens and linked ending, end-of-sentence or language tokens |
| CA2286935C (en) * | 1997-05-28 | 2001-02-27 | Shinar Linguistic Technologies Inc. | Translation system |
| US20020169592A1 (en) * | 2001-05-11 | 2002-11-14 | Aityan Sergey Khachatur | Open environment for real-time multilingual communication |
-
2004
- 2004-04-06 CA CA002562366A patent/CA2562366A1/en not_active Abandoned
- 2004-04-06 US US11/547,803 patent/US20080040095A1/en not_active Abandoned
- 2004-04-06 AU AU2004318192A patent/AU2004318192A1/en not_active Abandoned
- 2004-04-06 EP EP04725979A patent/EP1754169A4/en not_active Withdrawn
- 2004-04-06 JP JP2007506908A patent/JP2007532995A/en active Pending
- 2004-04-06 WO PCT/IN2004/000093 patent/WO2005096708A2/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| WO2005096708A2 (en) | 2005-10-20 |
| WO2005096708A3 (en) | 2007-02-22 |
| US20080040095A1 (en) | 2008-02-14 |
| EP1754169A2 (en) | 2007-02-21 |
| EP1754169A4 (en) | 2008-03-05 |
| JP2007532995A (en) | 2007-11-15 |
| AU2004318192A1 (en) | 2005-10-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20080040095A1 (en) | System for Multiligual Machine Translation from English to Hindi and Other Indian Languages Using Pseudo-Interlingua and Hybridized Approach | |
| Tiedemann | Recycling translations: Extraction of lexical data from parallel corpora and their application in natural language processing | |
| Jacquemin et al. | NLP for term variant extraction: synergy between morphology, lexicon, and syntax | |
| KR101031970B1 (en) | Statistical method and apparatus for learning translation relationships among phrases | |
| US20070233460A1 (en) | Computer-Implemented Method for Use in a Translation System | |
| US9053090B2 (en) | Translating texts between languages | |
| JP2005535007A (en) | Synthesizing method of self-learning system for knowledge extraction for document retrieval system | |
| Wong | Example-based machine translation | |
| Way | A hybrid architecture for robust MT using LFG-DOP. | |
| Lavie et al. | Experiments with a Hindi-to-English transfer-based MT system under a miserly data scenario | |
| Shirko et al. | Machine translation of noun phrases from Arabic to English using transfer-based approach | |
| JPH10312382A (en) | Similar example translation system | |
| US20220229990A1 (en) | System and method for lookup source segmentation scoring in a natural language understanding (nlu) framework | |
| US20220229986A1 (en) | System and method for compiling and using taxonomy lookup sources in a natural language understanding (nlu) framework | |
| US20220237383A1 (en) | Concept system for a natural language understanding (nlu) framework | |
| Satpathy et al. | Analysis of Learning Approaches for Machine Translation Systems | |
| JP2005025555A (en) | Thesaurus construction system, thesaurus construction method, program for executing the method, and storage medium with the program stored thereon | |
| Sankaravelayuthan et al. | A Comprehensive Study of Shallow Parsing and Machine Translation in Malaylam | |
| JP4033093B2 (en) | Natural language processing system, natural language processing method, and computer program | |
| Seresangtakul et al. | Thai-Isarn dialect parallel corpus construction for machine translation | |
| Samantaray | A Data mining approach for resolving cases of Multiple Parsing in Machine Aided Translation of Indian Languages | |
| Samir et al. | Training and evaluation of TreeTagger on Amazigh corpus | |
| US20220245352A1 (en) | Ensemble scoring system for a natural language understanding (nlu) framework | |
| Boroş et al. | Romanian-English speech translation | |
| US20220229987A1 (en) | System and method for repository-aware natural language understanding (nlu) using a lookup source framework |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued |