Sciweavers

35 search results - page 7 / 7
» Grammar Analysis and Parsing by Abstract Interpretation
Sort
View
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 6 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ISNN
2007
Springer
14 years 12 days ago
A Connectionist Thematic Grid Predictor for Pre-parsed Natural Language Sentences
Abstract. Inspired on psycholinguistics and neuroscience, a symbolicconnectionist hybrid system called θ-Pred (Thematic Predictor for natural language) is proposed, designed to re...
João Luís Garcia Rosa
ICCV
1995
IEEE
13 years 9 months ago
FORMS: A Flexible Object Recognition and Modelling System
Abstract. We describe a flexible object recognition and modelling system (FORMS) which represents and recognizes animate objects from their silhouettes. This consists of a model fo...
Song Chun Zhu, Alan L. Yuille
ICOODB
2009
246views Database» more  ICOODB 2009»
13 years 4 months ago
Compiler Plugins Can Handle Nested Languages: AST-Level Expansion of LINQ Queries for Java
The integration of database and programming languages is made difficult by the different data models and type systems prevalent in each field. Functional-object query languages con...
Miguel Garcia
EACL
1993
ACL Anthology
13 years 7 months ago
A Computational Treatment of Sentence-Final 'then'
We describe a computational system which parses discourses consisting of sequences of simple sentences. These contain a range of temporal constructions, including time adverbials,...
Sheila Glasbey