Log in

Relevant bibliographies by topics / Weighted strings / Journal articles

To see the other types of publications on this topic, follow the link: Weighted strings.

Journal articles on the topic 'Weighted strings'

Author: Grafiati

Published: 11 March 2023

Last updated: 31 July 2025

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 'Weighted strings.'

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

ZHANG, MENG, LIANG HU, and YI ZHANG. "WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING." International Journal of Foundations of Computer Science 22, no. 04 (2011): 921–43. http://dx.doi.org/10.1142/s0129054111008490.

Full text

Abstract:

Full-text index structures are widely used in string matching and bioinformatics. These structures such as DAWGs and suffix trees allow fast searches on texts. In this paper, we present a new partition of the factors of a word, called a consistent minimal linear partition. Based on this partition, we introduce the weighted directed word graph (WDWG), a space-economical full-text index. WDWGs are basically cyclic, which means that they may accept infinite strings. But by assigning weights to edges, the acceptable strings are limited only to the factors of the input string. For a given word w, a

APA, Harvard, Vancouver, ISO, and other styles

2

MOHRI, MEHRYAR. "EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS." International Journal of Foundations of Computer Science 14, no. 06 (2003): 957–82. http://dx.doi.org/10.1142/s0129054103002114.

Full text

Abstract:

The problem of computing the similarity between two sequences arises in many areas such as computational biology and natural language processing. A common measure of the similarity of two strings is their edit-distance, that is the minimal cost of a series of symbol insertions, deletions, or substitutions transforming one string into the other. In several applications such as speech recognition or computational biology, the objects to compare are distributions over strings, i.e., sets of strings representing a range of alternative hypotheses with their associated weights or probabilities. We d

APA, Harvard, Vancouver, ISO, and other styles

3

BROUTIN, N., and L. DEVROYE. "An Analysis of the Height of Tries with Random Weights on the Edges." Combinatorics, Probability and Computing 17, no. 2 (2008): 161–202. http://dx.doi.org/10.1017/s0963548307008796.

Full text

Abstract:

We analyse the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . .d}. The edges receive random weights whose distribution depends upon the number of strings that visit that edge. Such a model covers the hybrid tries of de la Briandais and the TST of Bentley and Sedgewick, where the search time for a string can be decomposed as a sum of processing times for each symbol in the string. Our weighted trie model also permits one to study maximal path imbalance. In all cases, the weighted height is shown to be asymptotic toclognin probabil

APA, Harvard, Vancouver, ISO, and other styles

4

Hyyrö, Heikki, and Shunsuke Inenaga. "Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions." International Journal of Foundations of Computer Science 29, no. 04 (2018): 623–45. http://dx.doi.org/10.1142/s0129054118410083.

Full text

Abstract:

Kim and Park [A dynamic edit distance table, J. Disc. Algo., 2:302–312, 2004] proposed a method (KP) based on a “dynamic edit distance table” that allows one to efficiently maintain unit cost edit distance information between two strings [Formula: see text] of length [Formula: see text] and [Formula: see text] of length [Formula: see text] when the strings can be modified by single-character edits to their left or right ends. This type of computation is useful e.g. in cyclic string comparison. KP uses linear time, [Formula: see text], to update the distance representation after each single edi

APA, Harvard, Vancouver, ISO, and other styles

5

Louchard, Guy, and Wojciech Szpankowski. "A Probabilistic Analysis of a String Editing Problem and its Variations." Combinatorics, Probability and Computing 4, no. 2 (1995): 143–66. http://dx.doi.org/10.1017/s0963548300001541.

Full text

Abstract:

We consider a string editing problem in a probabilistic framework. This problem is of considerable interest to many facets of science, most notably molecular biology and computer science. A string editing transforms one string into another by performing a series of weighted edit operations of overall maximum (minimum) cost. The problem is equivalent to finding an optimal path in a weighted grid graph. In this paper we provide several results regarding a typical behaviour of such a path. In particular, we observe that the optimal path (i.e. edit distance) is almost surely (a.s.) equal to αn for

APA, Harvard, Vancouver, ISO, and other styles

6

Barton, Carl, Chang Liu, and Solon P. Pissis. "Fast Average-Case Pattern Matching on Weighted Sequences." International Journal of Foundations of Computer Science 29, no. 08 (2018): 1331–43. http://dx.doi.org/10.1142/s0129054118430062.

