Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ACL
2010

favoriteEmaildiscussreport

133views Computational Linguistics» more ACL 2010»

Estimating Strictly Piecewise Distributions

13 years 2 months ago

Estimating Strictly Piecewise Distributions

Download www.cs.earlham.edu

Strictly Piecewise (SP) languages are a subclass of regular languages which encode certain kinds of long-distance dependencies that are found in natural languages. Like the classes in the Chomsky and Subregular hierarchies, there are many independently converging characterizations of the SP class (Rogers et al., to appear). Here we define SP distributions and show that they can be efficiently estimated from positive data.

Jeffrey Heinz, James Rogers

Real-time Traffic

ACL 2010 | Computational Linguistics | Long-distance Dependencies | Regular Languages | SP Class |

claim paper

Related Content

» Estimation for Strictly Positive Stable Laws

» Filtering Using a TreeBased Estimator

» RMMEDA A Regularity ModelBased Multiobjective Estimation of Distribution Algorithm

» Archimedean copula estimation using Bayesian splines smoothing techniques

» Estimating Recombination Rate Distribution by Optimal Quantization

» Robust Voronoibased curvature and feature estimation

» Distributional Convergence of Subspace Estimates in FastICA A Bootstrap Study

» Image Restoration by Matching Gradient Distributions

» Segmentation of MR images with intensity inhomogeneities

Post Info
More Details (n/a)

Added	10 Feb 2011
Updated	10 Feb 2011
Type	Journal
Year	2010
Where	ACL
Authors	Jeffrey Heinz, James Rogers

Comments (0)