Results 1 - 10 of 128

Ontological Semantics

by Sergei Nirenburg, Victor Raskin , 2004
"... This book introduces ontological semantics, a comprehensive approach to the treatment of text meaning by computer. Ontological semantics is an integrated complex of theories, methodologies, descriptions and implementations. In ontological semantics, a theory is viewed as a set of statements determin ..."
Abstract - Cited by 128 (38 self) - Add to MetaCart
This book introduces ontological semantics, a comprehensive approach to the treatment of text meaning by computer. Ontological semantics is an integrated complex of theories, methodologies, descriptions and implementations. In ontological semantics, a theory is viewed as a set of statements determining the format of descriptions of the phenomena with which the theory deals. A theory is associated with a methodology used to obtain the descriptions. Implementations are computer systems that use the descriptions to solve specific problems in text processing. Implementations of ontological semantics are combined with other processing systems to produce applications, such as information extraction or machine translation. The theory of ontological semantics is built as a society of microtheories covering such diverse ground as specific language phenomena, world knowledge organization, processing heuristics and issues relating to knowledge representation and implementation system architecture. The theory briefly sketched above is a top-level microtheory, the ontological semantics theory per se. Descriptions in ontological semantics include text meaning representations, lexical entries, ontological concepts and instances as well as procedures for manipulating texts and their meanings. Methodologies in ontological semantics are sets of techniques and instructions for acquiring and
(Show Context)

Large-scale dictionary construction for foreign language tutoring and interlingual machine translation

by Bonnie J. Dorr - MACHINE TRANSLATION , 1997
"... This paper describes techniques for automatic construction of dictionaries for use in large-scale foreign language tutoring (FLT) and interlingual machine translation (MT) systems. The dictionaries are based on a language-independent representation called lexical conceptual structure (LCS). A primar ..."
Abstract - Cited by 93 (11 self) - Add to MetaCart
This paper describes techniques for automatic construction of dictionaries for use in large-scale foreign language tutoring (FLT) and interlingual machine translation (MT) systems. The dictionaries are based on a language-independent representation called lexical conceptual structure (LCS). A primary goal of the LCS research is to demonstrate that synonymous verb senses share distributional patterns. In this paper, we show how the syntax-semantics relation can be used to develop a lexical acquisition approach that contributes both toward the enrichment of existing online resources and toward the development of lexicons containing more complete information than is provided in any of these resources alone. We start by describing the structure of the LCS and showing how this representation is used in FLT and MT. We then focus on the problem of building LCS dictionaries for large-scale FLT and MT. First, we describe authoring tools for manual and semi-automatic construction of LCS dictionaries; we then present a more sophisticated approach that uses linguistic techniques for building word defmitions automatically. These techniques have been implemented as part of a set of lexicon-development tools used in the MILT FLT project (Dorr et al., 1995; Sams, 1995; Weinberg et al., 1995) and in the PRINCITRAN MT project (Dorr et al., 1995b).

Translation using Minimal Recursion Semantics

by Ann Copestake, Dan Flickinger, Rob Malouf, Susanne Riehemann, Ivan Sag - In Proceedings of the Sixth International Conference on Theoretical and Methodological Issues in Machine Translation , 1995
"... We describe minimal recursion semantics (MRS), a framework for semantics within HPSG, which considerably simplies transfer and generation. We discuss why, in general, a semantic representation with minimal structure is desirable for transfer and illustrate how a descriptively adequate representation ..."
Abstract - Cited by 91 (16 self) - Add to MetaCart
We describe minimal recursion semantics (MRS), a framework for semantics within HPSG, which considerably simplies transfer and generation. We discuss why, in general, a semantic representation with minimal structure is desirable for transfer and illustrate how a descriptively adequate representation with a non-recursive structure may be achieved. The paper illustrates the application of MRS to transfer with a series of examples and compares the approach to others which have been previously adopted within unication based frameworks. Our account involves the use of both language-specic and interlingual predicates or relations and we illustrate how this may be exploited to allow MRS to be used to investigate dierent lexical semantic approaches. 1 Semantic representation and transfer In this paper we describe a semantic representation for HPSG known as minimal recursion semantics (MRS), which is being utilized in the English grammar being developed for the Verbmobil project. Verbmobil...
(Show Context)

Machine Translation Using Probabilistic Synchronous Dependency Insertion Grammars

