Estimating Strictly Piecewise distributions

Jeffrey Heinz; James Rogers

Estimating Strictly Piecewise distributions

Jeffrey Heinz
, James Rogers

Linguistics

Stony Brook University

Earlham College

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

21 Scopus citations

Abstract

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.

Original language	English
Title of host publication	ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference
Pages	886-896
Number of pages	11
State	Published - 2010
Event	48th Annual Meeting of the Association for Computational Linguistics, ACL 2010 - Uppsala, Sweden Duration: Jul 11 2010 → Jul 16 2010

Publication series

Name	ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Conference

Conference	48th Annual Meeting of the Association for Computational Linguistics, ACL 2010
Country/Territory	Sweden
City	Uppsala
Period	07/11/10 → 07/16/10

Cite this

@inproceedings{a327bb43389d4d5fb6f894bb8c5f7abc,

title = "Estimating Strictly Piecewise distributions",

abstract = "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.",

author = "Jeffrey Heinz and James Rogers",

year = "2010",

language = "English",

isbn = "9781617388088",

series = "ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference",

pages = "886--896",

booktitle = "ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference",

note = "48th Annual Meeting of the Association for Computational Linguistics, ACL 2010 ; Conference date: 11-07-2010 Through 16-07-2010",

}

Heinz, J & Rogers, J 2010, Estimating Strictly Piecewise distributions. in ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference. ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pp. 886-896, 48th Annual Meeting of the Association for Computational Linguistics, ACL 2010, Uppsala, Sweden, 07/11/10.

Estimating Strictly Piecewise distributions. / Heinz, Jeffrey; Rogers, James.
ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference. 2010. p. 886-896 (ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Estimating Strictly Piecewise distributions

AU - Heinz, Jeffrey

AU - Rogers, James

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/80355130819

M3 - Conference contribution

SN - 9781617388088

T3 - ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

SP - 886

EP - 896

BT - ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

T2 - 48th Annual Meeting of the Association for Computational Linguistics, ACL 2010

Y2 - 11 July 2010 through 16 July 2010

ER -

Estimating Strictly Piecewise distributions

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this