2475 search results - page 184 / 495 » On the accuracy of language trees |
165
click to vote
ACL
1998
15 years 7 months ago
1998
In this paper we sketch an approach for Natural Language parsing. Our approach is an example-based approach, which relies mainly on examples that already parsed to their represent...
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We propose some slight additions to O-O languages to implement the necessary features for using Deductive Object Programming (DOP). This way of programming based upon the manipula...
177
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
174
click to vote
ICALP
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
184
click to vote
LPAR
2001
Springer
15 years 11 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...