java - Spell-Check: Find one-to-one token difference mapping between two strings -


i stumbled on question on internet archive , having difficulty wrapping head around it. want find desired mapping amongst different tokens between 2 strings. output should string-to-string map.

for example:

string1: hewlottpackardenterprise helped american raleways in n y

string2: hewlett packard enterprise helped american railways in ny

output:
hewlottpackardenterprise -> hewlett packard enterprise

hewlott -> hewlett

raleways -> railways

n y -> ny

note: have been able write edit-distance method, finds types of edits (segregated types, deletion, substitution etc.) , can convert first string second convert method

what have tried far?

approach 1: began naive approach of splitting both strings space, inserting tokens of first string hash map , comparing tokens of other string hashmap. however, approach fails misses on relevant mappings.

approach 2: utilize covert method find edit positions in string, , type of edits. using space edits, i'm able create mapping hewlottpackardenterprise -> hewlett packardenterprise. however, method explodes more , more things need splitted within same word.

appreciate thoughts in regard! clear doubts in comments.

public string returnwhitespaceedittoken(editdone e, list<string> testtokens) {     int pos = e.pos, count=0, i=0;     string resulttoken = null;      if (e.type.equals(deleteedit)) {         (i=0;i<testtokens.size();i++) {             count+=testtokens.get(i).length();             if (count==pos) {                 break;             }             if (i!=testtokens.size()-1) {                 count++;             }         }          resulttoken = testtokens.get(i) + " " + testtokens.get(i+1);     } else if (e.type.equals(insertedit)) {         (i=0;i<testtokens.size();i++) {             count+=testtokens.get(i).length();             if (count>pos) {                 break;             }             if (i!=testtokens.size()-1) {                 count++;              }         }         string token = testtokens.get(i);         resulttoken = token.substring(count-token.length(), pos) + token.substring(pos, count);     }     return resulttoken; }

a pretty common way of handling problems find longest common subsequence (or it's dual shortest edit script) between 2 strings , post-process output specific format want; in case string maps.

wikipedia has pretty decent introduction problem here: https://en.wikipedia.org/wiki/longest_common_subsequence_problem

and great paper "an o(nd) difference algorithm , variations" myers can found here. http://www.xmailserver.org/diff2.pdf


Comments

Post a Comment

Popular posts from this blog

android - InAppBilling registering BroadcastReceiver in AndroidManifest -

i'm implementing inapp billing in android app. works well, however, i'm trying decouple broadcast receiver activity manifest. suggestion in android's trivialdrive sample: // important: dynamically register broadcast messages updated purchases. // register receiver here instead of <receiver> in manifest // because call getpurchases() @ startup, therefore can ignore // broadcasts sent while app isn't running. // note: registering listener in activity bad idea, done here // because sample. regardless, receiver must registered after // iabhelper setup, before first call getpurchases(). currently there's class extends broadcastreceiver : public class iabbroadcastreceiver extends broadcastreceiver { /** * intent action receiver should filter for. */ public static final string action = "com.android.vending.billing.purchases_updated"; private final iabbroadcastlistener mlistener; public iabbroadcastreceiver(iabbroadcastlistener listener) { m...
Read more

python Tkinter Capturing keyboard events save as one single string -

is possible store keyboard events 1 string? code below stores 1 char , prints it. card reader or bar code reader, contains collection of character/ string not 1 character @ time. goal save char pressed text variable. from tkinter import * root = tk() def key(event): text= event.char text+= event.char print ("pressed", text) def callback(event): frame.focus_set() print ("clicked at", event.x, event.y) frame = frame(root, width=100, height=100) frame.bind("<key>", key) frame.bind("<button-1>", callback) frame.pack() root.mainloop() currently, creating text variable , everytime key() function gets called, , text stores last character typed. you can define text module level variable , , use module level text inside key function - text = '' def key(event): global text text+= event.char print("pressed", text)
Read more

sql server - Why does Linq-to-SQL add unnecessary COUNT()? -

here tables: create table customer ( cid int primary key, name varchar(32) ) create table ord ( oid int primary key, cid int foreign key references customer, address varchar(20) ) here's linq-to-sql statement: var aaa = c in db.customer select new { c, o = c.ord.tolist() }; and here's inexplicable query generated linq-to-sql: select [t0].[cid] [cid], [t0].[name] [name], [t1].[oid] [oid], [t1].[cid] [cid2], [t1].[address] [address], (select count(*) [dbo].[ord] [t2] [t2].[cid] = [t0].[cid]) [value] [dbo].[customer] [t0] left outer join [dbo].[ord] [t1] on [t1].[cid] = [t0].[cid] order [t0].[cid], [t1].[oid] i want understand how rid of count(*) part. it's entirely uncalled for! linq needs count(*) in order determine number of entries returned o = c.ord.tolist() .
Read more