Sciweavers

1912 search results - page 128 / 383
» On the evaluation of argumentation formalisms
Sort
View
ACL
2006
15 years 7 months ago
Acceptability Prediction by Means of Grammaticality Quantification
We propose in this paper a method for quantifying sentence grammaticality. The approach based on Property Grammars, a constraint-based syntactic formalism, makes it possible to ev...
Philippe Blache, Barbara Hemforth, Stéphane...
ANLP
2000
96views more  ANLP 2000»
15 years 7 months ago
Experiments with Corpus-based LFG Specialization
Sophisticated grammar formalisms, such as LFG, allow concisely capturing complex linguistic phenomena. The powerful operators provided by such formalisms can however introduce spu...
Nicola Cancedda, Christer Samuelsson
IPMU
2010
Springer
15 years 4 months ago
Keeping Secrets in Possibilistic Knowledge Bases with Necessity-Valued Privacy Policies
Controlled Query Evaluation (CQE) is a logical framework for the protection of secrets in databases. In this article, we extend the CQE framework to possibilistic logic: knowledge ...
Lena Wiese
AGTIVE
1999
Springer
15 years 10 months ago
An L-System-Based Plant Modeling Language
Cpfg is a program for simulating and visualizing plant development, based on the theory of L−systems. A special−purpose programming language, used to specify plant models, is ...
Przemyslaw Prusinkiewicz, Jim Hanan, Radomí...
NAACL
2010
15 years 4 months ago
A Simple Approach for HPSG Supertagging Using Dependency Information
In a supertagging task, sequence labeling models are commonly used. But their limited ability to model long-distance information presents a bottleneck to make further improvements...
Yao-zhong Zhang, Takuya Matsuzaki, Jun-ichi Tsujii