Sciweavers

139 search results - page 19 / 28
» Finding Gale Strings
Sort
View
ICMCS
2006
IEEE
103views Multimedia» more  ICMCS 2006»
15 years 5 months ago
Multiplierless Approximation of Fast DCT Algorithms
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
Raymond Chan, Moon-chuen Lee
90
Voted
NLPRS
2001
Springer
15 years 4 months ago
Automatically Harvesting Katakana-English Term Pairs from Search Engine Query Logs
This paper describes a method of extracting katakana words and phrases, along with their English counterparts from non-aligned monolingual web search engine query logs. The method...
Eric Brill, Gary Kacmarcik, Chris Brockett
FINTAL
2006
15 years 3 months ago
Regular Approximation of Link Grammar
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
Filip Ginter, Sampo Pyysalo, Jorma Boberg, Tapio S...
COLING
2008
15 years 1 months ago
A Discriminative Alignment Model for Abbreviation Recognition
This paper presents a discriminative alignment model for extracting abbreviations and their full forms appearing in actual text. The task of abbreviation recognition is formalized...
Naoaki Okazaki, Sophia Ananiadou, Jun-ichi Tsujii
ACL
2006
15 years 1 months ago
Stochastic Iterative Alignment for Machine Translation Evaluation
A number of metrics for automatic evaluation of machine translation have been proposed in recent years, with some metrics focusing on measuring the adequacy of MT output, and othe...
Ding Liu, Daniel Gildea