Sciweavers

595 search results - page 51 / 119
» Languages Of Analogical Strings
Sort
View
FOCS
1997
IEEE
15 years 2 months ago
Making Nondeterminism Unambiguous
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...
Klaus Reinhardt, Eric Allender
AISC
2008
Springer
14 years 11 months ago
High-Level Theories
We introduce high-level theories in analogy with high-level programming languages. The basic point is that even though one can define many theories via simple, low-level axiomatiza...
Jacques Carette, William M. Farmer
ACL
2004
14 years 11 months ago
Experiments in parallel-text based grammar induction
This paper discusses the use of statistical word alignment over multiple parallel texts for the identification of string spans that cannot be constituents in one of the languages....
Jonas Kuhn
DAGSTUHL
2006
14 years 11 months ago
Binary Lambda Calculus and Combinatory Logic
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
John Tromp
ACL
2001
14 years 11 months ago
A Machine Learning Approach to the Automatic Evaluation of Machine Translation
We present a machine learning approach to evaluating the wellformedness of output of a machine translation system, using classifiers that learn to distinguish human reference tran...
Simon Corston-Oliver, Michael Gamon, Chris Brocket...