Sciweavers

1243 search results - page 25 / 249
» Generating Trees on Multisets
Sort
View
ACL
2012
12 years 8 days ago
Strong Lexicalization of Tree Adjoining Grammars
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
Andreas Maletti, Joost Engelfriet
FSTTCS
1998
Springer
14 years 1 months ago
Optimal Regular Tree Pattern Matching Using Pushdown Automata
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
Maya Madhavan, Priti Shankar
RSA
2010
118views more  RSA 2010»
13 years 8 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 10 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
IJAC
2007
89views more  IJAC 2007»
13 years 9 months ago
Bounding Right-Arm Rotation Distances
Abstract. Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to tra...
Sean Cleary, Jennifer Taback