Sciweavers

118 search results - page 15 / 24
» Japanese Dependency Parsing Using a Tournament Model
Sort
View
IPM
2008
159views more  IPM 2008»
13 years 7 months ago
Exploring syntactic structured features over parse trees for relation extraction using kernel methods
Extracting semantic relationships between entities from text documents is challenging in information extraction and important for deep information processing and management. This ...
Min Zhang, Guodong Zhou, AiTi Aw
COLING
2002
13 years 7 months ago
Extracting Word Sequence Correspondences with Support Vector Machines
This paper proposes a learning and extracting method of word sequence correspondences from non-aligned parallel corpora with Support Vector Machines, which have high ability of th...
Kengo Sato, Hiroaki Saito
ISCA
2011
IEEE
229views Hardware» more  ISCA 2011»
12 years 11 months ago
TLSync: support for multiple fast barriers using on-chip transmission lines
As the number of cores on a single-chip grows, scalable barrier synchronization becomes increasingly difficult to implement. In software implementations, such as the tournament ba...
Jungju Oh, Milos Prvulovic, Alenka G. Zajic
ACL
1990
13 years 9 months ago
Licensing and Tree Adjoining Grammar in Government Binding Parsing
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
Robert Frank
ACL
2011
12 years 11 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez