A formal approach for measuring the lexical ambiguity degree in natural language requirement specification: Polysemes and Homonyms focused

Author(s):  
Carlos Huertas ◽  
Manuel Gomez-Ruelas ◽  
Reyes Juarez-Ramirez ◽  
Hector Plata
2015 ◽  
Vol 42 (1) ◽  
pp. 67-78
Author(s):  
Halina Święczkowska

Abstract This article is an attempt to recreate the intuitions which accompanied Leśniewski when he was creating his calculus of names called Ontology. Although every reconstruction is to some extent an interpretation, and as such may be defective, still, there are reasons justifying such reconstruction. The most important justification is the fact that both Leśniewski and his commentators stressed that ontology originated from reflections about ordinary language, in which sentences such as A is B appear in one of the meanings associated with them in Ontology, and that the users of the Polish language use such sentences accordingly and properly identify them. Assumed it is so, let us try, based on Leśniewski’s guidelines as well as comments and elaborations on Ontology (Leśniewski 1992: 364-382, 608-609; Kotarbiński 1929: 227-229; Rickey 1977: 414-229; Simons 1992: 244; Lejewski 1960: 14-29), to evaluate the accuracy of this approach, referring also to certain knowledge of the Polish language. To make it clear, this article is not about Ontology as a formal theory of language. It is solely an attempt to assess whether some syntactical constructs of the Polish language and this language’s properties are significant conditions of a proper understanding of Ontology, and whether Ontology is, in fact, in a relationship with the ethnic language of its author.


Author(s):  
María Virginia Mauco ◽  
María Carmen Leonardi ◽  
Daniel Riesco

Formal methods have come into use for the construction of real systems as they help to increase software quality and reliability, and even though their industrial use is still limited, it has been steadily growing (Bowen & Hinchey, 2006; van Lamsweerde, 2000). When used early in the software development process, they can reveal ambiguities, incompleteness, inconsistencies, errors, or misunderstandings that otherwise might only be discovered during costly testing and debugging phases. A well-known formal method is the RAISE Method (George et al., 1995), which has been used on real developments (Dang Van, George, Janowski, & Moore, 2002). One tangible product of applying a formal method is a formal specification. A formal specification serves as a contract, a valuable piece of documentation, and a means of communication among stakeholders and software engineers. Formal specifications may be used throughout the software lifecycle and they may be manipulated by automated tools for a wide variety of purposes such as model checking, deductive verification, animation, test data generation, formal reuse of components, and refinement from specification to implementation (van Lamsweerde, 2000). However, one of the problems with formal specifications is that they are hard to master and not easily comprehensible to stakeholders, and even to non-formal specification specialists. This is particularly inconvenient during the first stages of system development when interaction with stakeholders is very important. In practice, the analysis often starts from interviews with the stakeholders, and this source of information is heavily based on natural language as stakeholders must be able to read and understand the results of requirements capture. Then specifications are never formal at first. A good formal approach should use both informal and formal techniques (Bjorner, 2000). The requirements baseline (Leite, Hadad, Doorn, & Kaplan, 2000), for example, is a technique proposed to formalize requirements elicitation and modeling, which includes two natural language models, the language extended lexicon (LEL) and the scenario model, which ease and encourage stakeholders’ active participation. However, specifying requirements in natural language has some drawbacks related to natural language imprecision. Based on the previous considerations, we proposed a technique to derive an initial formal specification in the RAISE specification language (RSL) from the LEL and the scenario model (Mauco, 2004; Mauco & Riesco, 2005a; Mauco, Riesco, & George, 2004). The technique provides a set of manual heuristics to derive types and functions and structure them in modules taking into account the structured description of requirements provided by the LEL and the scenario model. But, for systems of considerable size this manual derivation is very tedious and time consuming and may be error-prone. Besides, maintenance of consistency between LEL and scenarios, and the RSL specification is a critical problem as well as tracking of traceability relationships. In this article, we present an enhancement to this technique, which consists in the RSL-based formalization of some of the heuristics to derive RSL types from the LEL. The aim of this formalization is to serve as the basis for a semiautomatic strategy that could be implemented by a tool. More concretely, we describe a set of RSL-based derivation rules that will transform the information contained in the LEL into abstract and concrete RSL types. These derivation rules are a useful starting point to deal with the great amount of requirements information modeled in the LEL, as they provide a systematic and consistent way of defining a tentative set of RSL types. We also present some examples of the application of the rules and discuss advantages and disadvantages of the strategy proposed.


