Sciweavers

1368 search results - page 115 / 274
» Logical Hidden Markov Models
Sort
View
118
Voted
ACL
1998
15 years 5 months ago
Improving Data Driven Wordclass Tagging by System Combination
In this paper we examine how the differences in modelling between different data driven systems performing the same NLP task can be exploited to yield a higher accuracy than the b...
Hans van Halteren, Jakub Zavrel, Walter Daelemans
129
Voted
JCSS
2007
116views more  JCSS 2007»
15 years 3 months ago
The most probable annotation problem in HMMs and its application to bioinformatics
Hidden Markov models (HMMs) are often used for biological sequence annotation. Each sequence feature is represented by a collection of states with the same label. In annotating a ...
Brona Brejová, Daniel G. Brown 0001, Tom&aa...
148
Voted
ICASSP
2010
IEEE
15 years 2 months ago
Multiple sequence alignment based bootstrapping for improved incremental word learning
We investigate incremental word learning with few training examples in a Hidden Markov Model (HMM) framework suitable for an interactive learning scenario with little prior knowle...
Irene Ayllól Clemente, Martin Heckmann, Ger...
144
Voted
ICDAR
2009
IEEE
15 years 1 months ago
HMM-Based Online Recognition of Handwritten Chemical Symbols
In this paper, we present an online handwritten recognition method for Chemical Symbols, a widely used symbol in education and academic interactions. This method is based on Hidde...
Yang Zhang, Guangshun Shi, Jufeng Yang
133
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 1 months ago
The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
Abstract. Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations ...
Michal Nánási, Tomás Vinar, B...