To see the other types of publications on this topic, follow the link: Edit metric.

Journal articles on the topic 'Edit metric'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Edit metric.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Li, Yujian, and Zhang Chenguang. "A metric normalization of tree edit distance." Frontiers of Computer Science in China 5, no. 1 (2011): 119–25. http://dx.doi.org/10.1007/s11704-011-9336-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rozinek, Ondřej, and Jan Mareš. "The Duality of Similarity and Metric Spaces." Applied Sciences 11, no. 4 (2021): 1910. http://dx.doi.org/10.3390/app11041910.

Full text
Abstract:
We introduce a new mathematical basis for similarity space. For the first time, we describe the relationship between distance and similarity from set theory. Then, we derive generally valid relations for the conversion between similarity and a metric and vice versa. We present a general solution for the normalization of a given similarity space or metric space. The derived solutions lead to many already used similarity and distance functions, and combine them into a unified theory. The Jaccard coefficient, Tanimoto coefficient, Steinhaus distance, Ruzicka similarity, Gaussian similarity, edit
APA, Harvard, Vancouver, ISO, and other styles
3

JIA, Nan, Xiao-dong FU, Yuan HUANG, Xiao-yan LIU, and Zhi-hua DAI. "Workflow distance metric based on tree edit distance." Journal of Computer Applications 32, no. 12 (2013): 3529–33. http://dx.doi.org/10.3724/sp.j.1087.2012.03529.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Serratosa, Francesc. "Graph edit distance: Restrictions to be a metric." Pattern Recognition 90 (June 2019): 250–56. http://dx.doi.org/10.1016/j.patcog.2019.01.043.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sidiropoulos, Panagiotis, Vasileios Mezaris, Ioannis Kompatsiaris, and Josef Kittler. "Differential Edit Distance: A Metric for Scene Segmentation Evaluation." IEEE Transactions on Circuits and Systems for Video Technology 22, no. 6 (2012): 904–14. http://dx.doi.org/10.1109/tcsvt.2011.2181231.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fang, Zhongxi, Jianming Huang, Xun Su, and Hiroyuki Kasai. "Wasserstein Graph Distance Based on L1–Approximated Tree Edit Distance between Weisfeiler–Lehman Subtrees." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 6 (2023): 7539–49. http://dx.doi.org/10.1609/aaai.v37i6.25916.

Full text
Abstract:
The Weisfeiler-Lehman (WL) test is a widely used algorithm in graph machine learning, including graph kernels, graph metrics, and graph neural networks. However, it focuses only on the consistency of the graph, which means that it is unable to detect slight structural differences. Consequently, this limits its ability to capture structural information, which also limits the performance of existing models that rely on the WL test. This limitation is particularly severe for traditional metrics defined by the WL test, which cannot precisely capture slight structural differences. In this paper, we
APA, Harvard, Vancouver, ISO, and other styles
7

Kim, HyunJin. "A k-mismatch string matching for generalized edit distance using diagonal skipping method." PLOS ONE 16, no. 5 (2021): e0251047. http://dx.doi.org/10.1371/journal.pone.0251047.

Full text
Abstract:
This paper proposes an approximate string matching with k-mismatches when calculating the generalized edit distance. When the edit distance is generalized, more sophisticated string matching can be provided. However, the execution time increases because of the bundle of complex computations for calculating complicated edit distances. The computational costs for finding which steps or edit distances are over k-mismatches cannot be significant in the generalized edit distance metric. Therefore, we can reduce the execution time by determining steps over k-mismatches and then skipping them. The di
APA, Harvard, Vancouver, ISO, and other styles
8

ZHANG, KAIZHONG, JASON T. L. WANG, and DENNIS SHASHA. "ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS." International Journal of Foundations of Computer Science 07, no. 01 (1996): 43–57. http://dx.doi.org/10.1142/s0129054196000051.

Full text
Abstract:
We consider the problem of comparing CUAL graphs (Connected, Undirected, Acyclic graphs with nodes being Labeled). This problem is motivated by the study of information retrieval for bio-chemical and molecular databases. Suppose we define the distance between two CUAL graphs G1 and G2 to be the weighted number of edit operations (insert node, delete node and relabel node) to transform G1 to G2. By reduction from exact cover by 3-sets, one can show that finding the distance between two CUAL graphs is NP-complete. In view of the hardness of the problem, we propose a constrained distance metric,
APA, Harvard, Vancouver, ISO, and other styles
9

Vangipuram, Gautam, Aaron Y. Lee, Kasra A. Rezaei, et al. "CAPTCHA as a Visual Performance Metric in Active Macular Disease." Journal of Ophthalmology 2019 (June 9, 2019): 1–6. http://dx.doi.org/10.1155/2019/6710754.

