16430 search results - page 400 / 3286 » On Computable Tree Functions |
181
click to vote
ACL
2010
15 years 5 months ago
2010
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
198
click to vote
RECOMB
2010
Springer
15 years 5 months ago
2010
Springer
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...
220
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
190
click to vote
COLING
2010
15 years 2 months ago
2010
We employ Maximum Entropy model to conduct sub-tree alignment between bilingual phrasal structure trees. Various lexical and structural knowledge is explored to measure the syntac...
183
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...