An introduction to tag sequence grammars and the RASP system parser
نویسنده
چکیده
This report describes the tag sequence grammars released as part of the Robust Accurate Statistical Parsing (RASP) system. It is intended to help users of RASP understand the linguistic and engineering rationale behind the grammars and prepare them to customize the system for their application. It also contains a fairly exhaustive list of references to extant work utilizing the RASP parser.
منابع مشابه
Studying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملTuLiPA - Parsing Extensions of TAG with Range Concatenation Grammars
In this paper we present a parsing framework for extensions of Tree Adjoining Grammars (TAG) called TuLiPA (Tübingen Linguistic Parsing Architecture). In particular, besides TAG, the parser can process Tree-Tuple MCTAG with shared nodes (TT-MCTAG), a TAG-extension that has been proposed to deal with scrambling in free word order languages such as German. The central strategy of the parser is su...
متن کاملAnálisis ascendente bidireccional de TAG
We define a bidireccional bottom-up parser for Tree Adjoining Grammars (TAG). This parser is a mixture of a defined bidireccional bottom-up parser for TAG and a new parser for Tree Insertion Grammars (TIG) that we present here. We show that the new mixed parser for TAG presents a significative reduction of the theoretical complexity.
متن کاملAnálisis ascendente bidireccional de TAG dirigido por el núcleo TIG
We define a bidireccional bottom-up parser for Tree Adjoining Grammars (TAG). This parser is a mixture of a defined bidireccional bottom-up parser for TAG and a new parser for Tree Insertion Grammars (TIG) that we present here. We show that the new mixed parser for TAG presents a significative reduction of the theoretical complexity.
متن کاملParsing with Underspecifications
This paper describes a direct parser for Schema–Tree Adjoining Grammars (S–TAG) which explores schemata, i.e. underspecified elementary rules. Basically, a schema in a S–TAG represents a possibly infinite set of elementary rules by folding up all actual substructures and depicting them in terms of a regular expression (RX). Hence, S–TAGs provide a more condensed grammar representation. In the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006