by Yuan Ding, Martha Palmer , 2005
"... Syntax-based statistical machine translation (MT) aims at applying statistical models to structured data. In this paper, we present a syntax-based statistical machine translation system based on a probabilistic synchronous dependency insertion grammar. Synchronous dependency insertion grammars are a ..."
Abstract - Cited by 83 (0 self) - Add to MetaCart
Syntax-based statistical machine translation (MT) aims at applying statistical models to structured data. In this paper, we present a syntax-based statistical machine translation system based on a probabilistic synchronous dependency insertion grammar. Synchronous dependency insertion grammars are a version of synchronous grammars defined on dependency trees. We first introduce our approach to inducing such a grammar from parallel corpora. Second, we describe the graphical model for the machine translation task, which can also be viewed as a stochastic tree-to-tree transducer. We introduce a polynomial time decoding algorithm for the model. We evaluate the outputs of our MT system using the NIST and Bleu automatic MT evaluation software. The result shows that our system outperforms the baseline system based on the IBM models in both translation speed and quality.
(Show Context)

Learning Dependency Translation Models as Collections of Finite State Head Transducers

by Hiyan Alshawi, Shona Douglas, Srinivas Bangalore - Computational Linguistics , 2000
"... The paper defines weighted head transducers,finite-state machines that perform middle-out string transduction. These transducers are strictly more expressive than the special case of standard leftto-right finite-state transducers. Dependency transduction models are then defined as collections of wei ..."
Abstract - Cited by 77 (3 self) - Add to MetaCart
The paper defines weighted head transducers,finite-state machines that perform middle-out string transduction. These transducers are strictly more expressive than the special case of standard leftto-right finite-state transducers. Dependency transduction models are then defined as collections of weighted head transducers that are applied hierarchically. A dynamic programming search algorithm is described for finding the optimal transduction of an input string with respect to a dependency transduction model. A method for automatically training a dependency transduction model from a set of input-output example strings is presented. The method first searches for hierarchical alignments of the training examples guided by correlation statistics, and then constructs the transitions of head transducers that are consistent with these alignments. Experimental results are given for applying the training method to translation from English to Spanish and Japanese. 1.
(Show Context)

Bilingual parsing with factored estimation: Using English to parse Korean

by David A. Smith, Noah A. Smith - In Proc. of EMNLP , 2004
"... We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, can be effectively combined into a unified bilingual parser that jointly searches for the best English parse, Korean parse ..."
Abstract - Cited by 60 (14 self) - Add to MetaCart
We describe how simple, commonly understood statistical models, such as statistical dependency parsers, probabilistic context-free grammars, and word-to-word translation models, can be effectively combined into a unified bilingual parser that jointly searches for the best English parse, Korean parse, and word alignment, where these hidden structures all constrain each other. The model used for parsing is completely factored into the two parsers and the TM, allowing separate parameter estimation. We evaluate our bilingual parser on the Penn Korean Treebank and against several baseline systems and show improvements parsing Korean with very limited labeled data. 1

Multitext grammars and synchronous parsers.

by I Dan Melamed - In Proceedings of the 2003 Meeting of the North American chapter of the Association for Computational Linguistics (NAACL-03), , 2003
"... ..."
Abstract - Cited by 57 (5 self) - Add to MetaCart
Abstract not found

Loosely Tree-Based Alignment for Machine Translation

by Daniel Gildea , 2003
"... We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computational complexity polynomial in the sentence length. This is done by adding a new subtree cloning operation to eithe ..."
Abstract - Cited by 52 (0 self) - Add to MetaCart
We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computational complexity polynomial in the sentence length. This is done by adding a new subtree cloning operation to either tree-to-string or tree-to-tree alignment algorithms.

Head Automata and Bilingual Tiling: Translation with Minimal Representations

by Hiyan Alshawi , 1996
"... We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for incremental application of lexical associations in a dynamic programming search for optimal dependency tree derivations. We ..."
Abstract - Cited by 50 (3 self) - Add to MetaCart
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for incremental application of lexical associations in a dynamic programming search for optimal dependency tree derivations. We also
(Show Context)

Semantic-based Transfer

by Michael Dorna, Martin C. Emele , 1996
"... This article presents a new semanticbased transfer approach developed and applied within the Verbmobil Machine Translation project. We give an overview of the declarative transfer fo,'malism to- gether with its procedural realization. Our approach is discussed and compared with several other ap ..."
Abstract - Cited by 41 (7 self) - Add to MetaCart
This article presents a new semanticbased transfer approach developed and applied within the Verbmobil Machine Translation project. We give an overview of the declarative transfer fo,'malism to- gether with its procedural realization. Our approach is discussed and compared with several other approaches f,'om the MT literature. The results presented in this article have been implemented and integrated into the Verbmobil system.