Sciweavers

2836 search results - page 8 / 568
» Parsing Algorithms and Metrics
Sort
View
ACL
1994
13 years 9 months ago
Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorit...
John Carroll
COLING
1996
13 years 9 months ago
Restricted Parallelism in Object-Oriented Lexical Parsing
We present an approach to parallel natural language parsing which is based on a concurrent, object-oriented model of computation. A depth-first, yet incomplete parsing algorithm f...
Peter Neuhaus, Udo Hahn
FPL
2001
Springer
101views Hardware» more  FPL 2001»
14 years 5 days 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,...
CORR
2004
Springer
140views Education» more  CORR 2004»
13 years 7 months ago
Better algorithms for unfair metrical task systems and applications
Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems...
Amos Fiat, Manor Mendel
COLING
2000
13 years 9 months ago
Parsing Schemata for Grammars with Variable Number and Order of Constituents
We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...
Karl-Michael Schneider