Data processing: speech signal processing – linguistics – language – Linguistics – Translation machine
Reexamination Certificate
1999-10-18
2004-08-17
Edouard, Patrick N. (Department: 2654)
Data processing: speech signal processing, linguistics, language
Linguistics
Translation machine
C704S009000
Reexamination Certificate
active
06778949
ABSTRACT:
FIELD OF THE INVENTION
This invention relates generally to natural language translation, and more particularly to manipulating linguistic structures that represent natural language expressions.
BACKGROUND OF THE INVENTION
With the continuing growth of multinational business dealings where the global economy brings together business people of all nationalities and with the ease and frequency of today's travel between countries, the demand for a machine-aided interpersonal communication system that provides accurate near real-time language translation is a compelling need. This system would relieve users of the need to possess specialized linguistic or translational knowledge.
A typical language translation system functions by using natural language processing. Natural language processing is generally concerned with the attempt to recognize a large pattern or sentence by decomposing it into small subpatterns according to linguistic rules. A natural language processing system uses considerable knowledge about the structure of the language, including what the words are, how words combine to form sentences, what the words mean, and how word meanings contribute to sentence meanings.
Morphological knowledge concerns how words are constructed from more basic units called morphemes. Syntactic knowledge concerns how words can be put together to form correct sentences and determines what structural role each word plays in the sentence and what phrases are subparts of what other phrases. Typical syntactic representations of language are based on the notion of context-free grammars, which represent sentence structure in terms of what phrases are subparts of other phrases. This syntactic information is often presented in a tree form. Semantic knowledge concerns what words mean and how these meanings combine in sentences to form sentence meanings. This is the study of context-independent meaning—the meaning a sentence has regardless of the context in which it is used.
Natural language processing systems further comprise interpretation processes that map from one representation to the other. For instance, the process that maps a sentence to its syntactic structure and/or logical form is called parsing, and it is performed by a component called a parser. The parser uses knowledge about word and word meaning, the lexicon, and a set of rules defining the legal structures, the grammar, in order to assign a syntactic structure and a logical form to an input sentence.
Formally, a context-free grammar of a language is a four-tuple comprising nonterminal vocabularies, terminal vocabularies, a finite set of production rules, and a starting symbol for all productions. The nonterminal and terminal vocabularies are disjunctive. The set of terminal symbols is called the vocabulary of the language.
The typical natural language processor, however, has realized only limited success because these processors are complex and require that the creator of the processor have extensive knowledge about the natural languages to be translated as well as having proficiency in the programming language used to implement the processor. Furthermore, typical natural language processors are dedicated to translating between two specific languages and in one direction only, making them ineffective when both languages need to be translated simultaneously, and rendering them useless when a translation into a different language is required.
SUMMARY OF THE INVENTION
The above-mentioned shortcomings, disadvantages and problems are addressed by the present invention, which will be understood by reading and studying the following specification.
Language-neutral methods for syntactic analysis, transfer, and morphological and syntactical generation of feature structures are utilized by a natural language translation system to translation an input expression in a source language into an output expression in a target language. The language-neutral methods are driven by language-specific grammars to translate between the specified languages so that no knowledge about the languages need be incorporated into modules that implement the methods. The modules interface with the grammar rules in the form of compiled statements in a grammar programming language (GPL) that perform the required manipulation of the feature structures.
Because the module are language-neutral, the creator of the modules only need know how to access the compiled grammar rules; no in-depth knowledge of the GPL or the natural language is required. Similarly, the creator of the natural language grammar rules only has to be proficient in the GPL and understand one or both of the natural languages to be translated. Furthermore, because the methods and modules are language-neutral, the system is readily adaptable to new languages simply by providing a grammar for the new language. Additionally, because each module and a corresponding grammar for a particular language can be encapsulated, multiple instances of the same module for different languages can execute simultaneously in the system, enabling it to simultaneously translate multiple languages.
The present invention describes systems, computers, methods, and computer-readable media of varying scope. In addition to the aspects and advantages of the present invention described in this summary, further aspects and advantages of the invention will become apparent by reference to the drawings and by reading the detailed description that follows.
REFERENCES:
patent: 4905138 (1990-02-01), Bourne
patent: 4974191 (1990-11-01), Amirghodsi et al.
patent: 5068789 (1991-11-01), van Vliembergen
patent: 5083268 (1992-01-01), Hemphill et al.
patent: 5088038 (1992-02-01), Tanaka et al.
patent: 5095432 (1992-03-01), Reed
patent: 5111398 (1992-05-01), Nunberg et al.
patent: 5418717 (1995-05-01), Su et al.
patent: 5426583 (1995-06-01), Uribe-Echebarria Diaz De Mendibil
patent: 5510981 (1996-04-01), Berger et al.
patent: 5528491 (1996-06-01), Kuno et al.
patent: 5535120 (1996-07-01), Chong et al.
patent: 5642519 (1997-06-01), Martin
patent: 5644775 (1997-07-01), Thompson et al.
patent: 5659765 (1997-08-01), Nii
patent: 5677835 (1997-10-01), Carbonell et al.
patent: 5680511 (1997-10-01), Baker et al.
patent: 5768603 (1998-06-01), Brown et al.
patent: 5799268 (1998-08-01), Boguraev
patent: 5806021 (1998-09-01), Chen et al.
patent: 5864788 (1999-01-01), Kutsumi
patent: 5873056 (1999-02-01), Liddy et al.
patent: 5884247 (1999-03-01), Christy
patent: 5907821 (1999-05-01), Kaji et al.
patent: 5963894 (1999-10-01), Richardson et al.
patent: 5966686 (1999-10-01), Heidorn et al.
patent: 5983169 (1999-11-01), Kozma
patent: 6131082 (2000-10-01), Hargrave, III et al.
patent: 6161083 (2000-12-01), Franz et al.
patent: 6173441 (2001-01-01), Klein
patent: 6243669 (2001-06-01), Horiguchi et al.
patent: 6285978 (2001-09-01), Bernth et al.
patent: 6301554 (2001-10-01), Christy
patent: 805 403 (1997-05-01), None
Timothy C. Bell et al., “Chapter 8: Dictionary Techniques”, Text Compression, Prentice Hall PTR, Englewood Cliffs, New Jersey 07632, pp. 206-243.
PCT Search Report dated Apr. 4, 2001, 4 pages.
PCT Search Report dated Feb. 22, 2001, 5 pages.
S. Kurohashi, T. Nakamura, Y. Matsumoto, M. Nagao. Improvements of Japanese Morphological Analyzer JUMAN. In: “Proceedings of the International Workshop on Sharable Natural Language Resources”, p. 22-28, Nara, Japan, 1994.
Kenneth W. Church, “A Stochastic Parts Program and Noun Phrase Parser for Unrestricted Text”, in Proceedings of the Second Applied Natural Language Processing Conference, Austin, TX, 1988.
Edited by Karen Jensen, George E. Heidorn, Stephen D. Richardson, “Natural Language Processing: The PLNLP Approach”, Kluwer Academic Publishers, 1993, 22 pages.
Stuart M. Shieber, An Introduction to Unification-based Aproaches to Grammar, CSLI, 1986, 23 pages.
M. Tomita, T. Mitamura, H. Musha, M. Kee, “The Generalized LR Parser/Compiler Version 8.1: User's Guide”, CMU-CMT-88-MEMO, Apr. 20, 1988, 44 pages.
M. Tomita, K. Knight, “Pseudo-Unification and Full-Unification”, CMU, 1987, 10 pages.
M. Ishii,
Duan Lei
Franz Alexander
Horiguchi Keiko
Blakely , Sokoloff, Taylor & Zafman LLP
Edouard Patrick N.
Sony Corporation
LandOfFree
Method and system to analyze, transfer and generate language... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and system to analyze, transfer and generate language..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system to analyze, transfer and generate language... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3314208