Sciweavers

438 search results - page 47 / 88
» Shallow Dependency Labeling
Sort
View
RTA
2004
Springer
14 years 2 months ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema
DAC
1993
ACM
14 years 29 days ago
Rotation Scheduling: A Loop Pipelining Algorithm
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...
Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Me...
COLING
2008
13 years 10 months ago
Word Sense Disambiguation for All Words using Tree-Structured Conditional Random Fields
We propose a supervised word sense disambiguation (WSD) method using tree-structured conditional random fields (TCRFs). By applying TCRFs to a sentence described as a dependency t...
Jun Hatori, Yusuke Miyao, Jun-ichi Tsujii
EMNLP
2007
13 years 10 months ago
Single Malt or Blended? A Study in Multilingual Parser Optimization
We describe a two-stage optimization of the MaltParser system for the ten languages in the multilingual track of the CoNLL 2007 shared task on dependency parsing. The first stage...
Johan Hall, Jens Nilsson, Joakim Nivre, Gülse...
NIPS
2007
13 years 10 months ago
Colored Maximum Variance Unfolding
Maximum variance unfolding (MVU) is an effective heuristic for dimensionality reduction. It produces a low-dimensional representation of the data by maximizing the variance of the...
Le Song, Alex J. Smola, Karsten M. Borgwardt, Arth...