Sciweavers

66 search results - page 6 / 14
» Evolving natural language grammars without supervision
Sort
View
EMNLP
2009
14 years 7 months ago
Semi-Supervised Learning for Semantic Relation Classification using Stratified Sampling Strategy
This paper presents a new approach to selecting the initial seed set using stratified sampling strategy in bootstrapping-based semi-supervised learning for semantic relation class...
Longhua Qian, Guodong Zhou, Fang Kong, Qiaoming Zh...
EMNLP
2011
13 years 9 months ago
Semi-Supervised Recursive Autoencoders for Predicting Sentiment Distributions
We introduce a novel machine learning framework based on recursive autoencoders for sentence-level prediction of sentiment label distributions. Our method learns vector space repr...
Richard Socher, Jeffrey Pennington, Eric H. Huang,...
EMNLP
2009
14 years 7 months ago
Synchronous Tree Adjoining Machine Translation
Tree Adjoining Grammars have well-known advantages, but are typically considered too difficult for practical systems. We demonstrate that, when done right, adjoining improves tran...
Steve DeNeefe, Kevin Knight
LATA
2010
Springer
15 years 4 months ago
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
Frank Weinberg, Markus E. Nebel
CICLING
2003
Springer
15 years 2 months ago
Positive Grammar Checking: A Finite State Approach
Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
Sylvana Sofkova Hashemi, Robin Cooper, Robert Ande...