Semiring Parsing
نویسنده
چکیده
decorations of parse forests usingdynamic programming and algebraicpower series. Theoretical Computer Science.To appear.Tendeau, Frédéric. 1997b. An Earleyalgorithm for generic attribute augmentedgrammars and applications. In Proceedingsof the International Workshop on ParsingTechnologies 1997, pages 199–209.Viterbi, Andrew J. 1967. Error bounds forconvolutional codes and an asymptoticallyoptimum decoding algorithm. IEEETransactions on Information Theory,IT-13:260–267.
منابع مشابه
PhD Depth Examination Report Algebraic Foundation of Statistical Parsing Semiring Parsing
Statistical parsing algorithms are useful in structure predictions, ranging from NLP to biological sequence analysis. Currently, there are a variety of efficient parsing algorithms available for different grammar formalisms. Conventionally, different parsing descriptions are needed for different tasks; a fair amount of work is required to construct for each one. Semiring parsing is proposed to ...
متن کاملGrasp: Randomised Semiring Parsing
Wepresent a suite of algorithms for inference tasks over (finite and infinite) context-free sets. For generality and clarity, we have chosen the framework of semiring parsingwith support to the most common semirings (e.g. F, V, k- and I). We see parsing from themore general viewpoint of weighted deduction allowing for arbitrary weighted finite-state input and provide impleme...
متن کاملStatistical Machine Translation by Generalized Parsing
Designers of statistical machine translation (SMT) systems have begun to employ tree-structured translation models. Systems involving tree-structured translation models tend to be complex. This article aims to reduce the conceptual complexity of such systems, in order to make them easier to design, implement, debug, use, study, understand, explain, modify, and improve. In service of this goal, ...
متن کاملGeneralized Parsers for Machine Translation
Designers of statistical machine translation (SMT) systems have begun to employ treestructured translation models. Systems involving tree-structured translation models tend to be complex. This article aims to reduce the conceptual complexity of such systems, in order to make them easier to design, implement, debug, use, study, understand, explain, modify, and improve. In service of this goal, t...
متن کاملTranslation as Weighted Deduction
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise to clean analyses and compact descriptions that can serve as the basis for modular implementations. We illustrate this with several examples, showing how to build search spaces for several disparate phrase-based searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational Linguistics
دوره 25 شماره
صفحات -
تاریخ انتشار 1999