Sciweavers

Share
CAV
2012
Springer
231views Hardware» more  CAV 2012»
8 years 23 days ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
EMNLP
2011
8 years 10 months ago
Syntax-Based Grammaticality Improvement using CCG and Guided Search
Machine-produced text often lacks grammaticality and fluency. This paper studies grammaticality improvement using a syntax-based algorithm based on CCG. The goal of the search pr...
Yue Zhang 0004, Stephen Clark
CPP
2011
107views more  CPP 2011»
8 years 10 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
ACL
2011
9 years 1 months ago
Temporal Restricted Boltzmann Machines for Dependency Parsing
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...
Nikhil Garg, James Henderson
COLING
2010
9 years 5 months ago
Joint Parsing and Translation
Tree-based translation models, which exploit the linguistic syntax of source language, usually separate decoding into two steps: parsing and translation. Although this separation ...
Yang Liu, Qun Liu
JMLR
2010
155views more  JMLR 2010»
9 years 8 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
INFOCOM
2010
IEEE
9 years 8 months ago
Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
Christos Kozanitis, John Huber, Sushil Singh, Geor...
ACTA
2000
302views more  ACTA 2000»
9 years 10 months ago
Efficiently building a parse tree from a regular expression
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
Danny Dubé, Marc Feeley
IPM
2008
159views more  IPM 2008»
9 years 10 months ago
Exploring syntactic structured features over parse trees for relation extraction using kernel methods
Extracting semantic relationships between entities from text documents is challenging in information extraction and important for deep information processing and management. This ...
Min Zhang, Guodong Zhou, AiTi Aw
ISMB
1993
9 years 11 months ago
Knowledge Discovery in GENBANK
Wedescribe various methods designed to discover knowledge in the GenBanknucleic acid sequence database. Using a grammatical model of gene structure, we create a parse tree of a ge...
Jeffery S. Aaronson, Juergen Haas, G. Christian Ov...
books