Full text

Abstract:

A weighted string is a string in which a set of letters may occur at each position with respective occurrence probabilities. Weighted strings, also known as position weight matrices, weighted sequences or uncertain sequences, naturally arise in many contexts. In this paper, we study the problem of weighted string matching with a special focus on average-case analysis. Given a weighted pattern string [Formula: see text] of length [Formula: see text], a text string [Formula: see text] of length [Formula: see text], both on a constant-sized alphabet of size [Formula: see text], and a cumulative w

APA, Harvard, Vancouver, ISO, and other styles

7

SADRI, JAVAD, CHING Y. SUEN, and TIEN D. BUI. "STATISTICAL CHARACTERISTICS OF SLANT ANGLES IN HANDWRITTEN NUMERAL STRINGS AND EFFECTS OF SLANT CORRECTION ON SEGMENTATION." International Journal of Pattern Recognition and Artificial Intelligence 24, no. 01 (2010): 97–116. http://dx.doi.org/10.1142/s0218001410007816.

Full text

Abstract:

A novel and efficient method for correction of slant angles in handwritten numeral strings is proposed. For the first time, the statistical distribution of slant angles in handwritten numerals is investigated and the effects of slant correction on the segmentation of handwritten numeral strings are shown. In our proposed slant correction method, utilizing geometric features, a Component Slant Angle (CSA) is estimated for each connected component independently. A weighted average is then used to compute the String Slant Angle (SSA), which is applied uniformly to correct the slant of all the com

APA, Harvard, Vancouver, ISO, and other styles

8

Barton, Carl, and Solon P. Pissis. "Crochemore’s Partitioning on Weighted Strings and Applications." Algorithmica 80, no. 2 (2017): 496–514. http://dx.doi.org/10.1007/s00453-016-0266-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Uma, Gajendragadkar, and Joshi Sarang. "Context Sensitive Search String Composition Algorithm using User Intention to Handle Ambiguous Keywords." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 1 (2017): 432–50. https://doi.org/10.11591/ijece.v7i1.pp432-450.

Full text

Abstract:

Finding the required URL among the first few result pages of a search engine is still a challenging task. This may require number of reformulations of the search string thus adversely affecting user's search time. Query ambiguity and polysemy are major reasons for not obtaining relevant results in the top few result pages. Efficient query composition and data organization are necessary for getting effective results. Context of the information need and the user intent may improve the autocomplete feature of existing search engines. This research proposes a Funnel Mesh-5 algorithm (FM5) to c

APA, Harvard, Vancouver, ISO, and other styles

10

Alshawi, Hiyan, Srinivas Bangalore, and Shona Douglas. "Learning Dependency Translation Models as Collections of Finite-State Head Transducers." Computational Linguistics 26, no. 1 (2000): 45–60. http://dx.doi.org/10.1162/089120100561629.

Full text

Abstract:

The paper defines weighted head transducers, finite-state machines that perform middle-out string transduction. These transducers are strictly more expressive than the special case of standard left-to-right finite-state transducers. Dependency transduction models are then defined as collections of weighted head transducers that are applied hierarchically. A dynamic programming search algorithm is described for finding the optimal transduction of an input string with respect to a dependency transduction model. A method for automatically training a dependency transduction model from a set of inp

APA, Harvard, Vancouver, ISO, and other styles

11

Gajendragadkar, Uma, and Sarang Joshi. "Context Sensitive Search String Composition Algorithm using User Intention to Handle Ambiguous Keywords." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 1 (2017): 432. http://dx.doi.org/10.11591/ijece.v7i1.pp432-450.

Full text

Abstract:

<p>Finding the required URL among the first few result pages of a search engine is still a challenging task. This may require number of reformulations of the search string thus adversely affecting user's search time. Query ambiguity and polysemy are major reasons for not obtaining relevant results in the top few result pages. Efficient query composition and data organization are necessary for getting effective results. Context of the information need and the user intent may improve the autocomplete feature of existing search engines. This research proposes a Funnel Mesh-5 algorithm (FM5)

APA, Harvard, Vancouver, ISO, and other styles

12

Baier, Christel. "Verification Column." ACM SIGLOG News 10, no. 3 (2023): 3. http://dx.doi.org/10.1145/3617576.3617577.

Full text

Abstract:

Many verification problems can be formulated as a language inclusion problem where the task is to decide whether the language of the system model (given by the runs of the system) is contained in the language induced by a logical specification. The corresponding verification problem for non-functional properties is the quantitative inclusion problem where both the system model and the specification are given by weighted automata and the task is to decide whether the weight for each input string in the automaton for the system is less than that in the automaton for the specification. Here, the

APA, Harvard, Vancouver, ISO, and other styles

13

Cieliebak, Mark, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, and Emo Welzl. "Algorithmic complexity of protein identification: combinatorics of weighted strings." Discrete Applied Mathematics 137, no. 1 (2004): 27–46. http://dx.doi.org/10.1016/s0166-218x(03)00187-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Lintzmayer, Carla Negri, Guillaume Fertin, and Zanoni Dias. "Sorting permutations and binary strings by length-weighted rearrangements." Theoretical Computer Science 715 (March 2018): 35–59. http://dx.doi.org/10.1016/j.tcs.2018.01.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Bansal, Nikhil, Mark Cieliebak, and Zsuzsanna Lipták. "Finding submasses in weighted strings with Fast Fourier Transform." Discrete Applied Mathematics 155, no. 6-7 (2007): 707–18. http://dx.doi.org/10.1016/j.dam.2005.09.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Bunke, Horst, Xiaoyi Jiang, Karin Abegglen, and Abraham Kandel. "On the Weighted Mean of a Pair of Strings." Pattern Analysis & Applications 5, no. 1 (2002): 23–30. http://dx.doi.org/10.1007/s100440200003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

MALETTI, ANDREAS, and DANIEL QUERNHEIM. "UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION." International Journal of Foundations of Computer Science 23, no. 06 (2012): 1207–25. http://dx.doi.org/10.1142/s0129054112400485.

Full text

Abstract:

Hyper-minimization of deterministic finite automata (DFA) is a recently introduced state reduction technique that allows a finite change in the recognized language. A generalization of this lossy compression method to the weighted setting over semifields is presented, which allows the recognized weighted language to differ for finitely many input strings. First, the structure of hyper-minimal deterministic weighted finite automata is characterized in a similar way as in classical weighted minimization and unweighted hyper-minimization. Second, an efficient hyper-minimization algorithm, which r

APA, Harvard, Vancouver, ISO, and other styles

18

Selvarajoo, Mathuri, Mohd Pawiro Santono, Fong Wan Heng, Nor Haniza Sarmin, and Vincent Daniel David. "A Review: Restricted Splicing Systems." Journal of Engineering and Science Research 7, no. 2 (2023): 20–24. http://dx.doi.org/10.26666/rmp.jesr.2023.2.4.

Full text

Abstract:

In 1987, Head [1] proposed a splicing method as a mathematical model for DNA recombination. In this model, two DNA molecules are cut at specific recognition sites, and the prefix of one molecule is combined with the suffix of the other, creating a new string. Splicing operations in the system are represented as splicing rules, formalizing the process as a string operation. By iteratively applying a set of splicing rules to a set of initial strings or axioms, a language can be generated, which is known as a splicing language. According to the Chomsky hierarchy, these languages are classified as

APA, Harvard, Vancouver, ISO, and other styles

19

ALIEV, A. N. "ON THE ELECTROMAGNETIC PERTURBATIONS OF A MULTICONICAL SPACETIME." Modern Physics Letters A 11, no. 27 (1996): 2171–77. http://dx.doi.org/10.1142/s0217732396002150.

Full text

Abstract:

The electromagnetic perturbations propagating in the multiconical spacetime of N parallel cosmic strings are described. The expression for vacuum average of the stress-energy tensor is reduced to a form involving only zero-spin-weighted perturbation modes.

APA, Harvard, Vancouver, ISO, and other styles

20

Clark, Alexander, and Chris Watkins. "Some Alternatives to Parikh Matrices Using String Kernels." Fundamenta Informaticae 84, no. 3-4 (2008): 291–303. https://doi.org/10.3233/fun-2008-843-401.

Full text

Abstract:

