• Corpus ID: 15780925

CMU Project

  title={CMU Project},
  author={Masaru Tomita and Jaime G. Carbonell},
Accurate translation requires a degree of comprehension, and several projects have developed prototype systems to demonstrate the feasibility of knowledgebased machine translation (Carbonell 1981, Nirenburg 1986, Lytinen l984). These approaches combine syntactic and semantic information to produce an intermediate knowledge representation of the source text which is then generated in the target language. This paper does not attempt to revisit the ample rationale for the knowledge-based machine… 

Figures from this paper


Another Stride Towards Knowledge-Based Machine Translation
This paper presents a recent advance in multi-lingual knowledge-based machine translation (KBMT), which provides for separate syntactic and semantic knowledge sources that are integrated dynamically for parsing and generation.
The organization of knowledge in a multi-lingual, integrated parser (natural language, translation)
This thesis argues that natural language understanding should be integrated, in the sense that syntactic and semantic processing should take place at the same time, and argues that power can be gained by organizing syntax and semantics as two largely separate bodies of knowledge, which are combined only at the time of processing.
The Theory of Parsing, Translation, and Compiling
It is the hope that the algorithms and concepts presented in this book will survive the next generation of computers and programming languages, and that at least some of them will be applicable to fields other than compiler writing.
Dealing With Incompleteness of Linguistic Knowledge in Language Translation – Transfer and Generation Stage of Mu Machine Translation Project
This paper explains the details of the transfer and generation stages of Japanese-to-English system of the machine translation project by the Japanese Government, with the emphasis on the ideas to deal with the incompleteness of linguistic knowledge for machine translation.
A Structure-Sharing Representation for Unification-Based Grammar Formalisms
The present work is inspired by the structure-sharing method for theorem proving introduced by Boyer and Moore and on the variant of it that is used in some Prolog implementations.
Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms
A solution to the problem of extending parsing algorithms to formalisms with possibly infinite nonterminal domains, a solution based on a general technique the authors call restriction is discussed, including a complete, correct, terminating extension of Earley's algorithm that uses restriction to perform top-down filtering.
Functional Unification Grammar: A Formalism For Machine Translation
  • M. Kay
  • Computer Science
  • 1984
Functional Unification Grammar provides an opportunity to encompass within one formalism and computational system the parts of machine translation systems that have usually been treated separately,
Natural language dialogue in an integrated computational model
The computational system presented here, Psli3, uses the uniform framework of a production system architecture to carry out natural language understanding and generation in a well-integrated way, and demonstrates how flexible and natural user interactions can be carried out using a system with a naturally flexible control structure.
Parsing Spoken Language: a Semantic Caseframe Approach
This paper describes an extension of semantic caseframe parsing to restricted-domain spoken input, and applies the caseframe grammar in a quite different way, emphasizing island growing from caseframe headers.
An Efficient Context-Free Parsing Algorithm for Natural Languages
This thesis shows that Earley's forest representation has a defect and his representation cannot be used in natural language processing, and proposes a technique to disambiguate a sentence out of the shared-packed forest representation by asking the user questions interactively.