Sciweavers

268 search results - page 40 / 54
» Linear Context Free Languages
Sort
View
ACL
1998
15 years 1 months ago
Conditions on Consistency of Probabilistic Tree Adjoining Grammars
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
Anoop Sarkar
CADE
2005
Springer
16 years 2 days ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
79
Voted
CORR
2006
Springer
119views Education» more  CORR 2006»
14 years 11 months ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper
105
Voted
ACL
2011
14 years 3 months ago
Automated Whole Sentence Grammar Correction Using a Noisy Channel Model
Automated grammar correction techniques have seen improvement over the years, but there is still much room for increased performance. Current correction techniques mainly focus on...
Y. Albert Park, Roger Levy
POPL
2008
ACM
16 years 2 days ago
Generating precise and concise procedure summaries
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
Greta Yorsh, Eran Yahav, Satish Chandra