Sciweavers

2905 search results - page 193 / 581
» Formal Memetic Algorithms
Sort
View
EMNLP
2009
13 years 8 months ago
A Compact Forest for Scalable Inference over Entailment and Paraphrase Rules
A large body of recent research has been investigating the acquisition and application of applied inference knowledge. Such knowledge may be typically captured as entailment rules...
Roy Bar-Haim, Jonathan Berant, Ido Dagan
ACL
2010
13 years 8 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
ICSE
2008
IEEE-ACM
14 years 11 months ago
Calysto: scalable and precise extended static checking
Automatically detecting bugs in programs has been a long-held goal in software engineering. Many techniques exist, trading-off varying levels of automation, thoroughness of covera...
Domagoj Babic, Alan J. Hu
WWW
2005
ACM
14 years 11 months ago
An enhanced model for searching in semantic portals
Semantic Portal is the next generation of web portals that are powered by Semantic Web technologies for improved information sharing and exchange for a community of users. Current...
Lei Zhang, Yong Yu, Jian Zhou, Chenxi Lin, Yin Yan...
IUI
2010
ACM
14 years 7 months ago
A natural language interface of thorough coverage by concordance with knowledge bases
One of the critical problems in natural language interfaces is the discordance between the expressions covered by the interface and those by the knowledge base. In the graph-based...
Yong-Jin Han, Tae-Gil Noh, Seong-Bae Park, Se-Youn...