A Lattice Framework for Analyzing Context-Free Languages with Applications in Parser Simplification and Data-Flow Analysis
نویسنده
چکیده
We propose a lattice framework for analyzing context-free grammars and contextfree languages. This framework is motivated by a technique for simplifying parsers with information derived from the associated scanners. We define the lattice framework and demonstrate it using additional applications, including data-flow analysis. Soundness and other properties of the lattice framework are also discussed.
منابع مشابه
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...
متن کاملFeature Engineering in Persian Dependency Parser
Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...
متن کاملParsing with Pictures
The development of elegant and practical algorithms for parsing context-free languages is one of the major accomplishments of 20 century Computer Science. These algorithms are presented in the literature using string rewriting systems or abstract machines like pushdown automata, but the resulting descriptions are unsatisfactory for several reasons. First, even a basic understanding of parsing a...
متن کاملAn FPGA-based syntactic parser for real-life unrestricted context-free grammars
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by real-life unrestricted context-free grammars (CFGs). More precisely, we study the advantages ooered by a hardware implementation of a parallel version of a chart parsing algorithm adapted for word lattice parsing with unrestricted CFGs. Natural Language Processing applications, for whi...
متن کاملAutomata-guided Context-free parsing for punctuationless languages
We propose a system for analyzing texts written in languages which don't make use of punctuation, with syntactic tagging in mind. The core system is a simple chart parser, but to cope with the complexity and ambiguity problems, we use simpliied nite-state automata, which guide the analysis. An application to Ancient Egyptian texts is introduced.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 15 شماره
صفحات -
تاریخ انتشار 1999