Full text
Abstract:
Purpose. CAPTCHA (completely automated public turing test to tell computers and humans apart) was designed as a spam prevention test. In patients with visual impairment, completion of this task has been assumed to be difficult; but to date, no study has proven this to be true. As visual function is not well measured by Snellen visual acuity (VA) alone, we theorized that CAPTCHA performance may provide additional information on macular disease-related visual dysfunction. Methods. This was designed as a pilot study. Active disease was defined as the presence of either intraretinal fluid (IRF) or
APA, Harvard, Vancouver, ISO, and other styles
10

Natesan, Gunalan, Timothy Hamilton, Eric J. Deeds, and Pavak K. Shah. "Novel metrics reveal new structure and unappreciated heterogeneity in Caenorhabditis elegans development." PLOS Computational Biology 19, no. 12 (2023): e1011733. http://dx.doi.org/10.1371/journal.pcbi.1011733.

Full text
Abstract:
High throughput experimental approaches are increasingly allowing for the quantitative description of cellular and organismal phenotypes. Distilling these large volumes of complex data into meaningful measures that can drive biological insight remains a central challenge. In the quantitative study of development, for instance, one can resolve phenotypic measures for single cells onto their lineage history, enabling joint consideration of heritable signals and cell fate decisions. Most attempts to analyze this type of data, however, discard much of the information content contained within linea
APA, Harvard, Vancouver, ISO, and other styles
11

V.Mahalakshmi and K.Sivakumar. "Improving the Quality of Clustered texts based on Distance Metrics." International Journal of Computer Science and Engineering Communications 5, no. 6 (2017): 1792–99. https://doi.org/10.5281/zenodo.1184947.

Full text
Abstract:
Manual analysis of this unstructured textual data is impractical, and as a result, numerous text mining methods are being developed to automate the process of analyzing this unstructured data. The stringent distance metrics technique used in the paper to increases the accuracy of the clusters formed with lesser execution time and lesser memory usage. This work has provided an overview of clustering and the factors to check and measure the quality of clustered texts. This work has showcased two distance measure namely Hamming and Levenshtein to edit and modify the misspelled strings present in
APA, Harvard, Vancouver, ISO, and other styles
12

Smith, Michael, Kevin T. Cunningham, and Katarina L. Haley. "Automating Error Frequency Analysis via the Phonemic Edit Distance Ratio." Journal of Speech, Language, and Hearing Research 62, no. 6 (2019): 1719–23. http://dx.doi.org/10.1044/2019_jslhr-s-18-0423.

Full text
Abstract:
Purpose Many communication disorders result in speech sound errors that listeners perceive as phonemic errors. Unfortunately, manual methods for calculating phonemic error frequency are prohibitively time consuming to use in large-scale research and busy clinical settings. The purpose of this study was to validate an automated analysis based on a string metric—the unweighted Levenshtein edit distance—to express phonemic error frequency after left hemisphere stroke. Method Audio-recorded speech samples from 65 speakers who repeated single words after a clinician were transcribed phonetically. B
APA, Harvard, Vancouver, ISO, and other styles
13

Gao, Jiahui, Yagaagowtham Palanikumar, Dimitris Mouris, Duong Nguyen, and Ni Trieu. "SecureED: Secure Multiparty Edit Distance for Genomic Sequences." Proceedings on Privacy Enhancing Technologies 2025, no. 2 (2025): 479–93. https://doi.org/10.56553/popets-2025-0072.

Full text
Abstract:
DNA edit distance (ED) measures the minimum number of single nucleotide insertions, substitutions, or deletions required to convert a DNA sequence into another. ED has broad applications in healthcare such as sequence alignment, genome assembly, functional annotation, and drug discovery. Privacy-preserving computation is essential in this context to protect sensitive genomic data. Nonetheless, the existing secure DNA edit distance solutions lack efficiency when handling large data sequences or resort to approximations and fail to accurately compute the metric. In this work, we introduce ScureE
APA, Harvard, Vancouver, ISO, and other styles
14

CHRISTODOULAKIS, MANOLIS, and GERHARD BREY. "EDIT DISTANCE WITH COMBINATIONS AND SPLITS AND ITS APPLICATIONS IN OCR NAME MATCHING." International Journal of Foundations of Computer Science 20, no. 06 (2009): 1047–68. http://dx.doi.org/10.1142/s0129054109007030.

Full text
Abstract:
Approximate pattern matching has a wide range of applications and, depending on the type of approximation, there exist numerous algorithms for solving it. In this article we focus on texts which originate from OCRed documents, whose errors quite often have a particular form and are far from being random errors. We introduce a new variant of the edit distance metric, where apart from the traditional edit operations, two new operations are supported. The combination operation allows two or more symbols from a string x to be interpreted as a single symbol and then "matched" (or aligned) against a
APA, Harvard, Vancouver, ISO, and other styles
15

Wu, Zhixiao, Yao Lu, Jie Wen, and Guangming Lu. "ALRMR-GEC: Adjusting Learning Rate Based on Memory Rate to Optimize the Edit Scorer for Grammatical Error Correction." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 20 (2025): 21608–16. https://doi.org/10.1609/aaai.v39i20.35464.

