Sciweavers

838 search results - page 150 / 168
» From Natural Language to Formal Proof Goal
Sort
View
COLING
1996
13 years 8 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
POPL
2009
ACM
14 years 8 months ago
The theory of deadlock avoidance via discrete control
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
JOCN
2010
123views more  JOCN 2010»
13 years 5 months ago
Coercion and Compositionality
■ Research in psycholinguistics and in the cognitive neuroscience of language has suggested that semantic and syntactic integration are associated with different neurophysiologi...
Giosuè Baggio, Travis Choma, Michiel van La...
NAACL
2003
13 years 8 months ago
Automatic Acquisition of Names Using Speak and Spell Mode in Spoken Dialogue Systems
This paper describes a novel multi-stage recognition procedure for deducing the spelling and pronunciation of an open set of names. The overall goal is the automatic acquisition o...
Grace Chung, Stephanie Seneff, Chao Wang
EIT
2008
IEEE
14 years 1 months ago
Taming XML: Objects first, then markup
Abstract—Processing markup in object-oriented languages often requires the programmer to focus on the objects generating the markup rather than the more pertinent domain objects....
Matt Bone, Peter F. Nabicht, Konstantin Läufe...