EUVIMEDEUVIMED entdecken
Crossref

Discovering grammar of an unknown text as an optimisation problem

Paweł Ryszawa

Computer Science and Mathematical Modelling · 2018

DOI: 10.5604/01.3001.0010.8236 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computer Science and Mathematical Modelling, 2018. Verfasst von Paweł Ryszawa. Die Arbeit nennt 11 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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

Zitieren

APA

Ryszawa, P. (2018). Discovering grammar of an unknown text as an optimisation problem. Computer Science and Mathematical Modelling. https://doi.org/10.5604/01.3001.0010.8236

Vancouver

Ryszawa P. Discovering grammar of an unknown text as an optimisation problem. Computer Science and Mathematical Modelling. 2018. doi:10.5604/01.3001.0010.8236

BibTeX
@article{Ryszawa2018,
  author = {Ryszawa, Paweł},
  title = {Discovering grammar of an unknown text as an optimisation problem},
  journal = {Computer Science and Mathematical Modelling},
  year = {2018},
  doi = {10.5604/01.3001.0010.8236}
}
Kostenlos starten →