论文信息 - OT Syntax - Decidability of Generation-based Optimization

OT Syntax - Decidability of Generation-based Optimization

In Optimality-Theoretic Syntax, optimization with unrestricted expressive power on the side of the OT constraints is undecidable. This paper provides a proof for the decidability of optimization based on constraints expressed with reference to local subtrees (which is in the spirit of OT theory). The proof builds on Kaplan and Wedekind's (2000) construction showing that LFG generation produces context-free languages.

Jonas Kuhn | Jonas Kuhn

[1] Jonas Kuhn,et al. Formal and computational aspects of optimality-theoretic syntax , 2001 .

[2] Hristopher,et al. Soft Constraints Mirror Hard Constraints : Voice and Person in English and Lummi , 2001 .

[3] Mark Johnson,et al. Estimators for Stochastic “Unification-Based” Grammars , 1999, ACL.

[4] Jeroen van de Weijer,et al. Optimality theory : phonology, syntax, and acquisition , 2000 .

[5] Jonas Kuhn. Processing Optimality-theoretic Syntax by Interleaved Chart Parsing and Generation , 2000, ACL.

[6] Lauri Karttunen,et al. The Proper Treatment of Optimality in Computational Phonology , 1998, ArXiv.

[7] Giorgio Satta,et al. Optimality Theory and the Generative Complexity of Constraint Violability , 1998, CL.

[8] Mark E. Johnson,et al. Optimality–theoretic Lexical Functional Grammar , 2002 .

[9] Mark Johnson,et al. Lexicalized Stochastic Modeling of Constraint-Based Grammars using Log-Linear Measures and EM Training , 2000, ACL.

[10] Mark Johnson,et al. Parsing the Wall Street Journal using a Lexical-Functional Grammar and Discriminative Estimation Techniques , 2002, ACL.

[11] Jason Eisner,et al. Eecient Generation in Primitive Optimality Theory , 1997 .

[12] Gertjan van Noord,et al. Approximation and Exactness in Finite State Optimality Theory , 2000, ACL 2000.

[13] Ronald M. Kaplan,et al. LFG Generation Produces Context-free Languages , 2000, COLING.