Quantum Natural Language Processing (QNLP) uses pregroup grammars to translate grammatical structure into diagrammatic representations and quantum circuits. Recent Hindi QNLP work has shown that Hindi-specific pregroup grammars can support grammar-sensitive compositional models, but grammatical type assignment is still largely manual, limiting scalability. This paper formulates automatic Hindi pregroup supertagging as a token-level classification task. Using a manually annotated corpus of 380 Hindi sentences, we evaluate lexical, contextual, prompting-based, lexical-repair, and suffix/morphology-aware methods. Results show that simple lexical and contextual models are strong in this low-resource setting: contextual backoff achieves the best completed accuracy of 64.56%, while raw Qwen2.5 prompting reaches only 11.65%. Lexical repair raises LLM-assisted prediction to 64.08%, demonstrating the value of constraining generative outputs with symbolic grammar knowledge. Diagnostic analysis further shows that seen and unambiguous tokens are much easier than unseen tokens, and suffix/morphology features improve karaka-token accuracy but not overall performance. These results show that automatic Hindi pregroup assignment is feasible and can reduce reliance on manual annotation in future multilingual QNLP pipelines.
Figures & tables
Figure 1: Pipeline for automatic Hindi pregroup supertagging.
System
Correct / 206
Exact acc. (%)
Sent. exact (%)
Notes
Global majority
33
16.02
0.00
Label prior only
Lexical majority
119
57.77
5.56
Word identity
Context word-next
127
61.65
11.11
Right context
Context previous-word
128
62.14
5.56
Left context
Context previous+word+next
130
63.11
8.33
Full local context
Contextual backoff
133
64.56
13.89
Best completed system
Table 1: Main results on the 36-sentence, 206-token test set.
Bonn-Aachen International Center for Information Technology (b-it) / CAISA Lab · Lamarr Institute for Machine Learning and Artificial Intelligence · Helmholtz-Institut für Strahlen- und Kernphysik +1