Abstract:The present paper is a pilot study introducing a concept of computational biology -the closest string problem (CSP) -into linguistics. In quantitative studies, texts can be represented as sequences, and for any given set of sequences one can solve a CSP. The solution is called a consensus string (CS), which is a sequence that is "as close as possible to all the given strings". In this article we solve some CSP's resulting from the study of a Hungarian poem and illustrate possible interpretations.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.