We describe methods of representing strings as real valued vectors or matrices; we show how to integrate two separate lines of enquiry: string kernels, developed in machine learning, and Parikh matrices [8], which have been studied intensively over the last few years as a powerful tool in the study of combinatorics over words. In the field of machine learning, there is widespread use of string kernels, which use analogous mappings into high dimensional feature spaces based on the occurrences of subwords or factors. In this paper we show how one can use string kernels to construct two alternati

APA, Harvard, Vancouver, ISO, and other styles

21

Luo, Zhenkai, Binbin Jiao, Hang Zhao, Tao Huang, Lin Geng, and Guan Zhang. "The Efficacy and Safety of Ureteric Stent Removal with Strings versus No Strings: Which Is Better?" BioMed Research International 2020 (October 15, 2020): 1–10. http://dx.doi.org/10.1155/2020/4081409.

Full text

Abstract:

Objective. To evaluate the current evidence on the effectiveness and safety of ureteric stent removal using strings compared to conventional methods. Materials and Methods. The electronic databases PubMed, Embase, China National Knowledge Infrastructure (CNKI), and the Cochrane Library were systematically searched up to March 2020. Two reviewers searched the literature, independently extracted the data, and evaluated the quality of the studies according to the inclusion and exclusion criteria. The data analysis was performed with the software program Review Manager 5.3. Results. Eleven studies

APA, Harvard, Vancouver, ISO, and other styles

22

Barton, Carl, Chang Liu, and Solon P. Pissis. "Linear-time computation of prefix table for weighted strings & applications." Theoretical Computer Science 656 (December 2016): 160–72. http://dx.doi.org/10.1016/j.tcs.2016.04.029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Chiang, David, Frank Drewes, Daniel Gildea, Adam Lopez, and Giorgio Satta. "Weighted DAG Automata for Semantic Graphs." Computational Linguistics 44, no. 1 (2018): 119–86. http://dx.doi.org/10.1162/coli_a_00309.

Full text

Abstract:

Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, and using models involving graphs that parallels the frameworks of finite automata for strings and finite tree automata for trees. A possible starting point for such a framework is the formalism of directed acyclic graph (DAG) automata, defined by Kamimura and Slutzki and extended by Quernheim and Knight. In this article, we study the latter in depth, demonstrating several new results, including a

APA, Harvard, Vancouver, ISO, and other styles

24

Pang, Peijie. "Design of Tone Recognition System for Pipa Strings Based on Wireless Sensors." Mobile Information Systems 2022 (May 9, 2022): 1–8. http://dx.doi.org/10.1155/2022/1670848.

Full text

Abstract:

Pipa has been widely used as a wooden musical instrument as early as the Han period. It mainly relies on human fingers to pluck the strings to make sounds. The timbre of the pipa also has a very strong national characteristic. Understanding the meaning of words, phrases, and sentences requires tone recognition. For tone identification, the fundamental frequency conveys the most unique information. This paper summarizes the influence of the pipa’s characteristics, technology and skills of the player, and the player’s factors on the timbre of the pipa performance. In addition, given the problems

APA, Harvard, Vancouver, ISO, and other styles

25

Kim, Janghwan, Jeeyoung Lim, Hyoung-Chul Lim, and Dae Young Kim. "Improving Sustainable Project Success Strategies Focused on Cost and Schedule for Electrical Construction Project Management." Sustainability 14, no. 5 (2022): 2653. http://dx.doi.org/10.3390/su14052653.

Full text

Abstract:

Electrical contractors encounter problems such as limited construction sites, schedule interference, and inefficient communication with other contractors when they typically subcontract with general contractors. Electrical projects require effective and systematic project management strategies to overcome these problems and achieve the desired goal. In an electrical construction project, individual tasks are interconnected at different stages, including pre-construction planning (PCP) and project execution (PE). Therefore, analyzing the effect of task strings on the project success in terms of

APA, Harvard, Vancouver, ISO, and other styles

26

Gui, Ruowei, Liu Yang, and Xiaolin Gui. "An Order-Preserving Encryption Scheme Based on Weighted Random Interval Division for Ciphertext Comparison in Wearable Systems." Sensors 22, no. 20 (2022): 7950. http://dx.doi.org/10.3390/s22207950.

Full text

Abstract:

