on the minimality of panini's sivasutras

87
an . ini’s Śivas¯ utras Task Generalization Results Application Summary On the minimality of P¯ an . ini’s Śivas¯ utras Wiebke Petersen Institute of Language and Information University of Düsseldorf, Germany [email protected] Pondicherry, 9th January 2009 On the minimality of P¯ an . ini’s Śivas¯ utras Wiebke Petersen

Upload: others

Post on 21-Dec-2021

8 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

On the minimality of Pan. ini’s Śivasutras

Wiebke Petersen

Institute of Language and Information

University of Düsseldorf, Germany

[email protected]

Pondicherry, 9th January 2009

A;I+.o+.N,a Á �+.�+.k, Á O;A:ea;z, Á Oe;A:Ea;.c,a Á h;ya;va:=+f, Ál+.N,a Á Va;ma;z+.Na;na;m,a Á Ja;Ba;V,a Á ;Ga;Q+Da;S,a Á .ja;ba;ga;q+.d;Z,a Á

Ka;P+.C+.F+.Ta;.ca;f;ta;v,a Á k+:pa;y,a Á Za;Sa;sa:=, Á h;l, Á

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 2: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Pan. ini’s Śivasutras

A;I+.o+.N,a Á �+.�+.k, Á O;A:ea;z, Á Oe;A:Ea;.c,a Á h;ya;va:=+f, Ál+.N,a Á Va;ma;z+.Na;na;m,a Á Ja;Ba;V,a Á ;Ga;Q+Da;S,a Á .ja;ba;ga;q+.d;Z,a ÁKa;P+.C+.F+.Ta;.ca;f;ta;v,a Á k+:pa;y,a Á Za;Sa;sa:=, Á h;l, Á

a.i.un. | r. .l.k | e.on | ai.auc | hayavarat. |

lan. | namanan. anam | jhabhan | ghad. hadhas. | jabagad. adas |

khaphachat.hathacat.atav | kapay | sas.asar | hal |

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 3: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Pan. ini’s Śivasutras in tabular form

1. a i u N.2. r. l. K3. e o N4. ai au C5. h y v r T.6. l N.7. ñ m n n. n M8. jh bh Ñ9. gh d.h dh S.

10. j b g d. d Ś11. kh ph ch t.h th

c t. t V12. k p Y13. ś s. s R14. h L

A;I+.o+.N,a Á �+.�+.k, Áa.i.un. | r. .l.k |

O;A:ea;z, Á Oe;A:Ea;.c,a Áe.on | ai.auc |

h;ya;va:=+f, Á l+.N,a Áhayavarat. | lan. |

Va;ma;z+.Na;na;m,a Á Ja;Ba;V,a Ánamanan. anam | jhabhan |

;Ga;Q+Da;S,a Á .ja;ba;ga;q+.d;Z,a Ághad. hadhas. | jabagad. adas |

Ka;P+.C+.F+.Ta;.ca;f;ta;v,a Ákhaphachat.hathacat.atav |

k+:pa;y,a Á Za;Sa;sa:=, Á h;l, Ákapay | sas.asar | hal |

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 4: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Pan. ini’s Śivasutras in tabular form

1. a i u N.2. r. l. K3. e o N4. ai au C5. h y v r T.6. l N.7. ñ m n n. n M8. jh bh Ñ9. gh d.h dh S.

10. j b g d. d Ś11. kh ph ch t.h th

c t. t V12. k p Y13. ś s. s R14. h L

A;I+.o+.N,a Á �+.�+.k, Áa.i.un. | r. .l.k |

O;A:ea;z, Á Oe;A:Ea;.c,a Áe.on | ai.auc |

h;ya;va:=+f, Á l+.N,a Áhayavarat. | lan. |

Va;ma;z+.Na;na;m,a Á Ja;Ba;V,a Ánamanan. anam | jhabhan |

;Ga;Q+Da;S,a Á .ja;ba;ga;q+.d;Z,a Ághad. hadhas. | jabagad. adas |

