Sciweavers

643 search results - page 32 / 129
» Parsing And Derivational Equivalence
Sort
View
CALCO
2005
Springer
85views Mathematics» more  CALCO 2005»
14 years 1 months ago
Using Proofs by Coinduction to Find "Traditional" Proofs
In the specific situation of formal reasoning concerned with “regular expression equivalence” we address instances of more general questions such as: how can coinductive argum...
Clemens Grabmayer
PDPTA
2007
13 years 9 months ago
Scheduling Divisible Workloads from Multiple Sources in Linear Daisy Chain Networks
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...
Xinxin Liu, Han Zhao, Xiaolin Li
COLING
1992
13 years 8 months ago
Term-Rewriting As A Basis For A Uniform Architecture In Machine Translation
In machine translation (MT) dierent levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be relat...
Wilhelm Weisweber
DCC
2007
IEEE
14 years 7 months ago
Bit Recycling with Prefix Codes
Many data compression methods cannot remove all redundancy from a file that they compress because it can be encoded to many compressed files. In particular, we consider the redund...
Danny Dubé, Vincent Beaudoin
CICLING
2007
Springer
14 years 1 months ago
Morphological Disambiguation of Turkish Text with Perceptron Algorithm
Abstract. This paper describes the application of the perceptron algorithm to the morphological disambiguation of Turkish text. Turkish has a productive derivational morphology. Du...
Hasim Sak, Tunga Güngör, Murat Saraclar