Sciweavers

656 search results - page 8 / 132
» Marrying Words and Trees
Sort
View
ICALP
2004
Springer
15 years 2 months ago
Property Testing of Regular Tree Languages
We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and gen...
Frédéric Magniez, Michel de Rougemon...
70
Voted
ACL
2012
12 years 12 months ago
Extracting Narrative Timelines as Temporal Dependency Structures
We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations l...
Oleksandr Kolomiyets, Steven Bethard, Marie-Franci...
ACL
2007
14 years 11 months ago
Tailoring Word Alignments to Syntactic Machine Translation
Extracting tree transducer rules for syntactic MT systems can be hindered by word alignment errors that violate syntactic correspondences. We propose a novel model for unsupervise...
John DeNero, Dan Klein
MST
2010
111views more  MST 2010»
14 years 7 months ago
Sturmian Trees
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
Jean Berstel, Luc Boasson, Olivier Carton, Isabell...
82
Voted
ICDT
2012
ACM
226views Database» more  ICDT 2012»
12 years 12 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko