Sciweavers

522 search results - page 16 / 105
» Automating grammar comparison
Sort
View
BMCBI
2005
99views more  BMCBI 2005»
14 years 10 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
EDBT
2010
ACM
136views Database» more  EDBT 2010»
15 years 3 months ago
Minimizing database repros using language grammars
Database engines and database-centric applications have become complex software systems. Ensuring bug-free database services is therefore a very difficult task. Whenever possible...
Nicolas Bruno
IAAI
2003
15 years 2 days ago
CriterionSM Online Essay Evaluation: An Application for Automated Evaluation of Student Essays
This paper describes a deployed educational technology application: the CriterionSM Online Essay Evaluation Service, a web-based system that provides automated scoring and evaluat...
Jill Burstein, Martin Chodorow, Claudia Leacock
ICSE
2009
IEEE-ACM
15 years 11 months ago
FEATUREHOUSE: Language-independent, automated software composition
Superimposition is a composition technique that has been applied successfully in many areas of software development. Although superimposition is a general-purpose concept, it has ...
Christian Kästner, Christian Lengauer, Sven A...
ESSLLI
1999
Springer
15 years 3 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann