Sciweavers

14 search results - page 2 / 3
» Mildly Context-Sensitive Dependency Languages
Sort
View
FOSSACS
2004
Springer
13 years 10 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
13 years 11 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
PLDI
2010
ACM
14 years 2 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer
EACL
2009
ACL Anthology
14 years 5 months ago
Parsing Mildly Non-Projective Dependency Structures
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
Carlos Gómez-Rodríguez, David J. Wei...
IJCAI
2007
13 years 6 months ago
On Natural Language Processing and Plan Recognition
The research areas of plan recognition and natural language parsing share many common features and even algorithms. However, the dialog between these two disciplines has not been ...
Christopher W. Geib, Mark Steedman