Sciweavers

1826 search results - page 13 / 366
» Using Random Forests in the Structured Language Model
Sort
View
EMNLP
2010
13 years 6 months ago
Word Sense Induction Disambiguation Using Hierarchical Random Graphs
Graph-based methods have gained attention in many areas of Natural Language Processing (NLP) including Word Sense Disambiguation (WSD), text summarization, keyword extraction and ...
Ioannis P. Klapaftis, Suresh Manandhar
ICML
2005
IEEE
14 years 9 months ago
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
Shaojun Wang, Shaomin Wang, Russell Greiner, Dale ...
IJBRA
2007
80views more  IJBRA 2007»
13 years 8 months ago
On predicting secondary structure transition
A function of a protein is dependent on its structure; therefore, predicting a protein structure from an amino acid sequence is an active area of research. Optimally predicting a ...
Raja Loganantharaj, Vivek Philip
CORR
2000
Springer
67views Education» more  CORR 2000»
13 years 8 months ago
Recognition Performance of a Structured Language Model
A new language model for speech recognition inspired by linguistic analysis is presented. The model develops hidden hierarchical structure incrementally and uses it to extract mea...
Ciprian Chelba, Frederick Jelinek
ACL
1994
13 years 10 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick