Solving grammar’s greatest puzzle

A grammatical problem which has defeated Sanskrit scholars since the 5^th Century BC has finally been solved by an Indian PhD student at the University of Cambridge.

Rishi Rajpopat (St John's College) made the breakthrough by decoding a rule taught by “the father of linguistics” Pāṇini.

The discovery makes it possible to 'derive' any Sanskrit word – to construct millions of grammatically correct words including ‘mantra’ and ‘guru’ – using Pāṇini’s revered ‘language machine’ which is widely considered to be one of the greatest intellectual achievements in history.

Leading Sanskrit experts have described Rajpopat’s discovery as ‘revolutionary’ and it could now mean that Pāṇini’s grammar can be taught to computers for the first time.

While researching for his PhD thesis, published on 15th December 2022, Dr Rajpopat decoded a 2,500 year old algorithm which makes it possible, for the first time, to accurately use Pāṇini’s ‘language machine’.

Pāṇini’s system – 4,000 rules detailed in his renowned work, the Aṣṭādhyāyī, which is thought to have been written around 500BC – is meant to work like a machine. Feed in the base and suffix of a word and it should turn them into grammatically correct words and sentences through a step-by-step process.

Until now, however, there has been a big problem. Often, two or more of Pāṇini’s rules are simultaneously applicable at the same step leaving scholars to agonise over which one to choose.

from Hacker News https://ift.tt/yqouH1K