Skip to main content
0 votes
1 answer
131 views

I have the following recursive Python function. The goal is to return the index of the first occurrence of it in the list. Is it possible to fix this code within a maximum of 12 edits? def index_of(it,...
user32086462's user avatar
3 votes
1 answer
109 views

I'm currently in the process of trying to compute Levenshtein distance matrices for my fairly large dataset of approx 420 long DNA sequences (about 2kbp), so I cannot check them manually for mistakes ...
Giulia Senna's user avatar
1 vote
2 answers
68 views

I modified Levenshtein distance algorithm form geeksforgeeks using full matrix. I deleted a delete operation (prevRow[j]) and it works now well only for specific order of input string. cout << ...
Vaclav Lokaj's user avatar
1 vote
0 answers
47 views

I am comparing pairs of identical directed graphs represented in GXL format using the Graph-Matching-Toolkit(https://github.com/dzambon/graph-matching-toolkit). Since the graphs are identical, I ...
NoName Su's user avatar
1 vote
1 answer
95 views

How can I calculate the numeric distance of two sequences under the requirement that sequence elements may only be swapped with adjacent elements? Insertion, and deletion are not allowed. The distance ...
E Y's user avatar
  • 465
0 votes
1 answer
60 views

Using edit distance metrics, e.g. the Levenshtein-Damerau edit distance, words can easily be flagged as misspellings of other words. However, the edit distance that constitutes a misspelling will ...
Seán Healy's user avatar
2 votes
1 answer
1k views

I've recently been working with Oracle DB, and when evaluating their matching functions (in this case, EDIT_DISTANCE and EDIT_DISTANCE_SIMILARITY, which - I think - implement unnormalized and ...
PixelMaster's user avatar
3 votes
1 answer
816 views

I have a function to compute String edit distance in C++: #include <string> #include <vector> #include <algorithm> size_t sed_diff(const std::string & a, const std::string & ...
Lukáš Moravec's user avatar
3 votes
2 answers
1k views

Edit distance is a famous class of problems including: Different types of edit distance allow different sets of string operations. For instance: The Levenshtein distance allows deletion, insertion ...
VIAGC's user avatar
  • 860
0 votes
1 answer
144 views

I'm looking for the most efficient way of solving an Levenshtein edit distance problem. We are given as input: A set of strings S of size n <= 8, with average length m <= 50 A target string t of ...
Mathguy's user avatar
  • 157
0 votes
0 answers
90 views

I am calculating edit distance between two dataframe. Both the dataframe consists of ~30L of rows, as the dataframe size is large it is taking lot of time. Is there any way to improve the performance? ...
A14's user avatar
  • 111
2 votes
0 answers
70 views

has anyone ever done or seen something like this? I have two disconnected graphs of the same size with the same nodes but different edges. They may contain connected components. I want to compare one ...
Jonathan Langer's user avatar
0 votes
1 answer
145 views

I have the following data frame. Input: class id q1 q2 q3 q4 Ali 12 1 2 3 3 Tom 16 1 2 4 2 Tom 18 1 2 3 4 Ali 24 2 2 4 3 Ali 35 2 2 4 3 Tom ...
Sandy's user avatar
  • 1,148
3 votes
1 answer
238 views

Enviornment- java version "11.0.12" 2021-07-20 LTS, solr-8.9.0 I have the following field declaration for my Solr index: <field name="Field1" type="string" multiValued=...
user595014's user avatar
0 votes
0 answers
249 views

I am new to numpy(and python) and working on making the edit distance Algorithm with numpy. This is my code so far. I have an error for the first line after the else: . The error says: "index 3 ...
Moronis2234's user avatar

15 30 50 per page
1
2 3 4 5
18