A Simple and Effective Dependency Parser for Telugu
We present a simple and effective dependency parser for Telugu, a morphologically rich, free word order language. We propose to replace the rich linguistic feature templates used in the past approaches with a minimal feature function using contextual vector representations. We train a BERT model on the Telugu Wikipedia data and use vector representations from this model to train the parser. Each sentence token is associated with a vector representing the token in the context of that sentence and the feature vectors are constructed by concatenating two token representations from the stack and one from the buffer. We put the feature representations through a feedforward network and train with a greedy transition based approach. The resulting parser has a very simple architecture with minimal feature engineering and achieves state-of-the-art results for Telugu.
Code (0)
등록된 구현이 없습니다.
Tasks
Feature EngineeringSentenceMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Fully Expanded Dependency Treebank for Telugu
Treebanks are an essential resource for syntactic parsing. The available Paninian dependency treebank(s) for Telugu is annotated only with inter-chunk dependency relations and not all words of a sentence are part of the …
SentenceParsing Subordinate Clauses in Telugu using Rule-based Dependency Parser
Parsing has been gaining popularity in recent years and attracted the interest of NLP researchers around the world. It is challenging when the language under study is a free-word order language that allows ellipsis like …
Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations
We present a simple and effective scheme for dependency parsing which is based on bidirectional-LSTMs (BiLSTMs). Each sentence token is associated with a BiLSTM vector representing the token in its sentential context, an…
Dependency ParsingSentenceBidirectional Transition-Based Dependency Parsing
Transition-based dependency parsing is a fast and effective approach for dependency parsing. Traditionally, a transitionbased dependency parser processes an input sentence and predicts a sequence of parsing actions in a …
Dependency ParsingSentenceTransition-Based Dependency ParsingLess is More? Towards a Reduced Inventory of Categories for Training a Parser for the Italian Stanford Dependencies
Stanford Dependencies (SD) represent nowadays a de facto standard as far as dependency annotation is concerned. The goal of this paper is to explore pros and cons of different strategies for generating SD annotated Itali…
TAG