Full text
Abstract:
Edit-based approaches for Grammatical Error Correction (GEC) have attracted volume attention due to their outstanding explanations of the correction process and rapid inference. Through exploring the characteristics of the generalized and specific knowledge learning for GEC, we discover that efficiently training GEC systems with satisfactory generalization capacity prefers more generalized knowledge rather than specific knowledge. Current gradient-based methods for training GEC systems, however, usually prioritize minimizing training loss over generalization loss. This paper proposes the strat
APA, Harvard, Vancouver, ISO, and other styles
16

Osborn, Joseph Carter, Benjamin Samuel, and Michael Mateas. "Visualizing the strategic landscape of arbitrary games." Information Visualization 17, no. 3 (2017): 196–217. http://dx.doi.org/10.1177/1473871617718377.

Full text
Abstract:
We present Gamalyzer, a game-independent and efficient visualization of sets of play traces. Unlike previous work on game-independent visualization, we focus on sequences of game actions as opposed to sequences of game states. Action sequences directly represent players’ strategic decisions. Moreover, since game actions may already be recorded as part of games’ telemetry and metrics, Gamalyzer is easier to integrate into existing analysis toolchains than state-sequence-based visualizations. Gamalyzer displays each play trace as a vertical line, with symbols along the line indicating game event
APA, Harvard, Vancouver, ISO, and other styles
17

Fan, Dayi, Rubao Lee, and Xiaodong Zhang. "X-TED: Massive Parallelization of Tree Edit Distance." Proceedings of the VLDB Endowment 17, no. 7 (2024): 1683–96. http://dx.doi.org/10.14778/3654621.3654634.

Full text
Abstract:
The tree edit distance (TED) has been found in a wide spectrum of applications in artificial intelligence, bioinformatics, and other areas, which serves as a metric to quantify the dissimilarity between two trees. As applications continue to scale in data size, with a growing demand for fast response time, TED has become even more increasingly data- and computing-intensive. Over the years, researchers have made dedicated efforts to improve sequential TED algorithms by reducing their high complexity. However, achieving efficient parallel TED computation in both algorithm and implementation is c
APA, Harvard, Vancouver, ISO, and other styles
18

Mo, Guanlin, Shihong Song, and Hu Ding. "Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms." Proceedings of the ACM on Management of Data 2, no. 3 (2024): 1–25. http://dx.doi.org/10.1145/3654981.