With the rapid development of wearable devices with various sensors, massive sensing data for health management have been generated. This causes a potential revolution in medical treatments, diagnosis, and prediction. However, due to the privacy risks of health data aggregation, data comparative analysis under privacy protection faces challenges. Order-preserving encryption is an effective scheme to achieve private data retrieval and comparison, but the existing order-preserving encryption algorithms are mainly aimed at either integer data or single characters. It is urgent to build a lightwei

APA, Harvard, Vancouver, ISO, and other styles

27

McWhirter, Paul R., Kashif Kifayat, Qi Shi, and Bob Askwith. "SQL Injection Attack classification through the feature extraction of SQL query strings using a Gap-Weighted String Subsequence Kernel." Journal of Information Security and Applications 40 (June 2018): 199–216. http://dx.doi.org/10.1016/j.jisa.2018.04.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Clark, Alexander, and Nathanaël Fijalkow. "Consistent Unsupervised Estimators for Anchored PCFGs." Transactions of the Association for Computational Linguistics 8 (July 2020): 409–22. http://dx.doi.org/10.1162/tacl_a_00323.

Full text

Abstract:

Learning probabilistic context-free grammars (PCFGs) from strings is a classic problem in computational linguistics since Horning ( 1969 ). Here we present an algorithm based on distributional learning that is a consistent estimator for a large class of PCFGs that satisfy certain natural conditions including being anchored (Stratos et al., 2016 ). We proceed via a reparameterization of (top–down) PCFGs that we call a bottom–up weighted context-free grammar. We show that if the grammar is anchored and satisfies additional restrictions on its ambiguity, then the parameters can be directly relate

APA, Harvard, Vancouver, ISO, and other styles

29

Markovich, Liubov A., Attaallah Almasi, Sina Zeytinoğlu, and Johannes Borregaard. "Quantum memory assisted observable estimation." Quantum 9 (March 6, 2025): 1655. https://doi.org/10.22331/q-2025-03-06-1655.

Full text

Abstract:

The estimation of many-qubit observables is an essential task of quantum information processing. The generally applicable approach is to decompose the observables into weighted sums of multi-qubit Pauli strings, i.e., tensor products of single-qubit Pauli matrices, which can readily be measured with low-depth Clifford circuits. The accumulation of shot noise in this approach, however, severely limits the achievable variance for a finite number of measurements. We introduce a novel method, dubbed coherent Pauli summation (CPS), that circumvents this limitation by exploiting access to a single-q

APA, Harvard, Vancouver, ISO, and other styles

30

Lapidus, Michel L. "Towards quantized number theory: spectral operators and an asymmetric criterion for the Riemann hypothesis." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 373, no. 2047 (2015): 20140240. http://dx.doi.org/10.1098/rsta.2014.0240.

Full text

Abstract:

