Computing optimal descriptions for optimality theory grammars with context-free position structures

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1996-June, Issue , 1996, Pages 101-107

  Tesar, Bruce ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

STRUCTURAL OPTIMIZATION;

CONTEXT-FREE; CONTEXT-FREE STRUCTURES; CORE DYNAMICS; GENERALISATION; OPTIMALITY THEORIES; STRUCTURAL DESCRIPTIONS; TIME COMPLEXITY;

DYNAMIC PROGRAMMING;

EID: 0042313776     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. S. O. Anderson and R. C. Backhouse. 1981. Locally least-cost error recovery in Earley's algorithm. ACM Transactions on Programming Languages and Systems 3: 318-347.
2. Eugene Charniak. 1993. Statistical language learning. Cambridge, MA: MIT Press.
3. Martin Kay. 1980. Algorithmic schemata and data structures in syntactic processing. CSL-80-12, October 1980.
4. K. Lari and S. J. Young. 1990. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language 4: 35-36.
5. Harry R. Lewis and Christos H. Papadimitriou. 1981. Elements of the theory of computation. Englewood Cliffs, New Jersey: Prentice-Hall, Inc.
6. Alan Prince and Paul Smolensky. 1993. Optimality Theory: Constraint interaction in generative grammar. Technical Report CU-CS-696-93, Department of Computer Science, University of Colorado at Boulder, and Technical Report TR-2, Rutgers Center for Cognitive Science, Rutgers University, New Brunswick, NJ. March. To appear in the Linguistic Inquiry Monograph Series, Cambridge, MA: MIT Press.
7. David Sankoff and Joseph Kruskal. 1983. Time warps, string edits, and macromolecules: The theory and practice of sequence comparison. Reading, MA: Addison-Wesley.
8. Bruce Tesar. 1994. Parsing in Optimality Theory: A dynamic programming approach. Technical Report CU-CS-714-94, April 1994. Department of Computer Science, University of Colorado, Boulder.
9. Bruce Tesar. 1995a. Computing optimal forms in Optimality Theory: Basic syllabification. Technical Report CU-CS-763-95, February 1995. Department of Computer Science, University of Colorado, Boulder.
10. Bruce Tesar. 1995b. Computational Optimality Theory. Unpublished Ph.D. Dissertation. Department of Computer Science, University of Colorado, Boulder. June 1995.
11. A.J. Viterbi. 1967. Error bounds for convolution codes and an asymptotically optimal decoding algorithm. IEEE Trans. on Information Theory 13:260-269.