Sciweavers

681 search results - page 21 / 137
» Parsing as Natural Deduction
Sort
View
ACL
2001
14 years 11 months ago
Automated Parser Construction from a Treebank by means of TBL and ILP
Considering the difficulties inherent in the manual construction of natural language parsers, we have designed and implemented our system GRIND which is capable of learning a sequ...
Miloslav Nepil
FPL
2001
Springer
101views Hardware» more  FPL 2001»
15 years 2 months ago
An FPGA-Based Syntactic Parser for Real-Life Almost Unrestricted Context-Free Grammars
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by almost unrestricted real-life context-free grammars (CFGs). More prec...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...
LACL
1998
Springer
15 years 1 months ago
Deductions with Meaning
In this paper, we consider some of the problems that arise if automated reasoning methods are applied to natural language semantics. It turns that out that the problem of ambiguity...
Christof Monz, Maarten de Rijke
EACL
2006
ACL Anthology
14 years 11 months ago
Online Learning of Approximate Dependency Parsing Algorithms
In this paper we extend the maximum spanning tree (MST) dependency parsing framework of McDonald et al. (2005c) to incorporate higher-order feature representations and allow depen...
Ryan T. McDonald, Fernando C. N. Pereira
EACL
1993
ACL Anthology
14 years 11 months ago
Head-driven Parsing for Lexicalist Grammars: Experimental Results
We present evidence that head-driven parsing strategies lead to efficiency gains over standard parsing strategies, for lexicalist, concatenative and unification-based grammars. A ...
Gosse Bouma, Gertjan van Noord