This research expository article not only contains a survey of earlier work but also contains a main new result, which we first describe. Given c ≥0, the spectral operator can be thought of intuitively as the operator which sends the geometry onto the spectrum of a fractal string of dimension not exceeding c . Rigorously, it turns out to coincide with a suitable quantization of the Riemann zeta function ζ = ζ ( s ): , where ∂=∂ c is the infinitesimal shift of the real line acting on the weighted Hilbert space . In this paper, we establish a new asymmetric criterion for the Riemann hypothesis (

APA, Harvard, Vancouver, ISO, and other styles

31

CHAMPARNAUD, JEAN-MARC, FRANCK GUINGNE, ANDRÉ KEMPE, and FLORENT NICART. "ALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINES." International Journal of Foundations of Computer Science 19, no. 02 (2008): 453–76. http://dx.doi.org/10.1142/s0129054108005760.

Full text

Abstract:

A weighted finite-state machine with n tapes describes a rational relation on n strings. We recall some basic operations on n-ary rational relations, recast the important join operation in terms of "auto-intersection", and propose restricted algorithms for both operations. If two rational relations are joined on more than one tape, it can unfortunately lead to non-rational relations with undecidable properties. As a consequence, there cannot be a fully general algorithm, able to compile any rational join or auto-intersection. We define a class of triples 〈A,i,j〉 for which we are able to compil

APA, Harvard, Vancouver, ISO, and other styles

32

Smith, Noah A., and Mark Johnson. "Weighted and Probabilistic Context-Free Grammars Are Equally Expressive." Computational Linguistics 33, no. 4 (2007): 477–91. http://dx.doi.org/10.1162/coli.2007.33.4.477.

Full text

Abstract:

This article studies the relationship between weighted context-free grammars (WCFGs), where each production is associated with a positive real-valued weight, and probabilistic context-free grammars (PCFGs), where the weights of the productions associated with a nonterminal are constrained to sum to one. Because the class of WCFGs properly includes the PCFGs, one might expect that WCFGs can describe distributions that PCFGs cannot. However, Z. Chi (1999, Computational Linguistics, 25(1):131–160) and S. P. Abney, D. A. McAllester, and P. Pereira (1999, In Proceedings of the 37th Annual Meeting o

APA, Harvard, Vancouver, ISO, and other styles

33

Taft, Benjamin N., and Nathaniel Taft. "Acoustic effects of varying the waist width of violin bridges: A physical experiment." Journal of the Acoustical Society of America 153, no. 3_supplement (2023): A199. http://dx.doi.org/10.1121/10.0018650.

Full text

Abstract:

We explore the relationship between the bridge waist and sound production in the violin. Models of violin acoustics suggest that the stiffness of this portion of the bridge has a considerable effect on an instrument’s sound production. In practice, the proportions of the waist vary significantly from bridge to bridge and instrument to instrument, which suggests there are many ways that a luthier can influence a bridge’s stiffness. Our experiment connects modeling and real-world instrument sound adjustment. We incrementally remove material symmetrically from the bridge in the waist area, record

APA, Harvard, Vancouver, ISO, and other styles

34

Zeakis, Alexandros, Dimitrios Skoutas, Dimitris Sacharidis, Odysseas Papapetrou, and Manolis Koubarakis. "TokenJoin: Efficient Filtering for Set Similarity Join with Maximum Weighted Bipartite Matching." Proceedings of the VLDB Endowment 16, no. 4 (2022): 790——802. https://doi.org/10.14778/3574245.3574263.

Full text

Abstract:

Set similarity join is an important problem with many applications in data discovery, cleaning and integration. To increase robustness, fuzzy set similarity join calculates the similarity of two sets based on maximum weighted bipartite matching instead of set overlap. This allows pairs of elements, represented as sets or strings, to also match approximately rather than exactly, e.g., based on Jaccard similarity or edit distance. However, this significantly increases the verification cost, making even more important the need for efficient and effective filtering techniques to reduce the number

APA, Harvard, Vancouver, ISO, and other styles

35

Liu, Xin, Ren Ren Liu, and Wen Jing He. "A Fast Algorithm for Chinese Text Categorization Based on Key Tree." Applied Mechanics and Materials 58-60 (June 2011): 1106–12. http://dx.doi.org/10.4028/www.scientific.net/amm.58-60.1106.

Full text

Abstract:

To solving Chinese text categorization, a fast algorithm is proposed. The basic idea of the algorithm is: first constructs a weighted value of keywords dictionary which is constructed in key tree, then using the Hash function and the principle of giving priority for long term matching to mapping the strings in documentations to the dictionary. After that, calculate the sum of weights of the keywords which has been matched successfully. Finally take the maximum for the result of the classification. The algorithm can avoid the difficulty of Chinese word segmentation and its influence on accuracy

APA, Harvard, Vancouver, ISO, and other styles

36

Jonnalagadda, Siddhartha Reddy, and Philip Topham. "NEMO: Extraction and normalization of organization names from PubMed affiliations." Journal of Biomedical Discovery and Collaboration 5 (October 4, 2010): 50–75. http://dx.doi.org/10.5210/disco.v5i0.3047.

Full text

Abstract:

Background: We are witnessing an exponential increase in biomedical research citations in PubMed. However, translating biomedical discoveries into practical treatments is estimated to take around 17 years, according to the 2000 Yearbook of Medical Informatics, and much information is lost during this transition. Pharmaceutical companies spend huge sums to identify opinion leaders and centers of excellence. Conventional methods such as literature search, survey, observation, self‐identification, expert opinion, and sociometry not only need much human effort, but are also non‐comprehensive

APA, Harvard, Vancouver, ISO, and other styles

37

Schmidt, Jeanette P. "All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings." SIAM Journal on Computing 27, no. 4 (1998): 972–92. http://dx.doi.org/10.1137/s0097539795288489.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Kishino, Mika, and Kanako Komiya. "Extracting Linguistic Speech Patterns of Japanese Fictional Characters using Subword Units." International Journal on Natural Language Computing 11, no. 1 (2022): 1–14. http://dx.doi.org/10.5121/ijnlc.2022.11101.

Full text

Abstract:

This study extracted and analyzed the linguistic speech patterns that characterize Japanese anime or game characters. Conventional morphological analyzers, such as MeCab, segment words with high performance, but they are unable to segment broken expressions or utterance endings that are not listed in the dictionary, which often appears in lines of anime or game characters. To overcome this challenge, we propose segmenting lines of Japanese anime or game characters using subword units that were proposed mainly for deep learning, and extracting frequently occurring strings to obtain expressions

APA, Harvard, Vancouver, ISO, and other styles

39

Mika, Kishino, and Komiya Kanako. "EXTRACTING LINGUISTIC SPEECH PATTERNS OF JAPANESE FICTIONAL CHARACTERS USING SUBWORD UNITS." International Journal on Natural Language Computing (IJNLC) 11, no. 1 (2022): 14. https://doi.org/10.5121/ijnlc.2022.11101.

Full text

Abstract:

This study extracted and analyzed the linguistic speech patterns that characterize Japanese anime or game characters. Conventional morphological analyzers, such as MeCab, segment words with high performance, but they are unable to segment broken expressions or utterance endings that are not listed in the dictionary, which often appears in lines of anime or game characters. To overcome this challenge, we propose segmenting lines of Japanese anime or game characters using subword units that were proposed mainly for deep learning, and extracting frequently occurring strings to obtain expressions

APA, Harvard, Vancouver, ISO, and other styles

40

Pereira, Fernando Carlos Neves. "Grapheme-to-phoneme conversion of digit strings using weighted finite state transducers to apply grammar to powers of a number basis." Journal of the Acoustical Society of America 105, no. 2 (1999): 587. http://dx.doi.org/10.1121/1.427009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Jelbert, Sarah A., Rachael Miller, Martina Schiestl, et al. "New Caledonian crows infer the weight of objects from observing their movements in a breeze." Proceedings of the Royal Society B: Biological Sciences 286, no. 1894 (2019): 20182332. http://dx.doi.org/10.1098/rspb.2018.2332.

Full text

Abstract:

Humans use a variety of cues to infer an object's weight, including how easily objects can be moved. For example, if we observe an object being blown down the street by the wind, we can infer that it is light. Here, we tested whether New Caledonian crows make this type of inference. After training that only one type of object (either light or heavy) was rewarded when dropped into a food dispenser, birds observed pairs of novel objects (one light and one heavy) suspended from strings in front of an electric fan. The fan was either on—creating a breeze which buffeted the light, but not the heavy

APA, Harvard, Vancouver, ISO, and other styles

42

Zeakis, Alexandros, Dimitrios Skoutas, Dimitris Sacharidis, Odysseas Papapetrou, and Manolis Koubarakis. "TokenJoin." Proceedings of the VLDB Endowment 16, no. 4 (2022): 790–802. http://dx.doi.org/10.14778/3574245.3574263.

Full text

Abstract:

Set similarity join is an important problem with many applications in data discovery, cleaning and integration. To increase robustness, fuzzy set similarity join calculates the similarity of two sets based on maximum weighted bipartite matching instead of set overlap. This allows pairs of elements, represented as sets or strings, to also match approximately rather than exactly, e.g., based on Jaccard similarity or edit distance. However, this significantly increases the verification cost, making even more important the need for efficient and effective filtering techniques to reduce the number

APA, Harvard, Vancouver, ISO, and other styles

43

Little, IP, and DR Ross. "The Levenshtein metric, a new means for soil classification tested by data from a sand-podzol chronosequence and evaluated by discriminant function analysis." Soil Research 23, no. 2 (1985): 115. http://dx.doi.org/10.1071/sr9850115.

Full text

Abstract:

Soil profiles are difficult to compare by statistical methods because sampling depths and intervals and the number of samples per profile may vary. This paper discusses a novel method for handling the problem. Chemical data from 52 soil profiles, which formed a chronosequence of podzols from Fraser Island, south-eastern Queensland, was classified using the Levenshtein metric. The soils varied from undifferentiated sands to deeply weathered podzols with many metres of bleached A, horizon. The data used were the proportions by weight in the soil samples of Na, K, Ca, Mg, Fe and Al extracted by m

APA, Harvard, Vancouver, ISO, and other styles

44

Pérez Archila, Luis Miguel, Juan David Bastidas-Rodríguez, Rodrigo Correa, Luz Adriana Trejos Grisales, and Daniel Gonzalez-Montoya. "A Solution of Implicit Model of Series-Parallel Photovoltaic Arrays by Using Deterministic and Metaheuristic Global Optimization Algorithms." Energies 13, no. 4 (2020): 801. http://dx.doi.org/10.3390/en13040801.

Full text

Abstract:

The implicit model of photovoltaic (PV) arrays in series-parallel (SP) configuration does not require the LambertW function, since it uses the single-diode model, to represent each submodule, and the implicit current-voltage relationship to construct systems of nonlinear equations that describe the electrical behavior of a PV generator. However, the implicit model does not analyze different solution methods to reduce computation time. This paper formulates the solution of the implicit model of SP arrays as an optimization problem with restrictions for all the variables, i.e., submodules voltag

APA, Harvard, Vancouver, ISO, and other styles

45

Wang, Sifan. "Technical Status and Development Trends of Difficult Throttles Treatment Technology in Gas Wells." Journal of Physics: Conference Series 2834, no. 1 (2024): 012076. http://dx.doi.org/10.1088/1742-6596/2834/1/012076.

Full text

Abstract:

Abstract In order to promote the development of treatment technology for difficult throttles in gas wells and assist in solving the problem of gas well shutdown caused by the failure of difficult throttle treatment, this paper delves into the structural principles of preset throttles and slip-type throttles, introducing various types such as preset wire deployment and fishable throttles, preset non-wire deployment and fishable throttles, mechanical slip-type throttles, and electric throttles. It systematically analyzes the difficulties in retrieving difficult throttles, including wire breakage

APA, Harvard, Vancouver, ISO, and other styles

46

Das, Shibsankar, and Kalpesh Kapoor. "Weighted approximate parameterized string matching." AKCE International Journal of Graphs and Combinatorics 14, no. 1 (2017): 1–12. http://dx.doi.org/10.1016/j.akcej.2016.11.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Bertossi, Alan A., Fabrizio Luccio, Elena Lodi, and Linda Pagli. "String matching with weighted errors." Theoretical Computer Science 73, no. 3 (1990): 319–28. http://dx.doi.org/10.1016/0304-3975(90)90182-h.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Yan Fei, 严飞, 路长秋 Lu Changqiu, 文杰 Wen Jie, 肖雨倩 Xiao Yuqian та 刘佳 Liu Jia. "复用加权二进制编码条纹三维测量方法". Acta Optica Sinica 43, № 11 (2023): 1112005. http://dx.doi.org/10.3788/aos222116.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Wacher, Abigail, Ian Sobey, and Keith Miller. "String gradient weighted moving finite elements." International Journal for Numerical Methods in Fluids 47, no. 10-11 (2005): 1329–36. http://dx.doi.org/10.1002/fld.872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Demirbas, Murat, Julie Hviid Hahn-Pedersen, and Henrik Løvendahl Jørgensen. "PP82 Comparison Between Informal Caregiver Burden Of Patients With Alzheimer’s Disease Versus Other Chronic Diseases." International Journal of Technology Assessment in Health Care 39, S1 (2023): S74. http://dx.doi.org/10.1017/s0266462323002131.

Full text

Abstract:

IntroductionAlzheimer’s disease (AD) is a neurodegenerative disease with progressive neuropsychiatric symptoms. Patient care is often provided by informal caregivers similarly to various other chronic diseases. This targeted literature review assessed the difference in burden experienced by caregivers of people with AD in comparison to other chronic diseases.MethodsTwo separate search strings were developed to identify (i) caregiver burden in AD and (ii) caregiver burden in other chronic diseases using PubMed. Studies published in English (January 2012-October 2022) were included. Comparison o

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!