Ka;P+.C+.F+.Ta;.ca;f;ta;v,a Ákhaphachat.hathacat.atav |

k+:pa;y,a Á Za;Sa;sa:=, Á h;l, Ákapay | sas.asar | hal |

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 5: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Pan. ini’s Śivasutras in tabular form

1. a i u N.2. r. l. K3. e o N4. ai au C5. h y v r T.6. l N.7. ñ m n n. n M8. jh bh Ñ9. gh d.h dh S.

10. j b g d. d Ś11. kh ph ch t.h th

c t. t V12. k p Y13. ś s. s R14. h L

anubandha

A;I+.o+.N,a Á �+.�+.k, Áa.i.un. | r. .l.k |

O;A:ea;z, Á Oe;A:Ea;.c,a Áe.on | ai.auc |

h;ya;va:=+f, Á l+.N,a Áhayavarat. | lan. |

Va;ma;z+.Na;na;m,a Á Ja;Ba;V,a Ánamanan. anam | jhabhan |

;Ga;Q+Da;S,a Á .ja;ba;ga;q+.d;Z,a Ághad. hadhas. | jabagad. adas |

Ka;P+.C+.F+.Ta;.ca;f;ta;v,a Ákhaphachat.hathacat.atav |

k+:pa;y,a Á Za;Sa;sa:=, Á h;l, Ákapay | sas.asar | hal |

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 6: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Pan. ini’s Śivasutras in tabular form

1. a i u N.2. r. l. K3. e o N4. ai au C5. h y v r T.6. l N.7. ñ m n n. n M8. jh bh Ñ9. gh d.h dh S.

10. j b g d. d Ś11. kh ph ch t.h th

c t. t V12. k p Y13. ś s. s R14. h L

anubandha

A;I+.o+.N,a Á �+.�+.k, Áa.i.un. | r. .l.k |

O;A:ea;z, Á Oe;A:Ea;.c,a Áe.on | ai.auc |

h;ya;va:=+f, Á l+.N,a Áhayavarat. | lan. |

Va;ma;z+.Na;na;m,a Á Ja;Ba;V,a Ánamanan. anam | jhabhan |

;Ga;Q+Da;S,a Á .ja;ba;ga;q+.d;Z,a Ághad. hadhas. | jabagad. adas |

Ka;P+.C+.F+.Ta;.ca;f;ta;v,a Ákhaphachat.hathacat.atav |

k+:pa;y,a Á Za;Sa;sa:=, Á h;l, Ákapay | sas.asar | hal |

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 7: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Pratyaharas

1. a i u N.2. r. l. K3. e o N4. ai au C5. h y v r T.

a pratyahara is a pair of a sound and an anubandha

it denotes the continuous sequence of sounds in the intervalbetween the sound and the anubandha

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 8: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Pratyaharas

1. a i u N.2. r. l. K3. e o N4. ai au C5. h y v r T.

iK

a pratyahara is a pair of a sound and an anubandha

it denotes the continuous sequence of sounds in the intervalbetween the sound and the anubandha

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 9: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Pratyaharas

1. a i u N.2. r. l. K3. e o N4. ai au C5. h y v r T.

iK= 〈i, u, r. , l.〉

a pratyahara is a pair of a sound and an anubandha

it denotes the continuous sequence of sounds in the intervalbetween the sound and the anubandha

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 10: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Phonological Rules

modern notation

A is replaced by B if preceded by C and succeeded by D.

A → B/C D

example: final devoicing

+ consonantal− nasal+ voiced

+ consonantal− nasal− voiced

/ ♯

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 11: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Phonological Rules

modern notation

A is replaced by B if preceded by C and succeeded by D.

A → B/C D

example: final devoicing

+ consonantal− nasal+ voiced

+ consonantal− nasal− voiced

/ ♯

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 12: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Phonological Rules

modern notation

A is replaced by B if preceded by C and succeeded by D.

A → B/C D

Pan. ini’s linear Coding

