2916 search results - page 97 / 584 » Generating Rule Sets from Model Trees |
127
Voted
ACL
2009
15 years 1 months ago
2009
We investigate the task of unsupervised constituency parsing from bilingual parallel corpora. Our goal is to use bilingual cues to learn improved parsing models for each language ...
142
click to vote
LACL
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
117
click to vote
ACL
2007
15 years 5 months ago
2007
Surface realisers divide into those used in generation (NLG geared realisers) and those mirroring the parsing process (Reversible realisers). While the first rely on grammars not...
145
click to vote
NETWORKS
2010
15 years 2 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
176
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, we proposed a new approach, called FiVaTech for the problem of Web data extraction. FiVaTech is a page-level data extraction system which deduces the data schema an...