2713 search results - page 96 / 543 » Parameterized Tree Systems |
146
click to vote
MST
2006
15 years 23 days ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
110
click to vote
ACL
2009
14 years 10 months ago
2009
This paper proposes a forest-based tree sequence to string translation model for syntaxbased statistical machine translation, which automatically learns tree sequence to string tr...
RTA
1998
Springer
15 years 5 months ago
1998
Springer
The system FT
130
Voted
EMNLP
2007
15 years 2 months ago
2007
Reordering model is important for the statistical machine translation (SMT). Current phrase-based SMT technologies are good at capturing local reordering but not global reordering...
108
Voted
OPODIS
2004
15 years 2 months ago
2004
Abstract. Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable sys...