Sciweavers

54 search results - page 10 / 11
» Efficient Context-Free Grammar Constraints
Sort
View
ACL
2004
13 years 7 months ago
Balancing Clarity and Efficiency in Typed Feature Logic Through Delaying
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
Gerald Penn
SIGMOD
2003
ACM
150views Database» more  SIGMOD 2003»
14 years 6 months ago
Capturing both Types and Constraints in Data Integration
We propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The f...
Michael Benedikt, Chee Yong Chan, Wenfei Fan, Juli...
ACL
2009
13 years 4 months ago
Better Word Alignments with Supervised ITG Models
This work investigates supervised word alignment methods that exploit inversion transduction grammar (ITG) constraints. We consider maximum margin and conditional likelihood objec...
Aria Haghighi, John Blitzer, John DeNero, Dan Klei...
ESOP
2009
Springer
13 years 10 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
JUCS
2006
141views more  JUCS 2006»
13 years 6 months ago
Constraint Based Methods for Biological Sequence Analysis
: The need for processing biological information is rapidly growing, owing to the masses of new information in digital form being produced at this time. Old methodologies for proce...
Maryam Bavarian, Verónica Dahl