A + genitive, B + nominative, C + ablative, D + locative.

example

sutra 6.1.77: iko yan. aci ( I+.k+:ea ya;Na;�a;.ca )

analysis: [ik]gen[yan. ]nom[ac]loc

modern notation: [iK] → [yN. ]/ [aC]

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 13: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Phonological Rules

modern notation

A is replaced by B if preceded by C and succeeded by D.

A → B/C D

Pan. ini’s linear Coding

A + genitive, B + nominative, C + ablative, D + locative.

example

sutra 6.1.77: iko yan. aci ( I+.k+:ea ya;Na;�a;.ca )

analysis: [ik]gen[yan. ]nom[ac]loc

modern notation: [iK] → [yN. ]/ [aC]

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 14: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Analysis of iko yan.aci: [iK] → [yN. ]/ [aC]

1. a i u N.2. r. l. K3. e o N4. ai au C5. h y v r T.6. l N.

[iK] → [yN. ]/ [aC]

〈i, u, r. , l.〉 → 〈y, v, r, l〉/ 〈a, i, u, r. , l., e, o, ai, au〉

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 15: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Analysis of iko yan.aci: [iK] → [yN. ]/ [aC]

1. a i u N.2. r. l. K3. e o N4. ai au C5. h y v r T.6. l N.

[iK] → [yN. ]/ [aC]

〈i, u, r. , l.〉 → 〈y, v, r, l〉/ 〈a, i, u, r. , l., e, o, ai, au〉

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 16: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Analysis of iko yan.aci: [iK] → [yN. ]/ [aC]

1. a i u N.2. r. l. K3. e o N4. ai au C5. h y v r T.6. l N.

[iK] → [yN. ]/ [aC]

〈i, u, r. , l.〉 → 〈y, v, r, l〉/ 〈a, i, u, r. , l., e, o, ai, au〉

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 17: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Possible minimality criteria

total list:

a i u N. r. l. K e o N ai au C h y v r T. l N. ñ m n n. n M jh bh Ñ gh d.h dh S.j b g d. d Ś kh ph ch t.h th c t. t V k p Y ś s. s R h L

1 total list is of minimal length;2 sound list is of minimal length;3 anubandha list is of minimal length;4 total list is as short as possible while the anubandha list is

minimal;5 total list is as short as possible while the sound list is minimal;

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 18: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Possible minimality criteria

sound list:

a i u r. l. e o ai au h y v r l ñ m n n. n jh bh gh d.h dhj b g d. d kh ph ch t.h th c t. t k p ś s. s h

1 total list is of minimal length;2 sound list is of minimal length;3 anubandha list is of minimal length;4 total list is as short as possible while the anubandha list is

minimal;5 total list is as short as possible while the sound list is minimal;

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 19: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Possible minimality criteria

anubandha list:

N. K N C T. N. M Ñ S.Ś V Y R L

1 total list is of minimal length;2 sound list is of minimal length;3 anubandha list is of minimal length;4 total list is as short as possible while the anubandha list is

minimal;5 total list is as short as possible while the sound list is minimal;

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 20: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Possible minimality criteria

a i u N. r. l. K e o N ai au C h y v r T. l N. ñ m n n. n M jh bh Ñ gh d.h dh S.j b g d. d Ś kh ph ch t.h th c t. t V k p Y ś s. s R h L

1 total list is of minimal length;2 sound list is of minimal length;3 anubandha list is of minimal length;4 total list is as short as possible while the anubandha list is

minimal;5 total list is as short as possible while the sound list is minimal;

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 21: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Possible minimality criteria

a i u N. r. l. K e o N ai au C h y v r T. l N. ñ m n n. n M jh bh Ñ gh d.h dh S.j b g d. d Ś kh ph ch t.h th c t. t V k p Y ś s. s R h L

1 total list is of minimal length;2 sound list is of minimal length;3 anubandha list is of minimal length;4 total list is as short as possible while the anubandha list is

minimal;5 total list is as short as possible while the sound list is minimal;

