240 search results - page 10 / 48 » Forest for the trees |
CSL
2007
Springer
14 years 1 months ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
NIPS
2004
13 years 8 months ago
2004
In this paper, we explore the use of Random Forests (RFs) in the structured language model (SLM), which uses rich syntactic information in predicting the next word based on words ...
ARSCOM
2002
13 years 7 months ago
2002
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
DAM
2008
13 years 7 months ago
2008
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
EACL
1993
ACL Anthology
13 years 8 months ago
1993
ACL Anthology
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...