Sciweavers

179 search results - page 31 / 36
» Lambek Grammars Are Context Free
Sort
View
VL
2002
IEEE
111views Visual Languages» more  VL 2002»
14 years 13 days ago
An Interrogative Approach to Novice Programming
Domain specific programming languages tend to be rigid in capability and dependent on either a graphical interface or a scripting language. We present a question-oriented approach...
Alexander Quinn
ACL
2001
13 years 9 months ago
Improvement of a Whole Sentence Maximum Entropy Language Model Using Grammatical Features
In this paper, we propose adding long-term grammatical information in a Whole Sentence Maximun Entropy Language Model (WSME) in order to improve the performance of the model. The ...
Fredy A. Amaya, José-Miguel Benedí
KBSE
2007
IEEE
14 years 1 months ago
Directed test generation using symbolic grammars
We present CESE, a tool that combines exhaustive enumeration of test inputs from a structured domain with symbolic execution driven test generation. We target programs whose valid...
Rupak Majumdar, Ru-Gang Xu
NAACL
2010
13 years 5 months ago
Appropriately Handled Prosodic Breaks Help PCFG Parsing
This paper investigates using prosodic information in the form of ToBI break indexes for parsing spontaneous speech. We revisit two previously studied approaches, one that hurt pa...
Zhongqiang Huang, Mary P. Harper
ACL
2009
13 years 5 months ago
Efficient Minimum Error Rate Training and Minimum Bayes-Risk Decoding for Translation Hypergraphs and Lattices
Minimum Error Rate Training (MERT) and Minimum Bayes-Risk (MBR) decoding are used in most current state-of-theart Statistical Machine Translation (SMT) systems. The algorithms wer...
Shankar Kumar, Wolfgang Macherey, Chris Dyer, Fran...