Results 1  10
of
204
Smoothing and Word Sense Disambiguation
 IN PROCEEDINGS OF ESTAL  ESPAÑA FOR NATURAL LANGUAGE PROCESSING
, 2004
"... This paper presents an algorithm to apply the smoothing techniques described in [1] to three different Machine Learning (ML) methods for Word Sense Disambiguation (WSD). The method to obtain better estimations for the features is explained step by step, and applied to nway ambiguities. The results ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper presents an algorithm to apply the smoothing techniques described in [1] to three different Machine Learning (ML) methods for Word Sense Disambiguation (WSD). The method to obtain better estimations for the features is explained step by step, and applied to nway ambiguities. The results
Estimating lexical priors for lowfrequency syncretic forms
 Computational Linguistics
, 1996
"... Given a previously unseen form that is morphologically nways ambiguous, what is the best estimator for the lexical prior probabilities for the various functions of the form? We argue that the best estimator is provided by computing the relative frequencies of the various functions among the hapax l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Given a previously unseen form that is morphologically nways ambiguous, what is the best estimator for the lexical prior probabilities for the various functions of the form? We argue that the best estimator is provided by computing the relative frequencies of the various functions among the hapax
Categorical Ambiguity of Possessives and Adjectives
"... When two adjectives modify a noun, the second adjective can be categorically ambiguous between an adjective and a noun. In (1), when expensive modifies a noun phrase purple shirt, purple is an adjective as in (1b) and the price of the shirt is expensive. On the other hand, purple is a noun modified ..."
Abstract
 Add to MetaCart
ring]]] In Japanese, prenominal genitives are categorically ambiguous between an adjective and a possessive phrase, when a genitive phrase follows another genitive phrase or an adjective. (3a) and (4a) are ambiguous in two ways: (3) a. aoi meno ningyono onnano ko blue eyegen dollgen female
Categorical Ambiguity of Possessives and Adjectives
"... When two adjectives modify a noun, the second adjective can be categorically ambiguous between an adjective and a noun. In (1), when expensive modifies a noun phrase purple shirt, purple is an adjective as in (1b) and the price of the shirt is expensive. On the other hand, purple is a noun modified ..."
Abstract
 Add to MetaCart
ring]]] In Japanese, prenominal genitives are categorically ambiguous between an adjective and a possessive phrase, when a genitive phrase follows another genitive phrase or an adjective. (3a) and (4a) are ambiguous in two ways: (3) a. aoi meno ningyono onnano ko blue eyegen dollgen female
Disk instantons, mirror symmetry and the duality web
, 2001
"... We apply the methods recently developed for computation of type IIA disk instantons using mirror symmetry to a large class of Dbranes wrapped over Lagrangian cycles of noncompact CalabiYau 3folds. Along the way we clarify the notion of “flat coordinates” for the boundary theory. We also discover ..."
Abstract

Cited by 136 (26 self)
 Add to MetaCart
discover an integer IR ambiguity needed to define the quantum theory of Dbranes wrapped over noncompact Lagrangian submanifolds. In the large N dual ChernSimons theory, this ambiguity is mapped to the UV choice of the framing of the knot. In a type IIB dual description involving (p, q) 5branes, disk
Ambiguity in Reconstruction From Images of Six Points
 In ICCV
, 1988
"... Let S be a set of six points in space, let / be any hyperboloid of one sheet containing S, and let I be a sequence of images of S taken by an uncalibrated camera moving over /. Then reconstruction from I is subject to a three way ambiguity which is unbroken as long as the optical centre of the camer ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
Let S be a set of six points in space, let / be any hyperboloid of one sheet containing S, and let I be a sequence of images of S taken by an uncalibrated camera moving over /. Then reconstruction from I is subject to a three way ambiguity which is unbroken as long as the optical centre
A Note on the Hardness of the kAmbiguity Problem
, 2002
"... We address the problem of minimal information loss in order to kambiguate data, a problem related to disclosure control in disseminated data. We show that this problem is NPhard by considering cell suppression as the ambiguation mechanism. On the way we prove that the minimum kunion problem (aka. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We address the problem of minimal information loss in order to kambiguate data, a problem related to disclosure control in disseminated data. We show that this problem is NPhard by considering cell suppression as the ambiguation mechanism. On the way we prove that the minimum kunion problem (aka
Low ambiguity in strong, total, associative, oneway functions
, 2000
"... Rabi and Sherman [RS97] present a cryptographic paradigm based on associative, oneway functions that are strong (i.e., hard to invert even if one of their arguments is given) and total. Hemaspaandra and Rothe [HR99] proved that such powerful oneway functions exist exactly if (standard) oneway fun ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
be unambiguous (i.e., onetoone). Nonetheless, we prove that if standard, unambiguous, oneway functions exist, then there exist strong, total, associative, oneway functions that are O(n)toone. This puts a reasonable upper bound on the ambiguity. Our other main results are: 1. P = FewP if and only
Tight lower bounds on the ambiguity in strong, total, associative, oneway functions
 Journal of Computer and System Sciences
, 2000
"... We study the ambiguity, or "manytoone"ness, of twoargument, oneway functions that are strong (that is, hard to invert even if one of their arguments is given), total, and associative. Such powerful oneway functions are the basis of a cryptographic paradigm described by Rabi and Sherm ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study the ambiguity, or "manytoone"ness, of twoargument, oneway functions that are strong (that is, hard to invert even if one of their arguments is given), total, and associative. Such powerful oneway functions are the basis of a cryptographic paradigm described by Rabi
Longterm priming of the meanings of ambiguous words
"... a b s t r a c t Comprehension of semantically ambiguous words (e.g., ''bark'') is strongly influenced by the relative frequencies of their meanings, such that listeners are biased towards retrieving the most frequent meaning. These biases are often assumed to reflect a highly st ..."
Abstract
 Add to MetaCart
. (iii) Word association task. Main analyses All responses were coded in the same way as Experiment 1. Errors and ambiguous responses (1.4% of the data) were removed as in Experiment 1. One ambiguous word (''hay'') was removed from the analysis because its mean consistency score
Results 1  10
of
204