Full text
Abstract:
DBSCAN is a popular density-based clustering algorithm that has many different applications in practice. However, the running time of DBSCAN in high-dimensional space or general metric space (\em e.g., clustering a set of texts by using edit distance) can be as large as quadratic in the input size. Moreover, most of existing accelerating techniques for DBSCAN are only available for low-dimensional Euclidean space. In this paper, we study the DBSCAN problem under the assumption that the inliers (the core points and border points) have a low intrinsic dimension (which is a realistic assumption f
APA, Harvard, Vancouver, ISO, and other styles
19

Greenhill, Simon J. "Levenshtein Distances Fail to Identify Language Relationships Accurately." Computational Linguistics 37, no. 4 (2011): 689–98. http://dx.doi.org/10.1162/coli_a_00073.

Full text
Abstract:
The Levenshtein distance is a simple distance metric derived from the number of edit operations needed to transform one string into another. This metric has received recent attention as a means of automatically classifying languages into genealogical subgroups. In this article I test the performance of the Levenshtein distance for classifying languages by subsampling three language subsets from a large database of Austronesian languages. Comparing the classification proposed by the Levenshtein distance to that of the comparative method shows that the Levenshtein classification is correct only
APA, Harvard, Vancouver, ISO, and other styles
20

Jia, Danbing, Dongyu Zhang, and Naimin Li. "Pulse Waveform Classification Using Support Vector Machine with Gaussian Time Warp Edit Distance Kernel." Computational and Mathematical Methods in Medicine 2014 (2014): 1–10. http://dx.doi.org/10.1155/2014/947254.

Full text
Abstract:
Advances in signal processing techniques have provided effective tools for quantitative research in traditional Chinese pulse diagnosis. However, because of the inevitable intraclass variations of pulse patterns, the automatic classification of pulse waveforms has remained a difficult problem. Utilizing the new elastic metric, that is, time wrap edit distance (TWED), this paper proposes to address the problem under the support vector machines (SVM) framework by using the Gaussian TWED kernel function. The proposed method, SVM with GTWED kernel (GTWED-SVM), is evaluated on a dataset including 2
APA, Harvard, Vancouver, ISO, and other styles
21

Wali, Aamir, Richard Sproat, Prakash Padakannaya, and Bhuvaneshwari B. "Model for phonemic awareness in readers of Indian script." Written Language and Literacy 12, no. 2 (2009): 161–69. http://dx.doi.org/10.1075/wll.12.2.02wal.

Full text
Abstract:
Previous studies have shown that segmental awareness tasks are usually influenced by the script. In this paper, we extend these studies further to propose a more concrete, script-centric metric for evaluating phonemic awareness in readers of Indian scripts. We propose that the ease or difficulty with which syllabic and phonemic segmental tasks are performed is directly proportional to the editing operations involved in applying the same task on the graphic form of the stimulus. We also present a computational model that calculates visual edit distances and uses these to determine if the phonem
APA, Harvard, Vancouver, ISO, and other styles
22

Sudha, P., A. Kumaresan, and G. Nandhakumar. "Approximate String Search for Retrieving Errorious Data in Spatial Database." Asian Journal of Computer Science and Technology 3, no. 1 (2014): 6–11. http://dx.doi.org/10.51983/ajcst-2014.3.1.1732.

Full text
Abstract:
This work deals with approximate string search in large spatial database. Specifically focus on selectivity estimation for RSAS query in road networks. Selectivity estimation in road network is a union of string selectivity and spatial point selectivity. In this paper we propose a novel adaptive selection method, which is based on grouping technique. String selectivity is achieved by using q-grams and min-wise signature of strings. String similarity is measured by using edit distance metric technique, which is used to calculate threshold value between strings. Spatial point selected by using g
APA, Harvard, Vancouver, ISO, and other styles
23

Syifa, Fauziah Nur, Trisana Nurul Anzali Nabil, Derrel Hendi Arifin, and Rangga Sidik. "Uji Kualitas Website Admin Travel Booking Menggunakan Halstead’s Metric dan Equivalence Partitioning." Jurnal Nasional Teknologi dan Sistem Informasi 11, no. 1 (2025): 67–72. https://doi.org/10.25077/teknosi.v11i01.2025.67-72.

Full text
Abstract:
Tripease is a travel booking admin website designed to enable admins with management roles for train tickets, hotel tickets, and user data. Blackbox testing ensures the software meets the set requirements and specifications and detects functional and performance errors. Whitebox testing is done to check the software's logical path by examining the software's logical structure and detecting errors, such as logical errors and script understanding errors. This research discusses testing the travel booking admin website using two methods: Halstead's Metric and Equivalence Partitions. This research
APA, Harvard, Vancouver, ISO, and other styles
24

Marchand, Bertrand, Yoann Anselmetti, Manuel Lafond, and Aïda Ouangraoua. "Median and small parsimony problems on RNA trees." Bioinformatics 40, Supplement_1 (2024): i237—i246. http://dx.doi.org/10.1093/bioinformatics/btae229.

Full text
Abstract:
Abstract Motivation Noncoding RNAs (ncRNAs) express their functions by adopting molecular structures. Specifically, RNA secondary structures serve as a relatively stable intermediate step before tertiary structures, offering a reliable signature of molecular function. Consequently, within an RNA functional family, secondary structures are generally more evolutionarily conserved than sequences. Conversely, homologous RNA families grouped within an RNA clan share ancestors but typically exhibit structural differences. Inferring the evolution of RNA structures within RNA families and clans is cru
APA, Harvard, Vancouver, ISO, and other styles
25

Gueddah, Hicham, and Youssef Lachibi. "Arabic spellchecking: a depth-filtered composition metric to achieve fully automatic correction." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 5 (2023): 5366. http://dx.doi.org/10.11591/ijece.v13i5.pp5366-5373.

Full text
Abstract:
<p>Digital environments for human learning have evolved a lot in recent years thanks to incredible advances in information technologies. Computer assistance for text creation and editing tools represent a future market in which natural language processing (NLP) concepts will be used. This is particularly the case of the automatic correction of spelling mistakes used daily by data operators. Unfortunately, these spellcheckers are considered writing aids tools, they are unable to perform this task automatically without user’s assistance. In this paper, we suggest a filtered composition met
APA, Harvard, Vancouver, ISO, and other styles
26

Gueddah, Hicham, and Youssef Lachibi. "Arabic spellchecking: a depth-filtered composition metric to achieve fully automatic correction." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 5 (2023): 5366–73. https://doi.org/10.11591/ijece.v13i5.pp5366-5373.

Full text
Abstract:
Digital environments for human learning have evolved a lot in recent years thanks to incredible advances in information technologies. Computer assistance for text creation and editing tools represent a future market in which natural language processing (NLP) concepts will be used. This is particularly the case of the automatic correction of spelling mistakes used daily by data operators. Unfortunately, these spellcheckers are considered writing aids tools, they are unable to perform this task automatically without user’s assistance. In this paper, we suggest a filtered composition metric
APA, Harvard, Vancouver, ISO, and other styles
27

Xu, Mouyi, and Lijun Chang. "Graph Edit Distance Estimation: A New Heuristic and A Holistic Evaluation of Learning-based Methods." Proceedings of the ACM on Management of Data 3, no. 3 (2025): 1–24. https://doi.org/10.1145/3725304.

Full text
Abstract:
Graph edit distance (GED) is an important metric for measuring the distance or similarity between two graphs. It is defined as the minimum number of edit operations required to transform one graph into another. Computing the exact GED between two graphs is an NP-hard problem. With the success of deep learning across various application domains, graph neural networks have also been recently utilized to predict the GED between graphs. However, the existing studies on learning-based methods have two significant limitations. (1)~The development of deep learning models for GED prediction has been e
APA, Harvard, Vancouver, ISO, and other styles
28

Liang, Shuang, Rong-Hua Li, and George Baciu. "Cognitive Garment Panel Design Based on BSG Representation and Matching." International Journal of Software Science and Computational Intelligence 4, no. 1 (2012): 84–99. http://dx.doi.org/10.4018/jssci.2012010104.

Full text
Abstract:
Previously, the fashion industry and apparel manufacturing have been applying intelligent CAD technologies with sketching interfaces to operate garment panel shapes in digital form. The authors propose a novel bi-segment graph (BSG) representation and matching approach to facilitate the searching of panel shapes for sketch-based cognitive garment design and recommendation. First in the front-tier, they provide a sketching interface for designers to input and edit the clothing panels. A panel shape is then decomposed into a sequence of connected segments and represented by the proposed BSG mode
APA, Harvard, Vancouver, ISO, and other styles
29

López, Daniela N., Patricio A. Camus, Nelson Valdivia, and Sergio A. Estay. "Integrating species and interactions into similarity metrics: a graph theory-based approach to understanding community similarity." PeerJ 7 (May 31, 2019): e7013. http://dx.doi.org/10.7717/peerj.7013.

Full text
Abstract:
Community similarity is often assessed through similarities in species occurrences and abundances (i.e., compositional similarity) or through the distribution of species interactions (i.e., interaction similarity). Unfortunately, the joint empirical evaluation of both is still a challenge. Here, we analyze community similarity in ecological systems in order to evaluate the extent to which indices based exclusively on species composition differ from those that incorporate species interactions. Borrowing tools from graph theory, we compared the classic Jaccard index with the graph edit distance
APA, Harvard, Vancouver, ISO, and other styles
30

LYRAS, DIMITRIOS P., KYRIAKOS N. SGARBAS, and NIKOLAOS D. FAKOTAKIS. "APPLYING SIMILARITY MEASURES FOR AUTOMATIC LEMMATIZATION: A CASE STUDY FOR MODERN GREEK AND ENGLISH." International Journal on Artificial Intelligence Tools 17, no. 05 (2008): 1043–64. http://dx.doi.org/10.1142/s021821300800428x.

Full text
Abstract:
This paper addresses the problem of automatic induction of the normalized form (lemma) of regular and mildly irregular words with no direct supervision using language-independent algorithms. More specifically, two string distance metric models (i.e. the Levenshtein Edit Distance algorithm and the Dice Coefficient similarity measure) were employed in order to deal with the automatic word lemmatization task by combining two alignment models based on the string similarity and the most frequent inflectional suffixes. The performance of the proposed model has been evaluated quantitatively and quali
APA, Harvard, Vancouver, ISO, and other styles
31

Khan, Muhammad Yaseen. "Edit distance-based search approach for retrieving element-wise prosody/rhymes in Hindi-Urdu poetry." Indian Journal of Science and Technology 13, no. 39 (2020): 4189–201. http://dx.doi.org/10.17485/ijst/v13i39.1489.

Full text
Abstract:
Background: Prosody (rhyming words) is a connatural element of poetry, throughout its reach, across thousands of languages in the world. Since medieval era, the Indic poetry (principally the Hindi/Urdu poetry) has created an impactful flamboyance w.r.t the subjects, styles, and other creative aspects in poetry. Besides the message of heartfelt poetry, we see the Qafiya (i.e., rhyming words) is the core element, without which we may not consider anything Hindi/Urdu poetry but merely a piece of writing; alongside it, Radif (i.e., a phrasal suffix to qafiya) is also considered next to the intrins
APA, Harvard, Vancouver, ISO, and other styles
32

Muhammad, Yaseen Khan, Adil Rao Muhammad, Wasi Shaukat, Ahmed Minai Twaha, and Muhammad Khaliq-ur-Rahman Raazi Syed. "Edit distance-based search approach for retrieving element-wise prosody/rhymes in Hindi-Urdu poetry." Indian Journal of Science and Technology 13, no. 39 (2020): 4189–201. https://doi.org/10.17485/IJST/v13i39.1489.

Full text
Abstract:
Abstract <strong>Background:</strong>&nbsp;Prosody (rhyming words) is a connatural element of poetry, throughout its reach, across thousands of languages in the world. Since medieval era, the Indic poetry (principally the Hindi/Urdu poetry) has created an impactful flamboyance w.r.t the subjects, styles, and other creative aspects in poetry. Besides the message of heartfelt poetry, we see the Qafiya (i.e., rhyming words) is the core element, without which we may not consider anything Hindi/Urdu poetry but merely a piece of writing; alongside it, Radif (i.e., a phrasal suffix to qafiya) is also
APA, Harvard, Vancouver, ISO, and other styles
33

Bernholz, C. D., and B. L. Pytlik Zillig. "Comparing nearly identical treaty texts: a note on the Treaty of Fort Laramie with Sioux, etc., 1851 and Levenshtein's edit distance metric." Literary and Linguistic Computing 26, no. 1 (2010): 5–16. http://dx.doi.org/10.1093/llc/fqq016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Wu, Wenbo, Tianji Zou, Lu Zhang, Ke Wang, and Xuzhi Li. "Similarity-Based Remaining Useful Lifetime Prediction Method Considering Epistemic Uncertainty." Sensors 23, no. 23 (2023): 9535. http://dx.doi.org/10.3390/s23239535.

Full text
Abstract:
Measuring the similarity between two trajectories is fundamental and essential for the similarity-based remaining useful life (RUL) prediction. Most previous methods do not adequately account for the epistemic uncertainty caused by asynchronous sampling, while others have strong assumption constraints, such as limiting the positional deviation of sampling points to a fixed threshold, which biases the results considerably. To address the issue, an uncertain ellipse model based on the uncertain theory is proposed to model the location of sampling points as an observation drawn from an uncertain
APA, Harvard, Vancouver, ISO, and other styles
35

Cao, Erica, Max Lotstein, and Philip N. Johnson-Laird. "Similarity and Families of Musical Rhythms." Music Perception 31, no. 5 (2012): 444–69. http://dx.doi.org/10.1525/mp.2014.31.5.444.

Full text
Abstract:
What determines the similarity of musical rhythms? According to the “family” theory, which this paper presents, one factor is the temporal sequence of the onsets of notes: rhythms with the same pattern of interonset intervals tend to sound similar. Another factor is meter. It determines whether or not rhythms are members of the same family, where families depend only on three types of possibility for each metrical unit. If the beat is the relevant metrical unit, these three possibilities are: 1) a note starts on a beat and therefore reinforces the meter, 2) a syncopation anticipates the beat a
APA, Harvard, Vancouver, ISO, and other styles
36

