Sciweavers

3207 search results - page 284 / 642
» A Semantics for HTN Methods
Sort
View
139
Voted
ACL
2007
15 years 6 months ago
Computing Lexical Chains with Graph Clustering
This paper describes a new method for computing lexical chains. These are sequences of semantically related words that reflect a text’s cohesive structure. In contrast to previo...
Olena Medelyan
NLPRS
2001
Springer
15 years 9 months ago
Ensembling based on Feature Space Restructuring with Application to WSD
We propose a new ensembling method of Support Vector Machines (SVMs) based on Feature Space Restructuring. In the proposed method, the weighted majority voting method is applied f...
Hiroya Takamura, Hiroyasu Yamada, Taku Kudo, Kaoru...
172
Voted
UAI
2008
15 years 6 months ago
Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...
Sebastian Riedel
ANLP
1994
94views more  ANLP 1994»
15 years 6 months ago
Handling Japanese Homophone Errors in Revision Support System for Japanese Texts; REVISE
Japanese texts frequently suffer from the homophone errors caused by the KANA-KANJI conversion needed to input the text. It is critical, therefore, for Japanese revision support s...
Masahiro Oku
CICLING
2010
Springer
15 years 11 months ago
An Experimental Study on Unsupervised Graph-based Word Sense Disambiguation
Recent research works on unsupervised word sense disambiguation report an increase in performance, which reduces their handicap from the respective supervised approaches for the sa...
George Tsatsaronis, Iraklis Varlamis, Kjetil N&osl...