نتایج جستجو برای: language complexity

تعداد نتایج: 722746  

2010
Sanjay Misra Ferid Cafer

Software metrics determine the degree of maintainability of software products, which is one of the important factors that affect the quality of any kind of software. Furthermore, software metrics provide useful feedback to the designers to impact the decisions that are made during design, coding, architecture, or specification phases. Without such feedback, many decisions are made in ad hoc man...

2017
KENG SIAU QING CAO

Unified Modeling Language (UML) has emerged as the software industry’s dominant modeling language. It is the de facto modeling language standard for specifying, visualizing, constructing, and documenting the components of software systems. Despite its prominence and status as the standard modeling language, UML has its critics. Opponents argue that it is complex and difficult to learn. Some que...

Journal: :J. Comput. Syst. Sci. 1996
Sanjay Jain Arun Sharma

A new investigation of the complexity of language identification is undertaken using the notion of reduction from recursion theory and complexity theory. The approach, referred to as the intrinsic complexity of language identification, employs notions of ‘weak’ and ‘strong’ reduction between learnable classes of languages. The intrinsic complexity of several classes is considered and the result...

2010
Michal B. Paradowski

Linguistic creativity is a manifestation of innovativeness. Investigating the diffusion of linguistic innovation requires an interdisciplinary approach, pooling competences from sciences humanistic, social, and strict (in particular mathematics and computational methods). The initial results will be presented of an empirical project analysing the social spread of neologisms in a microblogging s...

Journal: :CoRR 2013
Diego R. Amancio Sandra M. Aluísio Osvaldo N. Oliveira Luciano da Fontoura Costa

Methods from statistical physics, such as those involving complex networks, have been increasingly used in quantitative analysis of linguistic phenomena. In this paper, we represented pieces of text with different levels of simplification in co-occurrence networks and found that topological regularity correlated negatively with textual complexity. Furthermore, in less complex texts the distance...

2014
Cedric Boeckx Evelina Leivada Pedro Tiago Martins

K e y w o r d s : complexity, environmentally-driven adaptation, language emergence Consideracions sobre llengua i complexitat: una perspectiva biolingüística R e s u m : La noció de complexitat es mostra recurrentment en el context de l’estudi de llengües. Des d’una perspectiva chomskyana o biolingüística, i atès el caràcter uniforme de l’adquisició del llenguatge, s’ha suposat que totes les l...

Journal: :Electron. Trans. Artif. Intell. 1997
Paolo Liberatore

In this paper we analyze the complexity of the language A pro posed in to formalize properties of actions We prove that the general language is NP complete thus intractable and show some tractable polynomial subclasses of it We also show how states that are unreachable a ect the semantics of the language

Journal: :Theor. Comput. Sci. 1998
François Blanchard Petr Kurka

Given a rotation of the circle, we study the complexity of formal languages that are generated by the itineraries of interval covers. These languages are regular iff the rotation is rational. In the case of irrational rotations, our study reduces to that of the language complexity of the corresponding Sturmian sequences. We show that for a large class of irrationals, including e, all quadratic ...

Journal: :CoRR 2016
R. R. Xie W. B. Deng D. J. Wang László Pál Csernai

We study the entropy of Chinese and English texts, based on characters in case of Chinese texts and based on words for both languages. Significant differences are found between the languages and between different personal styles of debating partners. The entropy analysis points in the direction of lower entropy, that is of higher complexity. Such a text analysis would be applied for individuals...

2002
James Rogers Philip Miller Geoffrey K. Pullum

This interesting and original work applies descriptive complexity theory to the study of natural languages. The first part of the book (64 pages) characterizes the strong generative capacity of context-free grammars in logical terms. The second part (122 pages) discusses the generative capacity of government and binding (GB) theories. The book deserves the close attention of computational lingu...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید