An Adaptive Earley Algorithm for LTAG Based Parsing

Sharafudheen K.A.; Rahul C.

Third International conference on advances in communication, network and computing

Research Article

An Adaptive Earley Algorithm for LTAG Based Parsing

Download

231 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-642-35615-5_60,
    author={Sharafudheen K.A. and Rahul C.},
    title={An Adaptive Earley Algorithm for LTAG Based Parsing},
    proceedings={Third International conference on advances in communication, network and computing},
    proceedings_a={CNC},
    year={2012},
    month={12},
    keywords={Adaptive NLP Parser Tree Adjunction Grammar LTAG Earley Algorithm for TAG},
    doi={10.1007/978-3-642-35615-5_60}
}

Sharafudheen K.A.
Rahul C.
Year: 2012
An Adaptive Earley Algorithm for LTAG Based Parsing
CNC
Springer
DOI: 10.1007/978-3-642-35615-5_60

Sharafudheen K.A.¹, Rahul C.¹

1: MES College of Engineering

Abstract

In traditional parsing methods Earley parsing is one of the best par ser implemented for both NLP and programming language requirements. Tree Adjoining Grammar is powerful than traditional CFG and suitable to represent complex structure of natural languages. An improved version LTAG has appropriate generative capacity and a strong linguistic foundation. Here we introduce a new algorithm that simply adopts Earley method in LTAG which results combined advantages of TAG and Earley Parsing.

Keywords: Adaptive NLP Parser Tree Adjunction Grammar LTAG Earley Algorithm for TAG

Published: 2012-12-04

: http://dx.doi.org/10.1007/978-3-642-35615-5_60