Discovering grammar of an unknown text as an optimisation problem
Journal Title: Computer Science and Mathematical Modelling - Year 2017, Vol 0, Issue 6
Abstract
This paper concerns the problem of discovering an unknown grammar from a text sample. The discovering methods are formulated as optimisation problems based on a binary representation of context-sensitive grammars. The representation starts with a longest possible vector of bits to, finally, make it more compact so as to be usable in practical applications. For the sake of simplicity, considered are only noncontracting (length preserving) grammars of order 2, excluding productions of the form P:A→B and those deriving the empty string, i.e P:A→ε.
Authors and Affiliations
Paweł Ryszawa
Mathematical aspects of ranking theory
Ensemble Methods for Improving Classification of Data Produced by Latent Dirichlet Allocation
Topic models are very popular methods of text analysis. The most popular algorithm for topic modelling is LDA (Latent Dirichlet Allocation). Recently, many new methods were proposed, that enable the usage of this model...
An AHP method to ERP system selection
An enterprise resource planning (ERP) is an enterprise-wide application software package that integrates all necessary business functions into a single system with a common database. In order to implement an ERP project...
Economical assigning weapons to targets
Some upper and lower bound are proposed to use in branch and bound method for solving Weapon-Target Assignment (WTA) problems. Analyze of WTA inspires to formulate another problem to economize the number of weapons unde...
Analiza wybranych własności modeli pajęczynowych wzorców medycznych w procesie wspomagania diagnozowania medycznego
W pracy przedstawiono możliwość zastosowania mechanizmów wnioskowania diagnostycznego wykorzystujących modele pajęczynowe zdefiniowane w wielokryterialnej przestrzeni danych medycznych pacjenta. Istotą rozpatrywanego pro...