Sciweavers

2713 search results - page 367 / 543
» Parameterized Tree Systems
Sort
View
ACL
2009
15 years 4 months ago
Quadratic-Time Dependency Parsing for Machine Translation
Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
Michel Galley, Christopher D. Manning
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
15 years 3 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
ATAL
2011
Springer
14 years 6 months ago
Multi-criteria argument selection in persuasion dialogues
The main goal of a persuasion dialogue is to persuade, but agents may have a number of additional goals concerning the dialogue duration, how much and what information is shared o...
Thomas L. van der Weide, Frank Dignum, John-Jules ...
ACL
2012
13 years 8 months ago
A Ranking-based Approach to Word Reordering for Statistical Machine Translation
Long distance word reordering is a major challenge in statistical machine translation research. Previous work has shown using source syntactic trees is an effective way to tackle ...
Nan Yang, Mu Li, Dongdong Zhang, Nenghai Yu
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
16 years 6 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner