Sciweavers

10493 search results - page 85 / 2099
» Dynamic Word Problems
Sort
View
ACL
2006
13 years 9 months ago
Direct Word Sense Matching for Lexical Substitution
This paper investigates conceptually and empirically the novel sense matching task, which requires to recognize whether the senses of two synonymous words match in context. We sug...
Ido Dagan, Oren Glickman, Alfio Massimiliano Glioz...
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
14 years 21 days ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
AMTA
2004
Springer
14 years 1 months ago
Normalizing German and English Inflectional Morphology to Improve Statistical Word Alignment
German has a richer system of inflectional morphology than English, which causes problems for current approaches to statistical word alignment. Using Giza++ as a reference implemen...
Simon Corston-Oliver, Michael Gamon
ACL
2008
13 years 9 months ago
Evaluating Word Prediction: Framing Keystroke Savings
Researchers typically evaluate word prediction using keystroke savings, however, this measure is not straightforward. We present several complications in computing keystroke savin...
Keith Trnka, Kathleen F. McCoy
COLING
2008
13 years 9 months ago
Using Hidden Markov Random Fields to Combine Distributional and Pattern-Based Word Clustering
Word clustering is a conventional and important NLP task, and the literature has suggested two kinds of approaches to this problem. One is based on the distributional similarity a...
Nobuhiro Kaji, Masaru Kitsuregawa