Authors
Alex Djalali
Stanford University
Abstract
Partial order optimality theory is a conservative generalization of classical optimality theory that makes possible the modeling of free variation and quantitative regularities without any numerical parameters. Solving the ranking problem for PoOT has so far remained an outstanding problem: allowing for free variation, given a finite set of input/output pairs, i.e., a dataset, \ that a speaker S knows to be part of some language L, how can S learn the set of all grammars G under some constraint set C compatible with \?. Here, allowing for free variation, given the set of all PoOT grammars GPoOT over a constraint set C, for an arbitrary \, I provide set-theoretic means for constructing the actual set G compatible with \. Specifically, I determine the set of all STRICT ORDERS of C that are compatible with \. As every strict total order is a strict order, our solution is applicable in both PoOT and COT, showing that the ranking problem in COT is a special instance of a more general one in PoOT.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
ISBN(s)
DOI 10.1007/s10849-017-9248-0
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,587
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

The Asymmetry of Optimality Theoretic Syntax and Semantics.H. Zeevat - 2000 - Journal of Semantics 17 (3):243-262.
Introduction to Lattices and Order.B. A. Davey & H. A. Priestly - 2002 - Cambridge University Press.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

The Partitive Constraint in Optimality Theory.A. Anttila - 2000 - Journal of Semantics 17 (4):281-314.
Partial Word Order Freezing in Dutch.Gerlof J. Bouma & Petra Hendriks - 2012 - Journal of Logic, Language and Information 21 (1):53-73.
Optimality Theory as a Family of Cumulative Logics.Ph Besnard, G. Fanselow & T. Schaub - 2003 - Journal of Logic, Language and Information 12 (2):153-182.
Belief Revision II: Ranking Theory.Franz Huber - 2013 - Philosophy Compass 8 (7):613-621.
Ranking Functions and Rankings on Languages.Franz Huber - 2006 - Artificial Intelligence 170 (4-5):462-471.
The 'Now What' Problem for Error Theory.Matt Lutz - 2014 - Philosophical Studies 171 (2):351-371.
Arithmetical Set Theory.Paul Strauss - 1991 - Studia Logica 50 (2):343 - 350.
A Survey of Ranking Theory.Wolfgang Spohn - 2009 - In Franz Huber & Christoph Schmidt-Petri (eds.), Degrees of Belief. Springer.

Analytics

Added to PP index
2017-04-08

Total views
8 ( #987,954 of 2,461,948 )

Recent downloads (6 months)
1 ( #448,599 of 2,461,948 )

How can I increase my downloads?

Downloads

My notes