Sciweavers

6618 search results - page 244 / 1324
» Natural Logic for Natural Language
Sort
View
EACL
2003
ACL Anthology
15 years 8 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
ANLP
2000
123views more  ANLP 2000»
15 years 8 months ago
Generating Text with a Theorem Prover
The process of documenting designs is tedious and often error-prone. We discuss a system that automatically generates documentation for the single step transition behavior of Stat...
Ivan I. Garibay
EMNLP
2011
14 years 6 months ago
Dual Decomposition with Many Overlapping Components
Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are ...
André L. Martins, Noah A. Smith, Már...
FOSSACS
1999
Springer
15 years 11 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro
AAAI
2000
15 years 8 months ago
DMML: An XML Language for Interacting with Multi-Modal Dialog Systems
We present Dialog Moves Markup Language (DMML): an extensible markup language (XML) representation of modality independent communicative acts of automated conversational agents. I...
Nanda Kambhatla, Malgorzata Budzikowska, Sylvie Le...