9504 search results - page 10 / 1901 » Dynamic Substitution Model |
EMNLP
2010
13 years 5 months ago
2010
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency gram...
ACL
2010
13 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...
WABI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Traditional sequence comparison by alignment applies a mutation model comprising two events, substitutions and indels (insertions or deletions) of single positions (SI). ...
BMCBI
2006
13 years 7 months ago
2006
Background: Detecting remote homologies by direct comparison of protein sequences remains a challenging task. We had previously developed a similarity score between sequences, cal...
BMCBI
2005
13 years 7 months ago
2005
Background: Codon substitution probabilities are used in many types of molecular evolution studies such as determining Ka/Ks ratios, creating ancestral DNA sequences or aligning c...