3780 search results - page 348 / 756 » Structured Relation Discovery using Generative Models |
197
click to vote
MEMOCODE
2003
IEEE
16 years 1 days ago
2003
IEEE
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...
154
click to vote
COLING
2002
15 years 6 months ago
2002
A standard architecture for an NLG system has been defined in (Reiter and Dale, 2000). Their work describes the modularization of an NLG system and the tasks of each module. Howev...
182
click to vote
AAAI
2006
15 years 8 months ago
2006
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
189
click to vote
CICLING
2010
Springer
16 years 1 months ago
2010
Springer
Identifying discourse relations in a text is essential for various tasks in Natural Language Processing, such as automatic text summarization, question-answering, and dialogue gene...
192
click to vote
MASCOTS
2003
15 years 8 months ago
2003
Abstract. In this paper we describe a formalism which uses the stochastic process algebra PEPA as the inscription language for labelled stochastic Petri nets. Viewed in another way...