Search Results for author:
Found 8 papers, 0 papers with code
On the Theory of Stochastic Automata
The theory of discrete stochastic systems has been initiated by the work of Shannon and von Neumann.
On the decomposition of generalized semiautomata
Semi-automata are abstractions of electronic devices that are deterministic finite-state machines having inputs but no outputs.
Formal Languages and Automata Theory Discrete Mathematics 68Q70, 20M35, 15A04
Inference in Graded Bayesian Networks
By restricting the topological structure to graded networks, an inference algorithm for graded Bayesian networks will be established that evaluates the hidden random variables rank by rank and in this way yields the most probable states of the hidden variables.
Computations in Stochastic Acceptors
Machine learning provides algorithms that can learn from data and make inferences or predictions on data.
Parameter Transfer across Domains for Word Sense Disambiguation
Word sense disambiguation is defined as finding the corresponding sense for a target word in a given context, which comprises a major step in text applications.
Metaheuristic Approaches to Lexical Substitution and Simplification
In this paper, we propose using metaheuristics{---}in particular, simulated annealing and the new D-Bees algorithm{---}to solve word sense disambiguation as an optimization problem within a knowledge-based lexical substitution system.
D-Bees: A Novel Method Inspired by Bee Colony Optimization for Solving Word Sense Disambiguation
Word sense disambiguation (WSD) is a problem in the field of computational linguistics given as finding the intended sense of a word (or a set of words) when it is activated within a certain context.