Shah, Yusreen, and Somayeh Kafaie. "Evaluating Sequence Alignment Tools for Antimicrobial Resistance Gene Detection in Assembly Graphs." Microorganisms 12, no. 11 (2024): 2168. http://dx.doi.org/10.3390/microorganisms12112168.

Full text
Abstract:
Antimicrobial resistance (AMR) is an escalating global health threat, often driven by the horizontal gene transfer (HGT) of resistance genes. Detecting AMR genes and understanding their genomic context within bacterial populations is crucial for mitigating the spread of resistance. In this study, we evaluate the performance of three sequence alignment tools—Bandage, SPAligner, and GraphAligner—in identifying AMR gene sequences from assembly and de Bruijn graphs, which are commonly used in microbial genome assembly. Efficiently identifying these genes allows for the detection of neighboring gen
APA, Harvard, Vancouver, ISO, and other styles
37

Turkia, Anne. "Runojen uudelleensuomentaminen ja tekijyys." Mikael: Kääntämisen ja tulkkauksen tutkimuksen aikakauslehti 17, no. 1 (2024): 188–204. http://dx.doi.org/10.61200/mikael.136272.

Full text
Abstract:
For over a century, several Finnish literary translators have used existing translations as source texts alongside the ultimate source text. In indirectly translated poems, the different translators’ interpretations show in both the rhythm and the word choices. The anthology Tuhat laulujen vuotta (One Thousand Years of Songs, 1957) contains Finnish translations of poetry classics. The editor, Aale Tynni, translated 283 texts, 11 of them indirectly and included 89 mostly edited old translations. The original translators’ permission for the edits or for using their translations for retranslation
APA, Harvard, Vancouver, ISO, and other styles
38

