Violation Semirings in Optimality Theory

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Research on Language and Computation

• Publication date

  2009-07-04

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/S11168-009-9063-0
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Harmonic Grammar with linear programming: from linear systems to linguistic typology*

  2010cited by this paper
• Evaluating the Complexity of Optimality Theory

  2009cited by this paper
• A Simple Proof That Optimality Theory Is Computationally Intractable

  2006cited by this paper
• Harmonic grammar with linear programming ∗

  2006cited by this paper
• The Harmonic Mind: From Neural Computation to Optimality-Theoretic GrammarVolume I: Cognitive Architecture (Bradford Books)

  2006cited by this paper
• Coarse-to-Fine n-Best Parsing and MaxEnt Discriminative Reranking

  2005cited by this paper
• A Note on Join and Auto-Intersection of n-ary Rational Relations

  2004cited by this paper
• Generation, recognition, and learning in finite state optimality theory

  2004influential reference
• Optimality Theory: Constraint Interaction in Generative Grammar

  2004influential reference
• HLT-NAACL 2003 : Human Language Technology conference of the North American Chapter of the Association for Computational Linguistics : proceedings of the main conference : May 27 to June 1, 2003, Edmonton, Alberta, Canada

  2003cited by this paper
• Simpler and More General Minimization for Weighted Finite-State Automata

  2003cited by this paper
• Semiring Frameworks and Algorithms for Shortest-Distance Problems

  2002cited by this paper
• Easy and Hard Constraint Ranking in Optimality Theory: Algorithms and Complexity

  2001cited by this paper
• Parsing and Hypergraphs

  2001cited by this paper
• Approximation and Exactness in Finite State Optimality Theory

  2000cited by this paper
• Systematic parameterized complexity analysis in computational phonology

  1999cited by this paper
• The Proper Treatment of Optimality in Computational Phonology

  1998cited by this paper
• Optimality Theory and the Generative Complexity of Constraint Violability

  1998cited by this paper
• Shortest Path Algorithms for Nearly Acyclic Directed Graphs

  1998cited by this paper
• Representations and Finite-State Components in Natural Language

  1997cited by this paper
• Finite-State Language Processing

  1997cited by this paper
• Efficient Generation in Primitive Optimality Theory

  1997cited by this paper
• Semiring-based constraint satisfaction and optimization

  1997cited by this paper
• Regular Models of Phonological Rule Systems

  1994cited by this paper
• Phonological Derivation in Optimality Theory

  1994cited by this paper
• A survey of sequential and systolic algorithms for the algebraic path problem

  1992cited by this paper
• Harmonic grammar: A formal multi-level connectionist theory of linguistic well-formedness: Theoretic

  1990cited by this paper
• Recognizable Sets with Multiplicities in the Tropical Semiring

  1988cited by this paper
• A General Computational Model for Word-Form Recognition and Production

  1984cited by this paper
• Introduction to Automata Theory, Languages and Computation

  1979cited by this paper
• A note on two problems in connexion with graphs

  1959cited by this paper

• The emergence of French phonology

  2020influential citation
• Efficient Evaluation and Learning in Multilevel Parallel Constraint Grammars

  2017cites this paper
• Long words in maximum entropy phonotactic grammars*

  2015cites this paper
• What is computational phonology

  2014cites this paper
• Evaluating the Complexity of Optimality Theory

  2009influential citation
• Generating Contenders

  2009cites this paper
• Reconciling categorical and gradient models of phonotactics

  year unknowncites this paper