Sciweavers

1000 search results - page 36 / 200
» Dependency Tree Automata
Sort
View
COLING
2008
15 years 1 months ago
Shift-Reduce Dependency DAG Parsing
Most data-driven dependency parsing approaches assume that sentence structure is represented as trees. Although trees have several desirable properties from both computational and...
Kenji Sagae, Jun-ichi Tsujii
LREC
2010
154views Education» more  LREC 2010»
15 years 1 months ago
Statistical French Dependency Parsing: Treebank Conversion and First Results
We first describe the automatic conversion of the French Treebank (Abeill
Marie Candito, Benoît Crabbé, Pascal ...
TSD
1999
Springer
15 years 4 months ago
Prague Dependency Treebank: Restoration of Deletions
The use of the treebank as a resource for linguistic research has led us to look for an annotation scheme representing not only surface syntactic information (in ‘analytic trees...
Eva Hajicová, Ivana Kruijff-Korbayová...
EMNLP
2009
14 years 9 months ago
Convolution Kernels on Constituent, Dependency and Sequential Structures for Relation Extraction
This paper explores the use of innovative kernels based on syntactic and semantic structures for a target relation extraction task. Syntax is derived from constituent and dependen...
Truc-Vien T. Nguyen, Alessandro Moschitti, Giusepp...
CPM
2005
Springer
105views Combinatorics» more  CPM 2005»
15 years 5 months ago
Reducing the Size of NFAs by Using Equivalences and Preorders
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
Lucian Ilie, Roberto Solis-Oba, Sheng Yu