Yaurentius, Francois Verrel, and Indra Maryati. "Digitalisasi Penjualan di Toko Surabaya Otomotif melalui Aplikasi Berbasis Website." Jurnal Informatika dan Sistem Informasi 10, no. 1 (2024): 40–49. http://dx.doi.org/10.37715/juisi.v10i1.4679.

Full text
Abstract:
Perkembangan teknologi informasi mengalami kemajuan pesat dari waktu ke waktu, sehingga banyak toko kecil yang mulai memanfaatkan teknologi informasi untuk memperlancar operasional mereka. Hal ini menghadirkan tantangan baru bagi pemilik toko untuk menciptakan sistem yang dapat mengintegrasikan informasi, guna mempermudah dan meningkatkan kinerja toko. Toko Surabaya Otomotif, sebagai salah satu pelaku Usaha Mikro Kecil dan Menengah (UMKM) di bidang otomotif, menghadapi keterbatasan dalam menjalankan proses bisnisnya. Saat ini, Toko Surabaya Otomotif masih menjalankan proses bisnisnya secara ma
APA, Harvard, Vancouver, ISO, and other styles
39

Bai, Yue, Dipu Manandhar, Zhaowen Wang, John Collomosse, and Yun Fu. "Layout Representation Learning with Spatial and Structural Hierarchies." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 1 (2023): 206–14. http://dx.doi.org/10.1609/aaai.v37i1.25092.

