A new TAG Formalism for Tamil and Parser Analytics

04/05/2016
by   Vijay Krishna Menon, et al.
0

Tree adjoining grammar (TAG) is specifically suited for morph rich and agglutinated languages like Tamil due to its psycho linguistic features and parse time dependency and morph resolution. Though TAG and LTAG formalisms have been known for about 3 decades, efforts on designing TAG Syntax for Tamil have not been entirely successful due to the complexity of its specification and the rich morphology of Tamil language. In this paper we present a minimalistic TAG for Tamil without much morphological considerations and also introduce a parser implementation with some obvious variations from the XTAG system

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

04/19/2017

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

Tree adjoining grammars (TAGs) provide an ample tool to capture syntax o...
04/18/2018

End-to-end Graph-based TAG Parsing with Neural Networks

We present a graph-based Tree Adjoining Grammar (TAG) parser that uses B...
05/16/2021

Infinitely growing configurations in Emil Post's tag system problem

Emil Post's tag system problem is the question of whether or not a tag s...
12/04/2019

A Low Computational Approach for Price Tag Recognition

In this work we discuss the task of search, localization and recognition...
08/16/2018

2DR: Towards Fine-Grained 2-D RFID Touch Sensing

In this paper, we introduce 2DR, a single RFID tag which can seamlessly ...
03/11/2021

After 100 Years, Can We Finally Crack Post's Problem of Tag? A Story of Computational Irreducibility, and More

Empirical, theoretical and historical aspects of Post's "problem of tag"...
10/01/2019

Specializing Word Embeddings (for Parsing) by Information Bottleneck

Pre-trained word embeddings like ELMo and BERT contain rich syntactic an...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.