555 search results - page 20 / 111 » Decompositions of Grammar Constraints |
ACL
2010
13 years 5 months ago
2010
For languages with (semi-) free word order (such as German), labelling grammatical functions on top of phrase-structural constituent analyses is crucial for making them interpreta...
SAS
1999
Springer
13 years 11 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
COLOGNETWENTE
2008
13 years 8 months ago
2008
We consider combinatorial optimization problems arising in radiation therapy. Given a matrix I with non-negative integer entries, we seek for a decomposition of I as a weighted su...
MOZ
2004
Springer
14 years 23 days ago
2004
Springer
Abstract. Extensible Dependency Grammar (XDG) is a graph description language whose formulas can be solved by constraint programming. XDG is designed so as to yield a declarative a...
WOLLIC
2010
Springer
14 years 13 days ago
2010
Springer
In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent ...