Validating Syntactic Correctness Using Unsupervised Clustering Algorithms
When developing a complex system in an open platform setting, users need to compose and maintain a systematic requirement specification. This paper proposes a solution to guarantee a syntactically accurate requirement specification that minimizes the ambiguity caused by ungrammatical sentences. Our...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-07-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/11/14/2113 |
| _version_ | 1797439857893572608 |
|---|---|
| author | Sanguk Noh Kihyun Chung Jaebock Shim |
| author_facet | Sanguk Noh Kihyun Chung Jaebock Shim |
| author_sort | Sanguk Noh |
| collection | DOAJ |
| description | When developing a complex system in an open platform setting, users need to compose and maintain a systematic requirement specification. This paper proposes a solution to guarantee a syntactically accurate requirement specification that minimizes the ambiguity caused by ungrammatical sentences. Our system has a set of standard jargon and templates that are used as a guideline to write grammatically correct sentences. Given a database of standard technical Korean (STK) templates, the system that we have designed and implemented divides a new sentence into a specific cluster. If the system finds an identical template in a cluster, it confirms the new sentence as a sound one. Otherwise, the system uses unsupervised clustering algorithms to return the template that most closely resembles the syntax of the inputted sentence. We tested our proposed system in the field of open platform development for a railway train. In the experiment, our system learned to partition templates into clusters while reducing null attributes of an instance using the autoencoding procedure. Given a set of clusters, the system was able to successfully recommend templates that were syntactically similar to the structure of the inputted sentence. Since the degree of similarity for 500 instances was <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>97.00</mn><mo>%</mo></mrow></semantics></math></inline-formula> on average, we conclude that our robust system can provide an appropriate template that users can use to modify their syntactically incorrect sentences. |
| first_indexed | 2024-03-09T11:59:47Z |
| format | Article |
| id | doaj.art-9c33a15796834410b13838554e59f1b0 |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-09T11:59:47Z |
| publishDate | 2022-07-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-9c33a15796834410b13838554e59f1b02023-11-30T23:05:36ZengMDPI AGElectronics2079-92922022-07-011114211310.3390/electronics11142113Validating Syntactic Correctness Using Unsupervised Clustering AlgorithmsSanguk Noh0Kihyun Chung1Jaebock Shim2School of Computer Science and Information Engineering, The Catholic University of Korea, Bucheon-si 14662, KoreaDivision of Electronics Engineering, Ajou University, Suwon 16499, KoreaDeltaindex, Inc., Yuseong-gu, Daejeon 34027, KoreaWhen developing a complex system in an open platform setting, users need to compose and maintain a systematic requirement specification. This paper proposes a solution to guarantee a syntactically accurate requirement specification that minimizes the ambiguity caused by ungrammatical sentences. Our system has a set of standard jargon and templates that are used as a guideline to write grammatically correct sentences. Given a database of standard technical Korean (STK) templates, the system that we have designed and implemented divides a new sentence into a specific cluster. If the system finds an identical template in a cluster, it confirms the new sentence as a sound one. Otherwise, the system uses unsupervised clustering algorithms to return the template that most closely resembles the syntax of the inputted sentence. We tested our proposed system in the field of open platform development for a railway train. In the experiment, our system learned to partition templates into clusters while reducing null attributes of an instance using the autoencoding procedure. Given a set of clusters, the system was able to successfully recommend templates that were syntactically similar to the structure of the inputted sentence. Since the degree of similarity for 500 instances was <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mn>97.00</mn><mo>%</mo></mrow></semantics></math></inline-formula> on average, we conclude that our robust system can provide an appropriate template that users can use to modify their syntactically incorrect sentences.https://www.mdpi.com/2079-9292/11/14/2113recommendation of syntactically correct sentenceunsupervised clustering algorithmsautoencoding proceduresoftware requirement specifications |
| spellingShingle | Sanguk Noh Kihyun Chung Jaebock Shim Validating Syntactic Correctness Using Unsupervised Clustering Algorithms Electronics recommendation of syntactically correct sentence unsupervised clustering algorithms autoencoding procedure software requirement specifications |
| title | Validating Syntactic Correctness Using Unsupervised Clustering Algorithms |
| title_full | Validating Syntactic Correctness Using Unsupervised Clustering Algorithms |
| title_fullStr | Validating Syntactic Correctness Using Unsupervised Clustering Algorithms |
| title_full_unstemmed | Validating Syntactic Correctness Using Unsupervised Clustering Algorithms |
| title_short | Validating Syntactic Correctness Using Unsupervised Clustering Algorithms |
| title_sort | validating syntactic correctness using unsupervised clustering algorithms |
| topic | recommendation of syntactically correct sentence unsupervised clustering algorithms autoencoding procedure software requirement specifications |
| url | https://www.mdpi.com/2079-9292/11/14/2113 |
| work_keys_str_mv | AT sanguknoh validatingsyntacticcorrectnessusingunsupervisedclusteringalgorithms AT kihyunchung validatingsyntacticcorrectnessusingunsupervisedclusteringalgorithms AT jaebockshim validatingsyntacticcorrectnessusingunsupervisedclusteringalgorithms |