555 search results - page 31 / 111 » Complexity of Operations on Cofinite Languages |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Interacting with a web service enabled marketplace in order to achieve a complex task involves sequencing a set of individual service operations, gathering information from the ser...
ACL
2009
13 years 5 months ago
2009
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
ACTA
2007
13 years 7 months ago
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
Existing array region representation techniques are sensitive to the complexity of array subscripts. In general, these techniques are very accurate and efficient for simple subscr...
JOLLI
2008
13 years 7 months ago
2008
Abstract. This paper uses a partially ordered set of syntactic categories to accommodate optionality and licensing in natural language syntax. A complex but well-studied data set p...