• Speech Sciences
• /
• v.8 no.3
• /
• pp.105-113
• /
• 2001

The abbreviation (specially, an acronym) are used more nowadays. However we are using them carelessly unknowing that there are some reducing patterns. In this paper, we will first analyse the right oralization and the phonemicization of abbreviation on the basis of the group types. Then, we will propose necessary and sufficient conditions to recognize how to read or pronounce the acronyms and in which way, when they are converted from the text to the speech. We have limited the use of acronym to the graphem-phoneme relations, and the diversity of the usage to minimized, and therefore we could define clearly the characteristics of the phonetic chains. In conclusion, we could find that there are more phonemicization in producing acronyms with these phonetic chains characteristics, and these phonetic based acronyms are increasingly used in the field of aviation and medicine.

• Journal of Information Management
• /
• v.19 no.2
• /
• pp.55-90
• /
• 1988

The abbreviation of titles of periodicals was studied as a part of standardizations in bibliographic information inscription which were needed for dissemination of scientific and technological informations. The fundamental principles and the base draft were framed for the range of application, the titles of periodicals which should be abbreviated and the conditions and methods of abbreviation. The rules given in this base draft for abbreviation of titles are applicable to write out the secondary source and to describe the references.

• KIISE Transactions on Computing Practices
• /
• v.23 no.3
• /
• pp.183-187
• /
• 2017

Smart phone users prefer fast reading and texting. Hence, users frequently use abbreviated sequences of words and phrases. Nowadays, abbreviations are widely used from chat terms to technical terms. Therefore, gathering abbreviations would be helpful to many services, including information retrieval, recommendation system, and so on. However, manually gathering abbreviations needs to much effort and cost. This is because new abbreviations are continuously generated whenever a new material such as a TV program or a phenomenon is made. Thus it is required to generate of abbreviations automatically. To generate Korean abbreviations, the existing methods use the rule-based approach. The rule-based approach has limitations, in that it is unable to generate irregular abbreviations. Another problem is to decide the correct abbreviation among candidate abbreviations generated rules. To address the limitations, we propose a method of generating Korean abbreviations automatically using sequence-to-sequence learning in this paper. The sequence-to-sequence learning can generate irregular abbreviation and does not lead to the problem of deciding correct abbreviation among candidate abbreviations. Accordingly, it is suitable for generating Korean abbreviations. To evaluate the proposed method, we use dataset of two type. As experimental results, we prove that our method is effective for irregular abbreviations.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1409-1416
• /
• 2004

Recently, due to the popularity and explosive growth of the Internet, information exchange is increasing dramatically over the Internet. Also the XML is becoming a standard as well as a major tool of data exchange on the Internet. so that in retrieving the XML document. the problem for speeding up evaluation of path-oriented queries is a main issue. In this paper, we propose a new indexing technique to advance the searching performance of path-oriented queries in document databases. In the new indexing technique, an abbreviation-path file to perform path-oriented queries efficiently is generated which is able to use its hash-code value to index keys. Also this technique can be further enhanced by combining the Extendible Hashing technique with the abbreviation path file to expedite a speed up evaluation of retrieval.

• Journal of Digital Contents Society
• /
• v.2 no.2
• /
• pp.139-145
• /
• 2001

As e-commerce has been activated and internet has been used as usual, higher efficient search engine must be used to promote the value of information and take possession of the market place. all e-commerce user seller and buyer want to competitive goods Although these needs, search results are still much to be desired. In this paper, I will suppose two ideas which are abbreviation result and making blacklist. Abbreviation result is to hide results with common factors and making blacklist is to reduce null links of search results, which makes many useless results. This routine is made of making blacklist, check list, reduce list and append list.

• The Journal of Korean Physical Therapy
• /
• v.11 no.1
• /
• pp.143-147
• /
• 1999

This study was to provide model of SOAP Note, as a English and a Korean. English model was written with abbreviation. Abbreviations are und as a time and space saver while writing a notes. Acceptable abbreviations varies from one facility to the next, particularly terminology specific to allied health field such as physical therapy and occupational therapy. Based on the research results, the following consideration and guideline are presented. 1. Include the SOAP Note in curriculums of physical therapy. 2. The list of abbreviation have to approved between the Korea Hospital Association and the Korea Physical Therapy Association.

• Journal of Korean Society of Steel Construction
• /
• v.8 no.3 s.28
• /
• pp.117-125
• /
• 1996

The stress patterns of vertical stiffener of plate girder bridge were examined by existing data of actual measurement stress for steel bridges and the structural details of vertical stiffener of plate girder bridge having seeked rationalization and abbreviation were investigated by 1/2 bridge model. As the results, the out-of-plane stress occur in the upper parts of vertical stiffner and fatigue cracks by the action of alternative stress is apt to occur in web plate of lower parts vertical stiffener. Also, the gap between lower parts of vertical stiffner and lower flange of plate girder bridge seeking rationalization and abbreviation is effective to adopt 100mm.

• Journal of the Korea Society for Simulation
• /
• v.32 no.1
• /
• pp.35-44
• /
• 2023

In recent, there are many research cases that analyze trends or research trends with text analysis. When collecting documents by searching for keywords in abbreviations for data analysis, it is necessary to disambiguate abbreviations. In many studies, documents are classified by hand-work reading the data one by one to find the data necessary for the study. Most of the studies to disambiguate abbreviations are studies that clarify the meaning of words and use supervised learning. The previous method to disambiguate abbreviation is not suitable for classification studies of documents looking for research data from abbreviation search documents, and related studies are also insufficient. This paper proposes a method of semi-automatically classifying documents collected by abbreviations by going topic modeling with Non-Negative Matrix Factorization, an unsupervised learning method, in the data pre-processing step. To verify the proposed method, papers were collected from academic DB with the abbreviation 'MSA'. The proposed method found 316 papers related to Micro Services Architecture in 1,401 papers. The document classification accuracy of the proposed method was measured at 92.36%. It is expected that the proposed method can reduce the researcher's time and cost due to hand work.

• Korean Journal of Weed Science
• /
• v.30 no.3
• /
• pp.308-321
• /
• 2010

To increase of weed researches, abbreviations for Korean weeds name(tentatively named 'KSWS code', the Korean Society Weed Science code) of 433 species belonging to 68 families in arable land were suggested in this paper. The KSWS code was derived from Bayer code or/and modified. The KSWS code was composed of alphabetic 5 characters, namely 3 characters in generic name and 2 characters in specific name. And variable species's KSWS code was 1 characters in generic name and 1 characters in variable name.

• Journal of the Korean Mathematical Society
• /
• v.41 no.5
• /
• pp.883-894
• /
• 2004

We discuss in this paper the strong convergence for weighted sums of negative associated (in abbreviation: NA) arrays. Meanwhile, the central limit theorem for weighted sums of NA variables and linear process based on NA variables is also considered. As corollary, we get the results on iid of Li et al. ([10]) in NA setting.