Full text
Abstract:
We present a novel hierarchical modeling method for layout representation learning, the core of design documents (e.g., user interface, poster, template). Existing works on layout representation often ignore element hierarchies, which is an important facet of layouts, and mainly rely on the spatial bounding boxes for feature extraction. This paper proposes a Spatial-Structural Hierarchical Auto-Encoder (SSH-AE) that learns hierarchical representation by treating a hierarchically annotated layout as a tree format. On the one side, we model SSH-AE from both spatial (semantic views) and structura
APA, Harvard, Vancouver, ISO, and other styles
40

Hai, Xinhe, Kaviya Aranganadin, Cheng-Cheng Yeh, et al. "A Self-Evaluated Bilingual Automatic Speech Recognition System for Mandarin–English Mixed Conversations." Applied Sciences 15, no. 14 (2025): 7691. https://doi.org/10.3390/app15147691.

Full text
Abstract:
Bilingual communication is increasingly prevalent in this globally connected world, where cultural exchanges and international interactions are unavoidable. Existing automatic speech recognition (ASR) systems are often limited to single languages. However, the growing demand for bilingual ASR in human–computer interactions, particularly in medical services, has become indispensable. This article addresses this need by creating an application programming interface (API)-based platform using VOSK, a popular open-source single-language ASR toolkit, to efficiently deploy a self-evaluated bilingual
APA, Harvard, Vancouver, ISO, and other styles
41

Weinberg, Brent, Karthik Ramesh, Saumya Gurbani, et al. "NIMG-23. BRAIN TUMOR REPORTING AND DATA SYSTEM (BT-RADS) AND QUANTITATIVE TOOLS TO GUIDE ITS IMPLEMENTATION." Neuro-Oncology 21, Supplement_6 (2019): vi166. http://dx.doi.org/10.1093/neuonc/noz175.695.

Full text
Abstract:
Abstract Glioblastoma is the most aggressive primary adult brain tumor, with median survival of 15 months despite surgery and chemoradiation. MRI is used to guide treatment decisions, but imaging interpretation is challenging because of subtle findings with overlap between treatment effect and disease progression. The most frequently used quantitative brain tumor assessment metric is the Response Assessment in Neuro-Oncology (RANO), but this scoring system requires manual delineation 2-D metrics which can be subjective and is not directly tied to patient management decisions. The Brain Tumor R
APA, Harvard, Vancouver, ISO, and other styles
42

Ren, Ke, Dezhan Qu, Shaobin Xu, Xufeng Jiao, Liang Tai, and Huijie Zhang. "Uncertainty Visualization of Transport Variance in a Time-Varying Ensemble Vector Field." ISPRS International Journal of Geo-Information 9, no. 1 (2020): 19. http://dx.doi.org/10.3390/ijgi9010019.

Full text
Abstract:
Uncertainty analysis of a time-varying ensemble vector field is a challenging topic in geoscience. Due to the complex data structure, the uncertainty of a time-varying ensemble vector field is hard to quantify and analyze. Measuring the differences between pathlines is an effective way to compute the uncertainty. However, existing metrics are not accurate enough or are sensitive to outliers; thus, a comprehensive tool for the further analysis of the uncertainty of transport patterns is required. In this paper, we propose a novel framework for quantifying and analyzing the uncertainty of an ens
APA, Harvard, Vancouver, ISO, and other styles
43

Bai, Yunsheng, Hao Ding, Ken Gu, Yizhou Sun, and Wei Wang. "Learning-Based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (2020): 3219–26. http://dx.doi.org/10.1609/aaai.v34i04.5720.

Full text
Abstract:
Graph similarity computation is one of the core operations in many graph-based applications, such as graph similarity search, graph database analysis, graph clustering, etc. Since computing the exact distance/similarity between two graphs is typically NP-hard, a series of approximate methods have been proposed with a trade-off between accuracy and speed. Recently, several data-driven approaches based on neural networks have been proposed, most of which model the graph-graph similarity as the inner product of their graph-level representations, with different techniques proposed for generating o
APA, Harvard, Vancouver, ISO, and other styles
44

Kleshch, Kyrylo. "Development of fuzzy search method for creating an efficient information search system in text data." Technology audit and production reserves 1, no. 2(75) (2024): 20–24. http://dx.doi.org/10.15587/2706-5448.2024.298425.

Full text
Abstract:
The object of research is the processes of effective search for information in a set of textual data. The subject of the research is the fuzzy search method, which will allow to effectively solve the problem of searching for information in a set of textual data. The paper considers the process of developing a fuzzy search method, which consists of 9 consecutive steps and is required for a quick search for matches in a large set of text data. Based on this method, it is proposed to create a fuzzy search system that will solve the problem of finding the most relevant documents from a set of such
APA, Harvard, Vancouver, ISO, and other styles
45

