Sciweavers

293 search results - page 55 / 59
» Joint Morphological-Lexical Language Modeling for Machine Tr...
Sort
View
DLT
2008
13 years 10 months ago
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
Mohamed Faouzi Atig, Benedikt Bollig, Peter Haberm...
ACL
2003
13 years 10 months ago
tRuEcasIng
Truecasing is the process of restoring case information to badly-cased or noncased text. This paper explores truecasing issues and proposes a statistical, language modeling based ...
Lucian Vlad Lita, Abraham Ittycheriah, Salim Rouko...
LISP
2006
105views more  LISP 2006»
13 years 8 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
VLDB
1994
ACM
147views Database» more  VLDB 1994»
14 years 20 days ago
Integrating a Structured-Text Retrieval System with an Object-Oriented Database System
We describe the integration of a structuredtext retrieval system (TextMachine) into an object-oriented database system (OpenODB). We use the external function capability of the da...
Tak W. Yan, Jurgen Annevelink
ACL
2010
13 years 6 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler