Sciweavers

1187 search results - page 30 / 238
» Unsupervised Natural Language Processing Using Graph Models
Sort
View
IJWGS
2006
125views more  IJWGS 2006»
13 years 7 months ago
Compiling business processes: untangling unstructured loops in irreducible flow graphs
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
Wei Zhao, Rainer Hauser, Kamal Bhattacharya, Barre...
ICML
2007
IEEE
14 years 8 months ago
Unsupervised estimation for noisy-channel models
Shannon's Noisy-Channel model, which describes how a corrupted message might be reconstructed, has been the corner stone for much work in statistical language and speech proc...
Markos Mylonakis, Khalil Sima'an, Rebecca Hwa
NIPS
2008
13 years 9 months ago
Logistic Normal Priors for Unsupervised Probabilistic Grammar Induction
We explore a new Bayesian model for probabilistic grammars, a family of distributions over discrete structures that includes hidden Markov models and probabilistic context-free gr...
Shay B. Cohen, Kevin Gimpel, Noah A. Smith
TKDE
2008
125views more  TKDE 2008»
13 years 7 months ago
Discovering and Explaining Abnormal Nodes in Semantic Graphs
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...
Shou-de Lin, Hans Chalupsky
CICLING
2008
Springer
13 years 9 months ago
Unsupervised and Knowledge-Free Learning of Compound Splits and Periphrases
Abstract. We present an approach for knowledge-free and unsupervised recognition of compound nouns for languages that use one-wordcompounds such as Germanic and Scandinavian langua...
Florian Holz, Chris Biemann