Towards GP Sentence Parsing of V+P+CP/NP Structure

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards GP Sentence Parsing of V+P+CP/NP Structure

Computational linguistics can provide an effective perspective to explain the partial ambiguity during machine translation. The structure of V+Pron+CP/NP has the ambiguous potential to bring Garden Path effect. If Tell+Pron+NP structure has considerable higher observed frequencies than Tell+Pron+CP structure, the former is regarded as the preferred structure and has much lower confusion quotien...

متن کامل

Parsing Simplified Chinese and Traditional Chinese with Sentence Structure Grammar

We present a challenge to parse simplified Chinese and traditional Chinese with a same rule-based Chinese grammatical resource--Chinese Sentence Structure Grammar: CSSG, which was developed based on a new grammar formalism idea: Sentence Structure Grammar: SSG. We participate in the simplified Chinese parsing task and the traditional Chinese parsing task of CLP 2012 with a same rule-based chart...

متن کامل

Dependency parsing for Chinese long sentence: A second-stage main structure parsing method

This paper explores the problem of parsing Chinese long sentences. Inspired by human sentence processing, a second-stage parsing method, referred as main structure parsing in this paper, are proposed to improve the parsing performance as well as maintaining its high accuracy and efficiency on Chinese long sentences. Three different methods have attempted in this paper and the result shows that ...

متن کامل

Sentence Rewriting for Semantic Parsing

A major challenge of semantic parsing is the vocabulary mismatch problem between natural language and target ontology. In this paper, we propose a sentence rewriting based semantic parsing method, which can effectively resolve the mismatch problem by rewriting a sentence into a new form which has the same structure with its target logical form. Specifically, we propose two sentence-rewriting me...

متن کامل

Varieties of Heuristics in Sentence Parsing * Makoto

There are many methods of sentence parsing, but parsing always presupposes a grammar, which is usually composed of a set of so-called grammatical rules or rewriting rules. There are many grammars proposed so far, and many parsing algorithms have been developed based on these grammars. Characteristics of these parsing algorithms are a direct reflection of the features of the grammar formalisms u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Advanced Computer Science and Applications

سال: 2015

ISSN: 2156-5570,2158-107X

DOI: 10.14569/ijacsa.2015.060606