Computers ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 22
Author(s):  
Frederik Bäumer ◽  
Joschka Kersting ◽  
Michaela Geierhos

The vision of On-the-Fly (OTF) Computing is to compose and provide software services ad hoc, based on requirement descriptions in natural language. Since non-technical users write their software requirements themselves and in unrestricted natural language, deficits occur such as inaccuracy and incompleteness. These deficits are usually met by natural language processing methods, which have to face special challenges in OTF Computing because maximum automation is the goal. In this paper, we present current automatic approaches for solving inaccuracies and incompletenesses in natural language requirement descriptions and elaborate open challenges. In particular, we will discuss the necessity of domain-specific resources and show why, despite far-reaching automation, an intelligent and guided integration of end users into the compensation process is required. In this context, we present our idea of a chat bot that integrates users into the compensation process depending on the given circumstances.


2021 ◽  
Vol 8 (1) ◽  
pp. 21-37
Author(s):  
K. Mahalakshmi ◽  
Udayakumar Allimuthu ◽  
L Jayakumar ◽  
Ankur Dumka

The system's functional requirements (FR) and non-functional requirements (NFR) are derived from the software requirements specification (SRS). The requirement specification is challenging in classification process of FR and NFR requirements. To overcome these issues, the work contains various significant contributions towards SRS, such as green requirements engineering (GRE), to achieve the natural language processing, requirement specification, extraction, classification, requirement specification, feature selection, and testing the quality attributes improvement of NFRs. In addition to this, the test pad-based quality study to determine accuracy, quality, and condition providence to the classification of non-functional requirements (NFR) is also carried out. The resulted classification accuracy was implemented in the MATLAB R2014; the resulted graphical record shows the efficient non-functional requirements (NFR) classification with green requirements engineering (GRE) framework.


Author(s):  
Laura Felice ◽  
Carmen Leonardi ◽  
Liliana Favre ◽  
Maria Virginia Mauco

Reusability is the ability to use the same software elements for constructing many different applications. Formal specifications can help to semiautomatic design processes based on reusable components. However, during the first stages of development, when the interaction with the stakeholders is crucial, the use of client-oriented requirements engineering techniques seems to be necessary in order to enhance the communication between the stakeholders and the software engineers. In this chapter, we propose a systematic reuse approach that integrates natural language requirement specifications with formal specifications in RSL (RAISE Specification Language). On the one hand, some heuristics are described to develop a formal specification in RSL starting from models belonging to the Requirements Baseline. On the other hand, we have defined a reusable component model that integrates RSL specifications at different levels of abstraction, as well as presented a process with reuse based on the model.


2018 ◽  
Vol 22 (1) ◽  
pp. 59-85 ◽  
Author(s):  
Jonas R. B. Arenhart ◽  
Ederson S. Melo

Liar-like paradoxes are typically arguments that, by using very intuitive resources of natural language, end up in contradiction. Consistent solutions to those paradoxes usually have difficulties either because they restrict the expressive power of the language, or else because they fall prey to extended versions of the paradox. Dialetheists, like Graham Priest, propose that we should take the Liar at face value and accept the contradictory conclusion as true. A logical treatment of such contradictions is also put forward, with the Logic of Paradox (LP), which should account for the manifestations of the Liar. In this paper we shall argue that such a formal approach, as advanced by Priest, is unsatisfactory. In order to make contradictions acceptable, Priest has to distinguish between two kinds of contradictions, internal and external, corresponding, respectively, to the conclusions of the simple and of the extended Liar. Given that, we argue that while the natural interpretation of LP was intended to account for true and false sentences, dealing with internal contradictions, it lacks the resources to tame external contradictions. Also, the negation sign of LP is unable to represent internal contradictions adequately, precisely because of its allowance of sentences that may be true and false. As a result, the formal account suffers from severe limitations, which make it unable to represent the contradiction obtained in the conclusion of each of the paradoxes.


2011 ◽  
Vol 225-226 ◽  
pp. 776-779
Author(s):  
Shu Chen ◽  
Ming Kai Chen

Software engineering is a critical step in obtaining high quality production. However, requirement specifications that written in natural language is inevitably has ambiguity. Modern driven architecture makes use of requirement model for the complement of requirement specification to eliminate such ambiguity. However, currently, the transformation from requirement specification into formal model only limited in syntax level, thus lack of correctness and precision. This paper proposed an approach in semantical level to process textual specifications of the requirements of unlimited natural language and their automatic mapping to the formal presentation.


Sign in / Sign up

Export Citation Format

Share Document