1929 search results - page 205 / 386 » Learning for Semantic Parsing |
QEST
2008
IEEE
14 years 3 months ago
2008
IEEE
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
SEMCO
2007
IEEE
14 years 3 months ago
2007
IEEE
One of the ultimate goals of natural language processing (NLP) systems is understanding the meaning of what is being transmitted, irrespective of the medium (e.g., written versus ...
GEOS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Conceptual Graphs are a very powerful knowledge and meaning representation formalism grounded on deep philosophical, linguistic and object oriented principles [1], [2]. C...
SARA
2009
Springer
14 years 1 months ago
2009
Springer
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
LACL
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...