⇒ duplicating sounds is worse than adding anubandhas

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 22: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Principle of economy

Staal 1962

Another general principle is also implicitly used by Pan. ini.This is the famous economy criterion [. . . ] In accordancewith this principle each linguistic rule should be given in theshortest possible form, whereas the number of metalinguisticsymbols should be reduced as far as possible.

⇒ 5. criterion of minimality: total list is as short as possible whilethe sound list is minimal

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 23: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Example: semi-formal argument

Kiparsky 1991

The reasoning from economy goes like this. To be groupedtogether in a pratyahara, sounds must make up a continuoussegment of the list. Economy requires making the list asshort as possible, which means avoiding repetitions ofsounds, and using as few markers as possible.Consequently, if class A properly includes class B, theelements shared with B should be listed last in A; the markerthat follows can then be used to form pratyaharas for bothA and B. In this way the economy principle, by selecting theshortest grammar, determines both the ordering of soundsand the placement of markers among them.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 24: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Example: semi-formal argument

Kiparsky 1991

The reasoning from economy goes like this. To be groupedtogether in a pratyahara, sounds must make up a continuoussegment of the list. Economy requires making the list asshort as possible, which means avoiding repetitions ofsounds, and using as few markers as possible.Consequently, if class A properly includes class B, theelements shared with B should be listed last in A; the markerthat follows can then be used to form pratyaharas for bothA and B. In this way the economy principle, by selecting theshortest grammar, determines both the ordering of soundsand the placement of markers among them.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 25: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Example: semi-formal argument

Śivasutras:

a i u N. r. l. K e o N ai au C h y v r T. l N. ñ m n n. n M jh bh Ñ gh d.h dh S.j b g d. d Ś kh ph ch t.h th c t. t V k p Y ś s. s R h L

aK = {a, i, u, r., l.}, iK = {i, u, r., l.} and uK = {u, r., l.} ⇒ a < i < u < r.,l.but:jhL ={h, s, s. , ś, p, k, t, t., c, th, t.h, ch, ph, kh, d, d. , g, b, j, dh, d. h, gh, bh, jh}jhR ={s, s. , ś, p, k, t, t. , c, th, t.h, ch, ph, kh, d, d. , g, b, j, dh, d. h, gh, bh, jh}jhY = {p, k, t, t. , c, th, t.h, ch, ph, kh, d, d. , g, b, j, dh, d. h, gh, bh, jh}jhŚ = {d, d. , g, b, j, dh, d. h, gh, bh, jh} andjhS. = {dh, d. h, gh, bh, jh}⇒ h < s, s. , ś < p, k, t, t. , c, th, t.h, ch, ph, kh, d < d. , g, b, j <

dh, d. h, gh, bh, jh

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 26: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Example: semi-formal argument

Śivasutras:

a i u N. r. l. K e o N ai au C h y v r T. l N. ñ m n n. n M jh bh Ñ gh d.h dh S.j b g d. d Ś kh ph ch t.h th c t. t V k p Y ś s. s R h L

aK = {a, i, u, r., l.}, iK = {i, u, r., l.} and uK = {u, r., l.} ⇒ a < i < u < r.,l.but:jhL ={h, s, s. , ś, p, k, t, t., c, th, t.h, ch, ph, kh, d, d. , g, b, j, dh, d. h, gh, bh, jh}jhR ={s, s. , ś, p, k, t, t. , c, th, t.h, ch, ph, kh, d, d. , g, b, j, dh, d. h, gh, bh, jh}jhY = {p, k, t, t. , c, th, t.h, ch, ph, kh, d, d. , g, b, j, dh, d. h, gh, bh, jh}jhŚ = {d, d. , g, b, j, dh, d. h, gh, bh, jh} andjhS. = {dh, d. h, gh, bh, jh}⇒ h < s, s. , ś < p, k, t, t. , c, th, t.h, ch, ph, kh, d < d. , g, b, j <

