Sciweavers

294 search results - page 11 / 59
» Relation between Semantic Completeness and Syntax Completene...
Sort
View
ESSLLI
1999
Springer
13 years 12 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
ML
2006
ACM
122views Machine Learning» more  ML 2006»
13 years 7 months ago
PRL: A probabilistic relational language
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...
Lise Getoor, John Grant
NAACL
1994
13 years 9 months ago
Pattern Matching in a Linguistically-Motivated Text Understanding System
An ongoing debate in text understanding efforts centers on the use of pattern-matching techniques, which some have characterized as "designed to ignore as much text as possib...
Damaris M. Ayuso
NGC
1998
Springer
115views Communications» more  NGC 1998»
13 years 7 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang
ICCS
1999
Springer
13 years 12 months ago
Conceptual Structures Represented by Conceptual Graphs and Formal Concept Analysis
Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation b...
Guy W. Mineau, Gerd Stumme, Rudolf Wille