373 search results - page 20 / 75 » Counting in Trees for Free |
ACL
1993
13 years 10 months ago
1993
In this paper we describe a new technique for parsing free text: a transformational grammar I is automatically learned that is capable of accurately parsing text into binary-branc...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
ASPLOS
2011
ACM
13 years 6 days ago
2011
ACM
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...
CATA
2004
13 years 10 months ago
2004
1 Decision Tree Induction is a powerful classification tool that is much used in practice and works well for static data with dozens of attributes. We adapt the decision tree conce...
LATA
2010
Springer
14 years 3 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...