dh, d. h, gh, bh, jh

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 27: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Are Pan. ini’sŚivasutrasminimal?

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 28: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Are Pan. ini’sŚivasutrasminimal?

is it necessary toduplicate a

sound?

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 29: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Are Pan. ini’sŚivasutrasminimal?

is it necessary toduplicate a

sound?

is it the bestchoice to

duplicate ’h’?

Śivasutras arenot minimal

no yes

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 30: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Are Pan. ini’sŚivasutrasminimal?

is it necessary toduplicate a

sound?

is it the bestchoice to

duplicate ’h’?

given theduplication of ’h’,is the number of

anubandhasminimal?

Śivasutras arenot minimal

no

no

yes

yes

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 31: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Are Pan. ini’sŚivasutrasminimal?

is it necessary toduplicate a

sound?

is it the bestchoice to

duplicate ’h’?

given theduplication of ’h’,is the number of

anubandhasminimal?

Śivasutras arenot minimal

Śivasutras areminimal

no

no

no

yes

yes

yes

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 32: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Terminology: S-encodability

set of classes (A,Φ): A = {a, b, c, d , e, f , g , h, i}

Φ = {{d , e}, {a, b}, {b, c, d , f , g , h, i}, {f , i},{c, d , e, f , g , h, i}, {g , h}}

S-Alphabet (A, Σ,

set of sounds

set of markers

total order on A ·∪Σ

<) of (A,Φ): a b M1 c g h M2 f i M3 d M4 e M5

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 33: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Terminology: S-encodability

set of classes (A,Φ): A = {a, b, c, d , e, f , g , h, i}

Φ = {{d , e}, {a, b}, {b, c, d , f , g , h, i}, {f , i},{c, d , e, f , g , h, i}, {g , h}}

S-Alphabet (A, Σ,

set of sounds

set of markers

total order on A ·∪Σ

<) of (A,Φ): a b M1 c g h M2 f i M3 d M4 e M5

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 34: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Terminology: S-encodability

set of classes (A,Φ): A = {a, b, c, d , e, f , g , h, i}

Φ = {{d , e}, {a, b}, {b, c, d , f , g , h, i}, {f , i},{c, d , e, f , g , h, i}, {g , h}}

S-Alphabet (A, Σ,

set of sounds

set of markers

total order on A ·∪Σ

<) of (A,Φ): a b M1 c g h M2 f i M3 d M4 e M5

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 35: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Terminology: S-encodability

set of classes (A,Φ): A = {a, b, c, d , e, f , g , h, i}

Φ = {{d , e}, {a, b}, {b, c, d , f , g , h, i}, {f , i},{c, d , e, f , g , h, i}, {g , h}}

S-Alphabet (A, Σ,

set of sounds

set of markers

total order on A ·∪Σ

<) of (A,Φ): a b M1 c g h M2 f i M3 d M4 e M5

⇒ (A,Φ) is S-encodable without duplications

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 36: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Terminology: S-encodability

set of classes (A,Φ): A = {a, b, c, d , e, f , g , h, i}

Φ = {{d , e}, {a, b}, {b, c, d , f , g , h, i}, {f , i},{c, d , e, f , g , h, i}, {g , h}}

e

d

c

if

hg

b

a

{d , e}

{d}

{c, d , f , g , h, i}

{f , i} {g , h}

{b}

{a, b}

{ }

{a, b, c, d , e, f , g , h, i}

{c, d , e, f , g , h, i} {b, c, d , f , g , h, i}

concept lattice of (A, Φ)

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 37: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Terminology: S-encodability

set of classes (A,Φ): A = {a, b, c, d , e, f , g , h, i}

Φ = {{d , e}, {a, b}, {b, c, d , f , g , h, i}, {f , i},{c, d , e, f , g , h, i}, {g , h}}

e

d

c

if

hg

b

a

concept lattice of (A, Φ)

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 38: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Generalized task

Given the sound classes which are denoted by pratyaharas inPan. ini’s grammar, do the Śivasutras fulfill the 5th minimalitycriterion?

