A Rule-based Dependency Parser for Telugu: An Experiment with Simple Sentences

Autor:	Sangeetha P, Parameswari K, Amba Kulkarni
Rok vydání:	2021
Předmět:	Computer science business.industry Rule-based system computer.software_genre Telugu language.human_language TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Simple (abstract algebra) Dependency grammar language Artificial intelligence business computer Natural language processing
Zdroj:	Translation Today. 15
ISSN:	0972-8090 0972-8740
DOI:	10.46623/tt/2021.15.1.ar5
Popis:	This paper is an attempt in building a rule-based dependency parser for Telugu which can parse simple sentences. This study adopts Pāṇini’s Grammatical (PG) tradition i.e., the dependency model to parse sentences. A detailed description of mapping semantic relations to vibhaktis (case suffixes and postpositions) in Telugu using PG is presented. The paper describes the algorithm and the linguistic knowledge employed while developing the parser. The research further provides results, which suggest that enriching the current parser with linguistic inputs can increase the accuracy and tackle ambiguity better than existing data-driven methods.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::16ddc0783401f570bb5303cfcb054f83 https://doi.org/10.46623/tt/2021.15.1.ar5 Zobrazit plný text záznamu