English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Tree adjoining grammars (TAGs) provide an ample tool to capture syntax ofmany Indian languages. Tamil represents a special challenge to computationalformalisms as it has extensive agglutinative morphology and a comparativelydifficult argument structure. Modelling Tamil syntax and morphology using TAGis an interesting problem which has not been in focus even though TAGs are over4 decades old, since its inception. Our research with Tamil TAGs have shown usthat we can not only represent syntax of the language, but to an extent mineout semantics through dependency resolution of the sentence. But in order todemonstrate this phenomenal property, we need to parse Tamil language sentencesusing TAGs we have built and through parsing obtain a derivation we could useto resolve dependencies, thus proving the semantic property. We use an in-housedeveloped pseudo lexical TAG chart parser; algorithm given by Schabes and Joshi(1988), for generating derivations of sentences. We do not use any statisticsto rank out ambiguous derivations but rather use all of them to understand thementioned semantic relation with in TAGs for Tamil. We shall also present abrief parser analysis for the completeness of our discussions.

Dependency resolution and semantic mining using Tree Adjoining Grammars for Tamil Language