Does an S-alphabet which fulfills the 5th minimality criterionexists for any arbitrary set of classes and how can it beconstructed?

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 39: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Generalized task

Given the sound classes which are denoted by pratyaharas inPan. ini’s grammar, do the Śivasutras fulfill the 5th minimalitycriterion?

Does an S-alphabet which fulfills the 5th minimality criterionexists for any arbitrary set of classes and how can it beconstructed?

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 40: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Generalized task

Given the sound classes which are denoted by pratyaharas inPan. ini’s grammar, do the Śivasutras fulfill the 5th minimalitycriterion?

Does an S-alphabet which fulfills the 5th minimality criterionexists for any arbitrary set of classes and how can it beconstructed?

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 41: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-encodability ⇒ planarity

Main theorem on S-encodability (part 1)

The concept lattice of (A, Φ) is planar if (A, Φ) is S-encodablewithout duplications

e

d

c

if

hg

b

a

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 42: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-encodability ⇒ planarity

Main theorem on S-encodability (part 1)

The concept lattice of (A, Φ) is planar if (A, Φ) is S-encodablewithout duplications

e

d

c

if

hg

b

a

graph of the concept lattice of Pan. ini’s

pratyaharasOn the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 43: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Non-S-encodability of Pan. ini’s pratyaharas

Criterion of Kuratowski

A graph which has the graph as a minor is not planar.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 44: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Non-S-encodability of Pan. ini’s pratyaharas

Criterion of Kuratowski

A graph which has the graph as a minor is not planar.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 45: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Non-S-encodability of Pan. ini’s pratyaharas

Criterion of Kuratowski

A graph which has the graph as a minor is not planar.

×

××

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 46: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Non-S-encodability of Pan. ini’s pratyaharas

Criterion of Kuratowski

A graph which has the graph as a minor is not planar.

×

×

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 47: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Non-S-encodability of Pan. ini’s pratyaharas

Criterion of Kuratowski

A graph which has the graph as a minor is not planar.

×

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 48: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Non-S-encodability of Pan. ini’s pratyaharas

Criterion of Kuratowski

A graph which has the graph as a minor is not planar.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 49: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Non-S-encodability of Pan. ini’s pratyaharas

Criterion of Kuratowski

A graph which has the graph as a minor is not planar.

The set of classes given by Pan. ini’s pratyaharas is not S-encodable withoutduplications!

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 50: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Are Pan. ini’sŚivasutrasminimal?

is it necessary toduplicate a

sound?

is it the bestchoice to

duplicate ’h’?

yes

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 51: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Are Pan. ini’sŚivasutrasminimal?

is it necessary toduplicate a

sound?

is it the bestchoice to

duplicate ’h’?

given theduplication of ’h’,is the number of

anubandhasminimal?

yes

yes

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 52: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a labeled node isreached, add the labelsin arbitrary order tothe sequence, unless ithas been added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 53: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a labeled node isreached, add the labelsin arbitrary order tothe sequence, unless ithas been added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 54: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 55: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

e

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 56: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

ee

e

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 57: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

e

dd

ed

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 58: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

e

d

•cc

edM1c

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 59: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

e

d

•c

if

c

if

edM1cfi

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 60: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

e

d

•c

if

c

edM1cfiM2

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 61: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

e

d

•c

if

c

hghg

c

edM1cfiM2gh

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 62: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

e

d

•c

if

c

hg

c•

edM1cfiM2ghM3

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 63: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

e

d

•c

if

c

hg

c• bb

edM1cfiM2ghM3b

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 64: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

e

d

•c

if

c

hg

c• b

• aa

edM1cfiM2ghM3bM4a

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 65: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

S-alphabets with a minimal number of markers

e

d

c

if

hg

b

a

e

d

•c

if

c

hg

c• b

• a

edM1cfiM2ghM3bM4aM5

procedure

Start with the emptysequence and choose a walkthrough the S-graph:

While moving upwardsdo nothing.

While movingdownwards along anedge add a new markerto the sequence unlessits last element isalready a marker.

