Towards Machine Mind Evolution

Kollár, Ján; Sicak, Michal; Spisiak, Milan

doi:10.15439/2015f210

Cited by 7 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Supercombinators are designated with the L symbol. Grammar operations are designated with the standard | symbol for alternative and + symbol for concatenation 3 . …”

Section: Transformation Of Context-free Grammars Into a Supercommentioning

confidence: 99%

See 1 more Smart Citation

Properties and Limits of Supercombinator Set Acquired from Context-free Grammar Samples

Sicak

Kollár

2017

Annals of Computer Science and Information Systems

Self Cite

View full text Add to dashboard Cite

Abstract-We present an improved version of algorithm that can transform any context-free grammar into a supercombinator form. Such a form is composed only of lambda calculus' supercombinators that are enriched by grammar operations. The main properties of this form are non-redundancy and scalability. We show the improvements that we've made to create smaller supercombinator set than in our previous algorithm's version. We present experiments performed on Context-free grammars obtained by transformation from Groningen meaning bank corpus. Experiments confirm that our form has a theoretical maximum limit of possible supercombinators. That limit is a mathematical sequence called Catalan number. We show that in some cases we are able to reach that limit if we use large enough input data source and we limit the size of supercombinator permitted into the final set. We also describe another benefit of our algorithm, which is the identification of most reoccurring structures in the input set.

show abstract

“…Supercombinators are designated with the L symbol. Grammar operations are designated with the standard | symbol for alternative and + symbol for concatenation 3 . …”

Section: Transformation Of Context-free Grammars Into a Supercommentioning

confidence: 99%

“…They argue that grammars are a strong formalism method that are already used in many areas of software engineering. We have presented in our work [3] a way to use grammars as a prime object of internal language incremental evolution.…”

Section: Introductionmentioning

confidence: 99%

Properties and Limits of Supercombinator Set Acquired from Context-free Grammar Samples

Sicak

Kollár

2017

Annals of Computer Science and Information Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…In that case we may view such a set as some network like structure. We explain this principle in further detail in [8] and [9], but also here, in the section III. Now, how our work relates to the natural language processing?…”

Section: Motivationmentioning

confidence: 99%

Supercombinator Set Construction from a Context-Free Representation of Text

Sicak

Kollár

2016

Annals of Computer Science and Information Systems

Self Cite

View full text Add to dashboard Cite

Abstract-Grammars might be used for various other aspects, than just to represent a language. Grammar inference is a large field which main goal is the construction of grammars from various sources. Written text might be analysed indirectly with the use of such inferred grammars. Grammars acquired from processed text might grow into large structures as the inference process could be continuous. We present a method to decompose and store grammars into a non-redundant set of lambda calculus supercombinators. Grammars decomposition is based on their structure and each distinct element is stored only once in such a structure. We present a method that can create such a set from any context-free grammar. To prove this and to show the possible applications in the field of natural language processing we present a case study performed on samples from two books. Those samples are the entire Book of Genesis from The King James Bible and the first 24 chapters of War and peace by Tolstoy. We obtain context-free grammars with the Sequitur algorithm and then we process them with our method. The results show significant decline in the number of grammar elements in all cases.

show abstract

“…We have modified the PMD Copy/Paste Detection (CPD) tool 2 to support copy/paste detection on JavaDoc documentation. The tool was fed preprocessed sources of several libraries and open source projects in Java and it analysed them to detect duplications in documentation that would indicate the potential …”

Section: Documentation Copy/paste Studymentioning

confidence: 99%

“…P RESERVING and comprehending developer's concerns (intents) in the source code is still a current challenge in software development [1], [2], [3], [4]. In this paper we analyze the internal documentation (source code comments, JavaDoc, etc.)…”

Section: Introductionmentioning

confidence: 99%

Preliminary Report on Empirical Study of Repeated Fragments in Internal Documentation

Nosal¹,

Porubãn²

2016

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-In this paper we present preliminary results of an empirical study, in which we used copy/paste detection (PMD CPD implementation) to search for repeating documentation fragments. The study was performed on 5 open source projects, including Java 8 SDK sources. The study shows that there are many occurrences of copy-pasting documentation fragments in the internal documentation, e.g., copy-pasted method parameter description. Besides these, many of the copy-pasted fragments express some domain or design concern, e.g., that the method is obsolete and deprecated. Therefore the study indicates that the cross-cutting concerns are present in the internal documentation in form of documentation phrases.

show abstract

Towards Machine Mind Evolution

Cited by 7 publications

References 12 publications

Properties and Limits of Supercombinator Set Acquired from Context-free Grammar Samples

Properties and Limits of Supercombinator Set Acquired from Context-free Grammar Samples

Supercombinator Set Construction from a Context-Free Representation of Text

Preliminary Report on Empirical Study of Repeated Fragments in Internal Documentation

Contact Info

Product

Resources

About