Nasiema Kamala, Peter. "Relevance of corporate environmental reports produced by listed South African companies." Environmental Economics 7, no. 1 (2016): 97–107. http://dx.doi.org/10.21511/ee.07(1).2016.12.

Full text
Abstract:
The broad aim of this research is to assess the relevance of environmental reports produced by the Top 100 listed South African (T100LSA) companies. The study is motivated by a lack of research on the relevance of environmental reports in South Africa, given the dramatic increase in the number of companies producing these reports as well as the expansion of the volumes of the reports produced. A content analysis of environmental reports contained in the Integrated Annual Reports (IARs), sustainability reports and companies’ corporate websites is conducted using a control list. The findings of
APA, Harvard, Vancouver, ISO, and other styles
46

Riba, Pau. "Distilling Structure from Imagery:Graph-based Models for the Interpretation of Document Images." ELCVIA Electronic Letters on Computer Vision and Image Analysis 19, no. 2 (2021): 9–10. http://dx.doi.org/10.5565/rev/elcvia.1313.

Full text
Abstract:
From its early stages, the community of Pattern Recognition and Computer Vision has considered the importance of leveraging the structural information when understanding images. Usually, graphs have been proposed as a suitable model to represent this kind of information due to their flexibility and representational power able to codify both, the components, objects, or entities and their pairwise relationship. Even though graphs have been successfully applied to a huge variety of tasks, as a result of their symbolic and relational nature, graphs have always suffered from some limitations compa
APA, Harvard, Vancouver, ISO, and other styles
47

Wang, Jing, Wanqing Xie, Mingmei Cheng, et al. "Assessment of Transcatheter or Surgical Closure of Atrial Septal Defect using Interpretable Deep Keypoint Stadiometry." Research 2022 (October 22, 2022): 1–10. http://dx.doi.org/10.34133/2022/9790653.

Full text
Abstract:
Automated echocardiogram interpretation with artificial intelligence (AI) has the potential to facilitate the serial diagnosis of heart defects by primary clinician. However, the fully automated and interpretable analysis pipeline for suggesting a treatment plan is largely underexplored. The present study targets to build an automatic and interpretable assistant for the transthoracic echocardiogram- (TTE-) based assessment of atrial septal defect (ASD) with deep learning (DL). We developed a novel deep keypoint stadiometry (DKS) model, which learns to precisely localize the keypoints, i.e., th
APA, Harvard, Vancouver, ISO, and other styles
48

Banerjee, Somnath, Sayan Layek, Rima Hazra, and Animesh Mukherjee. "How (Un)ethical Are Instruction-Centric Responses of LLMs? Unveiling the Vulnerabilities of Safety Guardrails to Harmful Queries." Proceedings of the International AAAI Conference on Web and Social Media 19 (June 7, 2025): 193–205. https://doi.org/10.1609/icwsm.v19i1.35811.

Full text
Abstract:
In this study, we tackle a growing concern around the safety and ethical use of large language models (LLMs). Despite their potential, these models can be tricked into producing harmful or unethical content through various sophisticated methods, including `jailbreaking' techniques and targeted manipulation. Our work zeroes in on a specific issue: to what extent LLMs can be led astray by asking them to generate responses that are instruction-centric such as a pseudocode, a program or a software snippet as opposed to vanilla text. To investigate this question, we introduce TechHazardQA, a datase
APA, Harvard, Vancouver, ISO, and other styles
49

Speicher, Stephen, Franklin Wynn, and Jason Porter. "The use of mobile electronic prescribing to drive quality of oncology care delivery." JCO Oncology Practice 19, no. 11_suppl (2023): 586. http://dx.doi.org/10.1200/op.2023.19.11_suppl.586.

Full text
Abstract:
586 Background: This pilot technology enhancement project set out to improve the quality of care for oncology patients by developing a mobile application for writing prescriptions (non-chemotherapy) and narcotics. We describe usage of this new mobile application and associated timeliness of care delivery, provider workflow efficiencies and patient safety metrics. Methods: Agile methodology was used to develop the workflow and software for the mobile application. Internal Patient Safety Usability Testing (PSUT) was used to assess high-risk tasks amongst potential users (n = 7). High-risk tasks
APA, Harvard, Vancouver, ISO, and other styles
50

Tripatis, Dr Krishna K., Mohan T. Mishra, Kajal R. Dhende, and Survesh Karande. "Text Guided Image Using Machine Learning." International Journal for Research in Applied Science and Engineering Technology 11, no. 3 (2023): 1852–55. http://dx.doi.org/10.22214/ijraset.2023.49812.

Full text
Abstract:
bstract: Given a corrupted image, image inpainting aims to complete the image and outputs a plausible result. When we complete the missing region, we always borrow the information from a known area, which is aimless and causes unsatisfactory results. In our daily life, some other information is often used for corrupted images, such as text descriptions. Therefore, we introduce the use of text information to guide image inpainting. To fullfill this task, We introduce an inpainting model named TG Net (Text-Guided Inpainting Network). We provide a text-image gated feature fusion module to fuse te
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!