Sciweavers

2836 search results - page 52 / 568
» Parsing Algorithms and Metrics
Sort
View
WIA
1998
Springer
13 years 12 months ago
On Parsing and Condensing Substrings of LR Languages in Linear Time
Abstract. LR parsers have long been known as being an efficient algorithm for recognizing deterministic context
Heiko Goeman
ICDCS
2002
IEEE
14 years 22 days ago
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
Thiagaraja Gopalsamy, Mukesh Singhal, Dhabaleswar ...
ICIAP
2007
ACM
13 years 11 months ago
Parsing Silhouettes without Boundary Curvature
We describe a new decomposition algorithm for twodimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes ("ribbons") by group...
Ralf Juengling, Lakshman Prasad
EMNLP
2004
13 years 9 months ago
Max-Margin Parsing
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...
Ben Taskar, Dan Klein, Mike Collins, Daphne Koller...
ACL
2012
11 years 10 months ago
Semantic Parsing with Bayesian Tree Transducers
Many semantic parsing models use tree transformations to map between natural language and meaning representation. However, while tree transformations are central to several state-...
Bevan K. Jones, Mark Johnson, Sharon Goldwater