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

Keywords

Related Articles

Automatic Building of a Semantic Model of Disease Symptoms Based on Text Corpus

The research described in the article refers to the study of data from the domain of medicine. The diagnostic test results are recorded in different ways. They may take the form of tables, graphs or images. Regardless of...

Multi-objective optimization of multidimensional aggregates schema

The most popular technology used to increase performance of large data warehouses is multidimensional aggregates computed from high-resolution data. Query-rewriting techniques allows significantly shorter user query res...

The analysis of selected properties of medical patterns cobweb models in the medical diagnosis support process

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...

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...

Model procesu pokonywania wielostrefowej ochrony obiektu stacjonarnego przez intruza

W artykule rozpatruje się model procesu pokonywania wielostrefowej ochrony obiektu stacjonarnego (zabudowania wraz z przyległym terenem) przez pasywnego intruza zdeterminowanego, co oznacza intruza nie oddziałującego czy...

Download PDF file
  • EP ID EP257804
  • DOI 10.5604/01.3001.0010.8236
  • Views 137
  • Downloads 0

How To Cite

Paweł Ryszawa (2017). Discovering grammar of an unknown text as an optimisation problem. Computer Science and Mathematical Modelling, 0(6), 15-22. https://europub.co.uk./articles/-A-257804