If a sound is reached,add the sound to thesequence, unless it hasbeen added before.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 66: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Enlarged concept lattice of Pan. ini’s pratyaharas

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 67: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Enlarged concept lattice of Pan. ini’s pratyaharas

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 68: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Enlarged concept lattice of Pan. ini’s pratyaharas

With the Śivasutras Pan. ini has chosen one out of nearly 12million S-alphabets which fulfill the 5th minimality criterion!

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 69: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Are Pan. ini’sŚivasutrasminimal?

is it necessary toduplicate a

sound?

is it the bestchoice to

duplicate ’h’?

given theduplication of ’h’,is the number of

anubandhasminimal?

Śivasutras areminimal

yes

yes

yes

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 70: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

The Problem:Sometimes we are forced to orderthings (nearly) linearly,e. g. in . . .

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 71: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Libraries

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 72: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

WarehousesOn the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 73: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Stores

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 74: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Solution to the problem: revitalize Pan. ini’s Śivasutra technique

Pan. ini’s Śivasutra technique

A;I+.o+.N,a Á �+.�+.k, Á O;A:ea;z, Á Oe;A:Ea;.c,a Á h;ya;va:=+f, Ál+.N,a Á Va;ma;z+.Na;na;m,a Á Ja;Ba;V,a Á ;Ga;Q+Da;S,a Á .ja;ba;ga;q+.d;Z,a ÁKa;P+.C+.F+.Ta;.ca;f;ta;v,a Á k+:pa;y,a Á Za;Sa;sa:=, Á h;l, Á

a.i.un. | r. .l.k | e.on | ai.auc | hayavarat. |

lan. | namanan. anam | jhabhan | ghad. hadhas. | jabagad. adas |

khaphachat.hathacat.atav | kapay | sas.asar | hal |

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 75: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Transfer

For physical objects ‚duplicating‘ means ‚adding copies‘

Adding copies is annoying but often not impossibleOrdering objects in an S-order may

improve user-friendlinesssave timesave spacesimplify visual representations of classifications

tree S-sortable general hierarchy

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 76: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Transfer

For physical objects ‚duplicating‘ means ‚adding copies‘

Adding copies is annoying but often not impossibleOrdering objects in an S-order may

improve user-friendlinesssave timesave spacesimplify visual representations of classifications

tree S-sortable general hierarchy

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 77: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Transfer

For physical objects ‚duplicating‘ means ‚adding copies‘

Adding copies is annoying but often not impossibleOrdering objects in an S-order may

improve user-friendlinesssave timesave spacesimplify visual representations of classifications

tree S-sortable general hierarchy

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 78: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Transfer

Objects in libraries, ware-houses, and stores are only nearly linearlyarranged:

⇒ Second (and third) dimension can be used in order to avoidduplications

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 79: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Main theorem of S-sortability

Main theorem on S-encodability

A set of classes (A,Φ) is S-encodablewithout duplications if one of thefollowing equivalent statements istrue:

1 The concept lattice of (A,Φ) isa Hasse-planar graph and for anya ∈ A there is a node labeled ain the S-graph.

2 The concept lattice of theenlarged set of classes (A, Φ) isHasse-planar. (Φ = Φ ∪ {{a}

a ∈ A})

3 The Ferrers-graph of theenlarged (A, Φ)-context isbipartite.

Example: S-sortable

e

d

c

if

hg

b

a

Example: not S-sortable

d

c

b

e f a

{{d , e}, {a, b}, {b, c, d}, {b, c, d , f }}

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 80: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Main theorem of S-sortability

Main theorem on S-encodability

A set of classes (A,Φ) is S-encodablewithout duplications if one of thefollowing equivalent statements istrue:

1 The concept lattice of (A,Φ) isa Hasse-planar graph and for anya ∈ A there is a node labeled ain the S-graph.

2 The concept lattice of theenlarged set of classes (A, Φ) isHasse-planar. (Φ = Φ ∪ {{a}

a ∈ A})

