(Enter summary)
Abstract: There is a need to develop a suitable computational
grammar formalism for free word order languages
for two reasons: First, a suitably designed formalism
is likely to be more efficient. Second, such a
formalism is also likely to be linguistically more elegant
and satisfying. In this paper, we describe such
a formalism, called the Paninian framework, that
has been successfully applied to Indian languages. (Update)
Similar documents based on text: More All
0.7: Pragmatics versus Purism - taking the best of both worlds - Pedersen, Purchase (1999)
(Correct)
0.5: Natural Language Processing: A Paninian Perspective - Akshar Bharati Vineet (1996)
(Correct)
0.2: Integrating "Free" Word Order Syntax and Information Structure - Dept (1995)
(Correct)
BibTeX entry: (Update)
@inproceedings{ bharati93parsing,
author = "Akshar Bharati and Rajeev Sangal",
title = "Parsing Free Word Order Languages in the Paninian Framework",
booktitle = "Meeting of the Association for Computational Linguistics",
pages = "105-111",
year = "1993",
url = "citeseer.ist.psu.edu/584884.html" }
Citations not processed or no citations identified.
Documents on the same site (http://acl.ldc.upenn.edu/P/P93/): More
Part-Of-Speech Induction From Scratch - Schütze (1993)
(Correct)
Towards The Automatic Identification Of Adjectival.. - Vasileios.. (1993)
(Correct)
On The Decidability Of Functional Uncertainty - Backofen (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC