2475 search results - page 195 / 495 » On the accuracy of language trees |
198
click to vote
NLPRS
2001
Springer
15 years 11 months ago
2001
Springer
We describe a new tagging model where the states of a hidden Markov model (HMM) estimated by unsupervised learning are incorporated as the features in a maximum entropy model. Our...
206
click to vote
AIIA
1995
Springer
15 years 10 months ago
1995
Springer
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
152
click to vote
ECML
2003
Springer
15 years 11 months ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
194
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
In this paper, we use a level set based segmentation algorithm to extract the vascular tree from Magnetic Resonance Angiography, "MRA". Classification model finds an opt...
157
click to vote
ICPR
2008
IEEE
16 years 29 days ago
2008
IEEE
In online handwritten math expression recognition, one-pass dynamic programming can produce highquality symbol graphs in addition to best symbol sequence hypotheses [3], especiall...