3 The Ferrers-graph of theenlarged (A, Φ)-context isbipartite.

Example: S-sortable

e

d

c

if

hg

b

a

Example: not S-sortable

d

c

b

e f a

{{d , e}, {a, b}, {b, c, d}, {b, c, d , f }}

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 81: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Main theorem of S-sortability

Main theorem on S-encodability

A set of classes (A,Φ) is S-encodablewithout duplications if one of thefollowing equivalent statements istrue:

1 The concept lattice of (A,Φ) isa Hasse-planar graph and for anya ∈ A there is a node labeled ain the S-graph.

2 The concept lattice of theenlarged set of classes (A, Φ) isHasse-planar. (Φ = Φ ∪ {{a}

a ∈ A})

3 The Ferrers-graph of theenlarged (A, Φ)-context isbipartite.

Example: S-sortable

e

d

c

if

hg

b

a

e

dc i f h g

b

a

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 82: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Main theorem of S-sortability

Main theorem on S-encodability

A set of classes (A,Φ) is S-encodablewithout duplications if one of thefollowing equivalent statements istrue:

1 The concept lattice of (A,Φ) isa Hasse-planar graph and for anya ∈ A there is a node labeled ain the S-graph.

2 The concept lattice of theenlarged set of classes (A, Φ) isHasse-planar. (Φ = Φ ∪ {{a}

a ∈ A})

3 The Ferrers-graph of theenlarged (A, Φ)-context isbipartite.

Example: not S-sortable

d

c

b

e f a

d c b

e fa

{{d , e}, {a, b}, {b, c, d}, {b, c, d , f }}

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 83: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Main theorem of S-sortability

Main theorem on S-encodability

A set of classes (A,Φ) is S-encodablewithout duplications if one of thefollowing equivalent statements istrue:

1 The concept lattice of (A,Φ) isa Hasse-planar graph and for anya ∈ A there is a node labeled ain the S-graph.

2 The concept lattice of theenlarged set of classes (A, Φ) isHasse-planar. (Φ = Φ ∪ {{a}

a ∈ A})

3 The Ferrers-graph of theenlarged (A, Φ)-context isbipartite.

Advantages:

The Ferrers-graph is constructedon the formal context.

Its bipartity can be checkedalgorithmically.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 84: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

The story is much more intricate

We have not shown that Pan. ini’s technique for the representationof sound classes is optimal.

Even we have not shown that he used his technique in an optimalway.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 85: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

The story is much more intricate

We have not shown that Pan. ini’s technique for the representationof sound classes is optimal.

Even we have not shown that he used his technique in an optimalway.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 86: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Literature

Kiparsky, P. (1991), Economy and the construction of the Śivasutras. In:M. M. Deshpande & S. Bhate (eds.), Pan. inian Studies, Michigan: Ann Arbor.

Petersen, W. (2008), Zur Minimalität von Pan. inis Śivasutras – EineUntersuchung mit Mitteln der Formalen Begriffsanalyse. PhD thesis,university of Düsseldorf.

Petersen, W. (2009), On the Construction of Sivasutra-Alphabets. In: A.Kulkarni and G. Huet (eds.): Sanskrit Computational Linguistics. LNCS 5406,Springer.

Staal, F. (1962), A Method of Linguistic Description. Language 38, 1-10.

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen

Page 87: On the minimality of Panini's Sivasutras

Pan. ini’s Śivasutras Task Generalization Results Application Summary

Origin of Pictures

libraries (left):http://www.meduniwien.ac.at/medizinischepsychologie/bibliothek.htm

libraries (middle): http://www.math-nat.de/aktuelles/allgemein.htm

libraries (right):http://www.geschichte.mpg.de/deutsch/bibliothek.html

warehouses:http://www.metrogroup.de/servlet/PB/menu/1114920_l1/index.html

stores: http://www.einkaufsparadies-schmidt.de/01bilder01/

On the minimality of Pan. ini’s Śivasutras Wiebke Petersen