Results 1 -
3 of
3
Word-Sense Disambiguation Using Statistical Methods
- In Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics
, 1991
"... We describe a statistical technique for assigning senses to words. An instance of a word is assigned a sense by asking a question about the context in which the word appears. The question is constructed to have high mutual information with the translation of that instance in another lan- guage. Whe ..."
Abstract
-
Cited by 166 (2 self)
- Add to MetaCart
We describe a statistical technique for assigning senses to words. An instance of a word is assigned a sense by asking a question about the context in which the word appears. The question is constructed to have high mutual information with the translation of that instance in another lan- guage. When we incorporated this method of assigning senses into our statistical machine translation system, the error rate of the system decreased by thirteen percent.
An Ontological-Semantic Framework for Text Analysis
, 1997
"... The Knowledge-Based Machine Translation paradigm requires a comprehensive analysis of input texts into an unambiguous machine-tractable representation of the propositional and meta-propositional meaning of that text, for which we use a particular framework referred to as ontological semantics. Th ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
The Knowledge-Based Machine Translation paradigm requires a comprehensive analysis of input texts into an unambiguous machine-tractable representation of the propositional and meta-propositional meaning of that text, for which we use a particular framework referred to as ontological semantics. The work presented here begins with a definition of a representation language for lexical semantic specification (and syntax/semantics interface) to support such an analysis, as well as a generalized algorithm for building the meaning representation from these lexical semantic specifications, utilizing the ontology and a syntactic parse as knowledge sources. The core of the algorithm is an algorithm for semantic constraint satisfaction and relaxation, involving finding the best path over the ontology between a candidate filler of a relation and semantic constraints on that relation. The ontology is viewed as a multi-dimensional graph, with distinct topologies in each dimension reflecting specific semantic relations between nodes (representing concepts) , where weights or arc distance reflects strength of semantic relatedness in context (where the path-so-far context is maintained in a state transition table).
Lexical and World Knowledge: Theoretical and . . .
, 1991
"... This paper uses three of these as a springboard (or better soapbox) for presenting my views on the SapirWhorl hypothesis (that is, the various detenninisfic positions on perception, cognition, and language structure). It is hoped that this such expression will be preaching to the choir, though it ..."
Abstract
- Add to MetaCart
This paper uses three of these as a springboard (or better soapbox) for presenting my views on the SapirWhorl hypothesis (that is, the various detenninisfic positions on perception, cognition, and language structure). It is hoped that this such expression will be preaching to the choir, though it is possible that it will not be. Upon the expression of those views, however, I am more at liberty to show how, on the one hand, cultural knowledge helps solve lexical problems, and on the other, how useful lexical organizations are as expressions of world knowledge because they can be exploited efficiently

