Sciweavers

10 search results - page 2 / 2
» Training Parse Trees for Efficient VF Coding
Sort
View
ACL
2010
13 years 3 months ago
Simple, Accurate Parsing with an All-Fragments Grammar
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
Mohit Bansal, Dan Klein
SIGSOFT
2007
ACM
14 years 6 months ago
Efficient token based clone detection with flexible tokenization
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
Hamid Abdul Basit, Stan Jarzabek
ISMB
1994
13 years 6 months ago
Predicting Location and Structure Of beta-Sheet Regions Using Stochastic Tree Grammars
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
Hiroshi Mamitsuka, Naoki Abe
COMPSAC
2008
IEEE
13 years 11 months ago
Ontology Model-Based Static Analysis on Java Programs
1 Typical enterprise and military software systems consist of millions of lines of code with complicated dependence on library abstractions. Manually debugging these codes imposes ...
Lian Yu, Jun Zhou, Yue Yi, Ping Li, Qianxiang Wang
SPEECH
2010
94views more  SPEECH 2010»
13 years 1 days ago
Predicting the phonetic realizations of word-final consonants in context - A challenge for French grapheme-to-phoneme converters
One of the main problems in developing a text-to-speech (TTS) synthesizer for French lies in grapheme-to-phoneme conversion. Automatic converters produce still too many errors in ...
Josafá de Jesus Aguiar Pontes, Sadaoki Furu...