Sciweavers

270 search results - page 35 / 54
» Effective natural language parsing with probabilistic gramma...
Sort
View
NAACL
2007
14 years 11 months ago
Semi-Supervised Learning for Semantic Parsing using Support Vector Machines
We present a method for utilizing unannotated sentences to improve a semantic parser which maps natural language (NL) sentences into their formal meaning representations (MRs). Gi...
Rohit J. Kate, Raymond J. Mooney
NAACL
2003
14 years 11 months ago
Supervised and unsupervised PCFG adaptation to novel domains
This paper investigates adapting a lexicalized probabilistic context-free grammar (PCFG) to a novel domain, using maximum a posteriori (MAP) estimation. The MAP framework is gener...
Brian Roark, Michiel Bacchiani
COLING
1996
14 years 11 months ago
Towards a Syntactic Account of Punctuation
Little notice has been taken of punctuation in the field of natural language processing, chiefly due to the lack of any coherent theory on which to base implementations. Some work...
Bernard E. M. Jones
PLDI
1997
ACM
15 years 1 months ago
Incremental Analysis of real Programming Languages
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
Tim A. Wagner, Susan L. Graham
CIKM
2009
Springer
15 years 4 months ago
The effect of negation on sentiment analysis and retrieval effectiveness
We investigate the problem of determining the polarity of sentiments when one or more occurrences of a negation term such as “not” appear in a sentence. The concept of the sco...
Lifeng Jia, Clement T. Yu, Weiyi Meng