Sciweavers

17 search results - page 2 / 4
» Anytime Algorithms for Speech Parsing
Sort
View
IJCSA
2008
137views more  IJCSA 2008»
13 years 5 months ago
Algorithms to Improve Performance of Natural Language Interface
: Performance of Natural Language Interface often deteriorates due to linguistic phenomena of Semantic Symmetry and Ambiguous Modification (Katz and Lin, 2003). In this paper we pr...
M. R. Joshi, R. A. Akerkar
COLING
2008
13 years 6 months ago
Almost Flat Functional Semantics for Speech Translation
We introduce a novel semantic representation formalism, Almost Flat Functional semantics (AFF), which is designed as an intelligent compromise between linguistically motivated pre...
Manny Rayner, Pierrette Bouillon, Beth Ann Hockey,...
NLP
2000
13 years 8 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
ICDT
2010
ACM
147views Database» more  ICDT 2010»
13 years 8 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
ACL
2003
13 years 6 months ago
Accurate Unlexicalized Parsing
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
Dan Klein, Christopher D. Manning