Sciweavers

4708 search results - page 72 / 942
» Generating the Structure of Argument
Sort
View
FOCS
1991
IEEE
15 years 8 months ago
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
Anna Gál
SYNTHESE
2008
81views more  SYNTHESE 2008»
15 years 4 months ago
Adequate formalization
This article identifies problems with regard to providing criteria that regulate the matching of logical formulae and natural language. We then take on to solve these problems by d...
Michael Baumgartner, Timm Lampert
CORR
1998
Springer
76views Education» more  CORR 1998»
15 years 4 months ago
A Linguistically Interpreted Corpus of German Newspaper Text
In this paper, we report on the development of an annotation scheme an annotation tools for unrestricted German text. Our representation format is based on argument structure, but...
Wojciech Skut, Thorsten Brants, Brigitte Krenn, Ha...
KES
2005
Springer
15 years 10 months ago
OntoExtractor: A Fuzzy-Based Approach in Clustering Semi-structured Data Sources and Metadata Generation
This paper describes a theoretical approach on data mining, information classifying and a global overview of our OntoExtractor application, concerning the analysis of incoming data...
Zhan Cui, Ernesto Damiani, Marcello Leida, Marco V...
MT
2010
134views more  MT 2010»
15 years 2 months ago
Improve syntax-based translation using deep syntactic structures
This paper introduces deep syntactic structures to syntax-based Statistical Machine Translation (SMT). We use a Head-driven Phrase Structure Grammar (HPSG) parser to obtain the de...
Xianchao Wu, Takuya Matsuzaki, Jun-ichi Tsujii