Sciweavers

3818 search results - page 85 / 764
» Word Problems on Compressed Words
Sort
View
ACL
2007
15 years 6 months ago
Sentence generation as a planning problem
In this paper, we translate sentence generation from TAG grammars with semantic and pragmatic information into a planning problem by encoding the contribution of each word declara...
Alexander Koller, Matthew Stone
ACL
1993
15 years 5 months ago
How do we count? The Problem of Tagging Phrasal Verbs in Parts
This paper examines the current performance of the stochastic tagger PARTS (Church 88) in handling phrasal verbs, describes a problem that arises from the statistical model used, ...
Nava A. Shaked
JCAM
2010
139views more  JCAM 2010»
14 years 11 months ago
A finite difference method for free boundary problems
Fornberg and Meyer-Spasche proposed some time ago a simple strategy to correct finite difference schemes in the presence of a free boundary that cuts across a Cartesian grid. We sh...
Bengt Fornberg
WADS
2009
Springer
317views Algorithms» more  WADS 2009»
15 years 11 months ago
Shortest Path Problems on a Polyhedral Surface
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
Atlas F. Cook, Carola Wenk
FUN
2007
Springer
85views Algorithms» more  FUN 2007»
15 years 8 months ago
Efficient Algorithms for the Spoonerism Problem
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ri...