3653 search results - page 91 / 731 » On Recognizable Timed Languages |
ICFP
2004
ACM
15 years 10 months ago
2004
ACM
Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/apply. Implementors use their intuition and qualitative...
EMNLP
2008
14 years 11 months ago
2008
The intersection of tree transducer-based translation models with n-gram language models results in huge dynamic programs for machine translation decoding. We propose a multipass,...
264
click to vote
Book
"this book is an introduction to the main ideas of the Tcl programming language: If you wish to learn a simple and powerful programming language, this book is for you. To read...
NIPS
2008
14 years 11 months ago
2008
Neural probabilistic language models (NPLMs) have been shown to be competitive with and occasionally superior to the widely-used n-gram language models. The main drawback of NPLMs...
ITA
2007
14 years 9 months ago
2007
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...