Sciweavers

681 search results - page 36 / 137
» Parsing as Natural Deduction
Sort
View
FCCM
2000
IEEE
83views VLSI» more  FCCM 2000»
15 years 2 months ago
An FPGA-Based Coprocessor for the Parsing of Context-Free Grammars
This paper presents an FPGA-based implementation of a co-processing unit able to parse context-free grammars of real-life sizes. The application elds of such a parser range from p...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...
100
Voted
CICLING
2007
Springer
15 years 3 months ago
Learning for Semantic Parsing
Semantic parsing is the task of mapping a natural language sentence into a complete, formal meaning representation. Over the past decade, we have developed a number of machine lear...
Raymond J. Mooney
79
Voted
IDEAS
1997
IEEE
107views Database» more  IDEAS 1997»
15 years 1 months ago
Query Processing in the ROL system
The ROL system is a novel deductive object-oriented database system that has been implemented at the University of Regina. It provides a uniform rule-based declarative language fo...
Mengchi Liu, Weidong Yu
CPP
2011
107views more  CPP 2011»
13 years 9 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
JIIS
2008
104views more  JIIS 2008»
14 years 9 months ago
A framework for checking proofs naturally
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
Masahiko Sato