Sciweavers

656 search results - page 37 / 132
» Marrying Words and Trees
Sort
View
ACL
2001
15 years 1 months ago
A Syntax-based Statistical Translation Model
We present a syntax-based statistical translation model. Our model transforms a source-language parse tree into a target-language string by applying stochastic operations at each ...
Kenji Yamada, Kevin Knight
CSL
2007
Springer
15 years 6 months ago
Forest Expressions
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
Mikolaj Bojanczyk
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 3 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
ICALP
2000
Springer
15 years 3 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
AAAI
2007
15 years 2 months ago
Recognizing Textual Entailment Using a Subsequence Kernel Method
We present a novel approach to recognizing Textual nt. Structural features are constructed from abstract tree descriptions, which are automatically extracted from syntactic depend...
Rui Wang 0005, Günter Neumann