Chapter 1 m - Linear Context - Free Rewriting Systems as
نویسندگان
چکیده
This paper presents a coding of m-linear context-free rewriting systems (mLCFRS) into abstract categorial grammars (ACG). Thus, it shows the latter formalism, which offers a powerful grammatical framework based on a small set of computational primitives, is able to reach some interesting classes of languages w.r.t. natural language modeling.
منابع مشابه
Linear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
I n t r o d u c t i o n In [9] a comparison was made of the generative capacity of a number of grammar formalisms. Several were found to share a number of characteristics (described below) and the class of such formalisms was called linear context-free rewriting systems. This paper shows how the class of string languages generated by linear context-free rewriting systems relates to a number of ...
متن کاملParsing Linear-Context Free Rewriting Systems with Fast Matrix Multiplication
We describe a recognition algorithm for a subset of binary linear context-free rewriting systems (LCFRS) with running time O(nωd) where M(m) = O(m ) is the running time for m×m matrix multiplication and d is the “contact rank” of the LCFRS—the maximal number of combination and non-combination points that appear in the grammar rules. We also show that this algorithm can be used as a subroutine t...
متن کاملSynchronous Linear Context-Free Rewriting Systems for Machine Translation
We propose synchronous linear context-free rewriting systems as an extension to synchronous context-free grammars in which synchronized non-terminals span k ≥ 1 continuous blocks on each side of the bitext. Such discontinuous constituents are required for inducing certain alignment configurations that occur relatively frequently in manually annotated parallel corpora and that cannot be generate...
متن کاملOn the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms
We show how to encode context-free string grammars, linear contextfree tree grammars, and linear context-free rewriting systems as Abstract Categorial Grammars. These three encodings share the same constructs, the only difference being the interpretation of the composition of the production rules. It is interpreted as a first-order operation in the case of context-free string grammars, as a sec...
متن کاملEfficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively free word order. We present a chart-based parsing algorithm that asymptotically improves the known running time upper bound for this class of rewriting systems. Our result is obtained through a linear space construction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003