Sciweavers

4911 search results - page 90 / 983
» Tree dependence analysis
Sort
View
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
14 years 10 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
CCS
2008
ACM
14 years 12 months ago
Dependent link padding algorithms for low latency anonymity systems
Low latency anonymity systems are susceptive to traffic analysis attacks. In this paper, we propose a dependent link padding scheme to protect anonymity systems from traffic analy...
Wei Wang 0002, Mehul Motani, Vikram Srinivasan
AAAI
2007
15 years 6 days 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
EMNLP
2007
14 years 11 months ago
Frustratingly Hard Domain Adaptation for Dependency Parsing
We describe some challenges of adaptation in the 2007 CoNLL Shared Task on Domain Adaptation. Our error analysis for this task suggests that a primary source of error is differenc...
Mark Dredze, John Blitzer, Partha Pratim Talukdar,...
SEMWEB
2010
Springer
14 years 7 months ago
Towards Semantic Annotation Supported by Dependency Linguistics and ILP
In this paper we present a method for semantic annotation of texts, which is based on a deep linguistic analysis (DLA) and Inductive Logic Programming (ILP). The combination of DLA...
Jan Dedek