Sciweavers

877 search results - page 17 / 176
» How to Cover a Grammar
Sort
View
87
Voted
AAAI
2008
15 years 2 months ago
Lexical and Grammatical Inference
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
Tom Armstrong, Tim Oates
95
Voted
RIDE
2003
IEEE
15 years 5 months ago
Event Information Extraction Using Link Grammar
In this paper, we present a scheme for identifying instances of events and extracting information about them. The scheme can handle all events with which an action can be associat...
Harsha V. Madhyastha, N. Balakrishnan, K. R. Ramak...
112
Voted
CI
2005
99views more  CI 2005»
15 years 13 days ago
Automatically Generating Tree Adjoining Grammars from Abstract Specifications
TRACT SPECIFICATIONS FEI XIA AND MARTHA PALMER Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104 K. VIJAY-SHANKER Department of Com...
Fei Xia, Martha Palmer, K. Vijay-Shanker
104
Voted
IJCAI
2007
15 years 2 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
COLING
2008
15 years 2 months ago
Integrating a Unification-Based Semantics in a Large Scale Lexicalised Tree Adjoining Grammar for French
In contrast to LFG and HPSG, there is to date no large scale Tree Adjoining Grammar (TAG) equiped with a compositional semantics. In this paper, we report on the integration of a ...
Claire Gardent