Sciweavers

2836 search results - page 19 / 568
» Parsing Algorithms and Metrics
Sort
View
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
15 years 12 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
95
Voted
COLING
1994
15 years 1 months ago
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
Emmanuel Roche
LREC
2008
180views Education» more  LREC 2008»
15 years 1 months ago
MaltEval: an Evaluation and Visualization Tool for Dependency Parsing
This paper presents a freely available evaluation tool for dependency parsing, MaltEval (http://w3.msi.vxu.se/users/jni/malteval). It is flexible and extensible, and provides func...
Jens Nilsson, Joakim Nivre
69
Voted
WIA
1997
Springer
15 years 3 months ago
Construction of Efficient Generalized LR Parsers
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
Miguel A. Alonso, David Cabrero, Manuel Vilares Fe...
ACL
2009
14 years 9 months ago
Sentence diagram generation using dependency parsing
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
Elijah Mayfield