A computational algebraic analysis of Hindi syntax
From MaRDI portal
Publication:6190084
DOI10.1007/S10849-023-09404-2OpenAlexW4388593538MaRDI QIDQ6190084FDOQ6190084
Authors: Alok Debanth, Manish Shrivastava 
Publication date: 6 February 2024
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10849-023-09404-2
Cites Work
- From word to sentence. A computational algebraic approach to grammar
- Title not available (Why is that?)
- Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
- Toward discourse representation via pregroup grammars
- Title not available (Why is that?)
- Pregroups and natural language processing
- A tale of four grammars
- Type grammars as pregroups
- Logical Aspects of Computational Linguistics
- Pregroup grammars and Chomsky's earliest examples
- Efficiency of pregroups and the French noun phrase
- Word order alternation in Sanskrit via precyclicity in pregroup grammars
- Extended pregroup grammars applied to natural languages
- Applying pregroups to Italian statements and questions
- On the logic of \(\beta\)-pregroups
- Clitic movement in pregroup grammar: a cross-linguistic approach
- An adventure into Hungarian word order with cyclic pregroups
- Agreement and cliticization in Italian: a pregroup analysis
This page was built for publication: A computational algebraic analysis of Hindi syntax
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190084)
