Sciweavers

153 search results - page 6 / 31
» Generalizing Word Lattice Translation
Sort
View
COLING
1996
13 years 8 months ago
Aligning More Words with High Precision for Small Bilingual Corpora
In this paper, we propose an algorithm for identifying each word with its translations in a sentence and translation pair. Previously proposed methods require enormous amounts of ...
Sur-Jin Ker, Jason J. S. Chang
APAL
2002
83views more  APAL 2002»
13 years 7 months ago
Inherently nonfinitely based lattices
We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) genera...
Ralph Freese, George F. McNulty, James B. Nation
ICASSP
2008
IEEE
14 years 1 months ago
Sentence segmentation and punctuation recovery for spoken language translation
Sentence segmentation and punctuation recovery are critical components for effective spoken language translation (SLT). In this paper we describe our recent work on sentence segme...
Matthias Paulik, Sharath Rao, Ian R. Lane, Stephan...
KES
2005
Springer
14 years 29 days ago
Learning Method for Automatic Acquisition of Translation Knowledge
This paper presents a new learning method for automatic acquisition of translation knowledge from parallel corpora. We apply this learning method to automatic extraction of bilingu...
Hiroshi Echizen-ya, Kenji Araki, Yoshio Momouchi
DCC
2011
IEEE
13 years 2 months ago
Sparse Boolean equations and circuit lattices
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
Igor Semaev