Results of Applying Recursive Constraint Demotion to VenetoBruce.txt

4-25-2019, 11:46 a.m.

OTSoft 2.5, release date 1/17/2017

1. Result

A ranking was found that generates the correct outputs.

Stratum | Constraint Name | Abbreviation
Stratum #1 | Ident(high) + to - | Id(hi) + -
| Ident(ATR) | Id(ATR)
Stratum #2 | *- + high in foot | *- + hi
Stratum #3 | Ident(high) - to + | Id(hi) - +

2. Tableaux

/kals-'et-i/: | Id(hi) + - | Id(ATR) | *- + hi | Id(hi) - +
☞ kals-'it-i |  |

*

kals-'et-i |  |  | *! |
kals-'et-e | *! |  |  |

/kant-'e-si-mo/: | Id(hi) + - | Id(ATR) | *- + hi | Id(hi) - +
☞ kant-'i-si-mo |  |

*

kant-'i-si-mu |  |  |  | **!
kant-'e-si-mo |  |  | *! |
kant-'e-se-mo | *! |  |  |

/ 'orden-i/: | Id(hi) + - | Id(ATR) | *- + hi | Id(hi) - +
☞ 'urdin-i |  |

**

'orden-i |  |  | *! |
'urden-i |  |  | *! | *
'ordin-i |  |  | *! | *
'orden-e | *! |  |  |

/ 'pErseg-i/: | Id(hi) + - | Id(ATR) | *- + hi | Id(hi) - +
☞ 'pErseg-i |  |

*

'pErsig-i |  |  | * | *!
'pirsig-i |  | *! |  | **
'pirseg-i |  | *! | * | *
'pErseg-e | *! |  |  |

/ 'navig-o/: | Id(hi) + - | Id(ATR) | *- + hi | Id(hi) - +
☞ 'navig-o |  |

'naveg-o | *! |  |  |

/e'zErsit-i/: | Id(hi) + - | Id(ATR) | *- + hi | Id(hi) - +
☞ e'zErsit-i |  |

*

e'zirsit-i |  | *! | * | *
e'zErset-i | *! |  | * |

/la'vor-av-i/: | Id(hi) + - | Id(ATR) | *- + hi | Id(hi) - +
☞ la'vor-av-i |  |

*

la'vur-av-i |  |  | **! | *
la'vur-iv-i |  | *! | * | **
la'vor-av-e | *! |  |  |

3. Status of Proposed Constraints: Necessary or Unnecessary

Constraint | Status
Ident(high) + to - | Necessary
Ident(high) - to + | Necessary
Ident(ATR) | Necessary
*- + high in foot | Necessary

4. Ranking Arguments, based on the Fusional Reduction Algorithm

This run sought to obtain the Skeletal Basis, intended to keep each final ranking argument as pithy as possible.

The final rankings obtained are as follows:

Id(ATR) >> *- + hi |
*- + hi >> Id(hi) - + |
Id(hi) + - >> *- + hi |

5. Mini-Tableaux

The following small tableaux may be useful in presenting ranking arguments. They include all winner-rival comparisons in which there is just one winner-preferring constraint and at least one loser-preferring constraint. Constraints not violated by either candidate are omitted.

/kals-'et-i/: | *- + hi | Id(hi) - +
☞ kals-'it-i |

*

kals-'et-i | * |

/kals-'et-i/: | Id(hi) + - | Id(hi) - +
☞ kals-'it-i |

*

kals-'et-e | * |

/kant-'e-si-mo/: | *- + hi | Id(hi) - +
☞ kant-'i-si-mo |

*

kant-'e-si-mo | * |

/kant-'e-si-mo/: | Id(hi) + - | Id(hi) - +
☞ kant-'i-si-mo |

*

kant-'e-se-mo | * |

/ 'orden-i/: | *- + hi | Id(hi) - +
☞ 'urdin-i |

**

'orden-i | * |

/ 'orden-i/: | *- + hi | Id(hi) - +
☞ 'urdin-i |

**

'urden-i | * | *

/ 'orden-i/: | *- + hi | Id(hi) - +
☞ 'urdin-i |

**

'ordin-i | * | *

/ 'orden-i/: | Id(hi) + - | Id(hi) - +
☞ 'urdin-i |

**

'orden-e | * |

/ 'pErseg-i/: | Id(hi) + - | *- + hi
☞ 'pErseg-i |

*

'pErseg-e | * |

/la'vor-av-i/: | Id(hi) + - | *- + hi
☞ la'vor-av-i |

*

la'vor-av-e | * |