Sciweavers

2836 search results - page 17 / 568
» Parsing Algorithms and Metrics
Sort
View
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 7 months ago
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
GRID
2006
Springer
13 years 7 months ago
A Parallel Approach to XML Parsing
A language for semi-structured documents, XML has emerged as the core of the web services architecture, and is playing crucial roles in messaging systems, databases, and document p...
Wei Lu, Kenneth Chiu, Yinfei Pan
NAACL
2010
13 years 5 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
APPROX
2010
Springer
220views Algorithms» more  APPROX 2010»
13 years 9 months ago
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri...
ACL
2007
13 years 9 months ago
K-best Spanning Tree Parsing
This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored ...
Keith Hall