V. I. Levenshtein, "A binary code capable of correcting spurious insertions and deletions of ones," Cybernetics and Control Theory, 10(8):707--710, (1966).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....rather than synonyms from a general thesaurus. We use four character based string matching techniques to generate similarities. First, we apply some standard information retrieval style stemming to get a root for each name [Por80] Next, we combine variations of the Levenshtein edit distance [Lev65] soundex [HD80] and longest common subsequence algorithms to generate a similarity value. Finally, we apply a heuristic to detect if the object set is a specialization of the data frame. The Levenshtein edit distance algorithm calculates the number of characters that need to be added, deleted ....

V. I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1:8--17, 1965.

....space where the universe is the set of strings over some alphabet, i.e. X = Sigma , and the distance function is the so called edit distance or Levenshtein distance. This is defined as the minimum number of character insertions, deletions and substitutions necessary to make two strings equal [19, 25]. The edit distance, and in fact any other distance defined as the best way to convert one element into the other, is reflexive, strictly positive (as long as there are no zero cost operations) symmetric (as long as the operations allowed are symmetric) and satisfies the triangle inequality. ....

V. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1:8--17, 1965.

....Another way of encoding a set is to write the set down as a string consisting of the set s elements in sorted order. Insertions and deletions from a set then correspond to insertions and deletions from the corresponding string 67 The spurious error correction model introduced by Levenshtein [35] allows for errors that take the form of insertions or deletions into a string, along with in place replacements. Through the encoding described above, spurious error correction algorithms can be used as the basis for set reconciliation algorithms. Many methods have been proposed in the ....

V.I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1(1):8--17, 1965.

....i the ith element of B b is in S. Thus, di erences between two sets result in bitwise errors in the corresponding bit string representations. The length of this representation, however, makes this approach computationally infeasible. The spurious error correction model, introduced by Levenshtein [19], allows for errors to be insertions or deletions of letters in addition to in place replacements. A spurious error correction algorithm can be applied to set reconciliation by treating a set S as a string consisting of the elements of S listed in lexicographic order. Insertions and deletions from ....

V.I. Levenshtein, \Binary codes capable of correcting spurious insertions and deletions of ones," Problems of Information Transmission, vol. 1, no. 1, pp. 8-17, 1965.

....components or structure Considers structure or components of documents, for example references, abstract, title, keywords and . in research papers Citation analysis, ParaSite Table 5. Three models of measuring document to document similarity [Data from 26, 30] In Levenshtein distance [27], the difference between two strings is the number of insertions, deletions, or substitutions of letters required to transform one string into another. In LikeIt [28, 29] a string distance is based on an algorithm that tries to build an optimal weighted matching of the letters and multi graphs ....

V. I. Levenshtein, Binary codes capable of correcting spurious insertions and deletions of ones (original in Russian), Russian Problemy Peredachi Informatsii 1, pp. 12--25, 1965.

....professors. It is based on the following observations: 1. A faculty member s email address is usually very similar to his her homepage URL. 2. The email address userid is usually very similar to his her name. To determine string similarity, we used a normalized version of Levenshtein Distance [4]. Levenshtein Distance computes the differences between two strings, where we would count a difference not only when strings have different characters but also when one has a character whereas the other does not. The character is used to detect all email addresses occurring within a homepage. ....

Levenshtein V. I. "Binary Codes Capable of Correcting Spurious Insertions and Deletions of Ones (Orginal in Russian)", Russian Problemy Peredachi Informatsii, 1:12-25, 1965.

....space where the universe is the set of strings over some alphabet, i.e. X = Sigma , and the distance function is the so called edit distance or Levenshtein distance. This is defined as the minimumnumber of character insertions, deletions and replacements necessary to make two strings equal [22, 28]. The edit distance, and in fact any other distance defined as the best way to convert one element into the other, is reflexive, strictly positive (as long as there are no zero cost operations) symmetric (as long as the operations allowed are symmetric) and satisfies the triangular inequality. ....

V. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1:8--17, 1965.

....pattern word. There are many forms to de ne cost , but a popular one is the minimum number of insertions, deletions, substitutions and transposition of adjacent characters that are necessary to convert the text word into the pattern word. This is a variant over the original Levenshtein distance [8, 9]. The e ectiveness of this cost measure is well known. For instance, about 80 of the typical typing errors are corrected allowing just one insertion, deletion, substitution or transposition [5] It is also known, however [14, 7] that making every such operation to cost 1 (i.e. just counting the ....

V. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1:8-17, 1965.

....retrieval system has been studied extensively but remains an open problem. For samples consisting of text such as Web pages or e mail, a gamut of techniques can be used such as TFIDF (Term Frequency Theta Inverse Document Frequency) 71, 72] Latent Semantic Indexing [23, 7] and edit distances [47, 90]. User Based Classifiers Rather than build artificial feature extractors directly, humans themselves can judge and classify the records in the database. This is often used in collaborative filtering applications [52, 67, 34] where a user specifies a small set of positive examples of the ....

V. I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones (original in Russian). Russian Problemy Peredachi Informatsii, 1:12--25, January 1965. 142

....programming with branch and bound) to show that the largest single deletion correcting codes of lengths 8 and 9 have sizes 30 and 52, respectively. On Single Deletion Correcting Codes 3 More conventional search methods, in particular, consulting some wellknown papers of Levenshtein [Lev65] Lev65a] on codes for correcting deletions, turned up many other relevant references. Some of these will be discussed further in Section 6. The most interesting codes are those of Varshamov and Tenengolts [VT65] In [VT65] they present a family of codes depending on a certain parameter a. When a is taken ....

....000111 , 5) of sizes 1,2,2,4,6, matching (1) and (2) These codes were introduced in [VT65] for correcting errors on a Z channel (or asymmetric channel) Similar constructions have been used in [BR82] and also in [GS80] and [Kl81] to construct constant weight codes. Levenshtein [Lev65] Lev65a] observed that the Varshamov Tenengolts codes could be used for correcting single deletions, proving this by giving the following elegant decoding algorithm. Decoding algorithm 4 N. J. A. Sloane . Suppose a codeword x = x 1 , xn ) # V T a (n) is transmitted, the symbol s in position ....

[Article contains additional citation context not shown here]

V. I. Levenshtein, Binary codes capable of correcting spurious insertions and deletions of ones (in Russian), Problemy Peredachi Informatsii, 1 (No. 1, 1965), 12--25. English translation in Problems of Information Transmission, 1 (No. 1, 1965), 8--17.

.... versions of a word existed, like those of Blair [10] Damerau [14] and the popular Soundex method, described for instance in [21, 17] However, some time elapsed until it was realized [34] that such ad hoc models were inferior 1 to simple variants of the so called Levenshtein (or edit) distance [23, 24]. The edit distance between two strings is defined as the minimum number of character insertions, deletions and replacements needed to make them equal. For example, the edit distance between color and colour is 1, while between survey and surgery is 2. Phonetic issues can be incorporated ....

V. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1:8--17, 1965.

....distance measures between bodies of text rely on models of similarity of groups of letters in the text. One type of text distance measure is the string distance or edit distance which considers distance as the amount of difference between strings of symbols. For example, the Levenshtein distance [11] is a well known early edit distance where the difference between two text strings is simply the number of insertions, deletions, or substitutions of letters required to transform one string into another. A more recent and sophisticated example is LikeIt, as mentioned earlier. Another type of text ....

V. I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones (original in Russian). Russian Problemy Peredachi Informatsii, 1:12--25, 1965.

....Web Agent for Automatic Retrieval and Identification of Interesting Publications Kurt D. Bollacker 1;2 , Steve Lawrence 2 , and C. Lee Giles 2;3 fkurt,lawrence,gilesg research.nj. nec.com 1 University of Texas at Austin 2 NEC Research Institute 3 UMIACS, University of Maryland Austin, TX 78712 Princeton, NJ 08540 College Park, MD 20742 Abstract Published research papers available on the World Wide Web (WWW or Web) are often poorly organized, often exist in non text form (e.g. Postscript) documents, and increase in quantity daily. Significant amounts of time and effort are commonly ....

....Agent for Automatic Retrieval and Identification of Interesting Publications Kurt D. Bollacker 1;2 , Steve Lawrence 2 , and C. Lee Giles 2;3 fkurt,lawrence,gilesg research.nj. nec.com 1 University of Texas at Austin 2 NEC Research Institute 3 UMIACS, University of Maryland Austin, TX 78712 Princeton, NJ 08540 College Park, MD 20742 Abstract Published research papers available on the World Wide Web (WWW or Web) are often poorly organized, often exist in non text form (e.g. Postscript) documents, and increase in quantity daily. Significant amounts of time and effort are commonly ....

[Article contains additional citation context not shown here]

LEVENSHTEIN, V. I. Binary codes capable of correcting spurious insertions and deletions of ones (original in Russian). Russian Problemy Peredachi Informatsii 1 (January 1965), 12--25.

....correcto (de acuerdo al c odigo corrector de errores usado) y m as cercano al mensaje recibido. Si bien esta area no se ha desarrollado mucho con respecto a la b usqueda aproximada, ha generado la medida m as importante de similaridad, conocida como la distancia de Levenshtein (o de edici on) Lev65, Lev66] La biolog ia computacional se ha desarrollado y evolucionado mucho desde entonces, con un empuje especial en los ultimos a nos gracias a proyectos que apuntan a decodificar el ADN y a sus aplicaciones potenciales. El procesamiento de se nales es tambi en un area muy activa. Las ....

.... de distancia [KS95, PW95] El lector interesado en obtener m as informaci on sobre el nacimiento de esta area puede consultar [SK83] En particular, Wat95, BSSU74, WL83, GK82, KG82] son buenas referencias para las aplicaciones de b usqueda aproximada en biolog ia computacional, as i como [DM79, Lev65, Vin68, LS97] para el procesamiento de se nales. Hoy en d ia han aparecido una cantidad de nuevas aplicaciones para b usqueda aproximada. El campo de bases de datos multimedia, de r apido desarrollo, necesita algoritmos para buscar un patr on en una se nal f isica (no s olo audio) donde es ....

[Article contains additional citation context not shown here]

V. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1:8--17, 1965.

....0 to k, while if x is derived from y by inserting a one f(y) increases by an integer ranging from k 1 to n 1. As OE(x) is f(x) mod (n 2) it too is different for every supersequence x of y. This one insertion protocol is related to an insertion deletion code of Varshamov and Tenengolt s [16]. This code consists of all n bit codewords x with a fixed P n i=1 ix i mod (n 2) We note however that an efficient code does not imply an efficient one way protocol. An efficient protocol corresponds to a collection of disjoint efficient codes that cover f0;1g . 2 To derive a protocol for ....

V. I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information transmission, 1(1):8--17, 1965.

No context found.

V. I. Levenshtein, "A binary code capable of correcting spurious insertions and deletions of ones," Cybernetics and Control Theory, 10(8):707--710, (1966).

No context found.

V. I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones (original in Russian). Russian Problemy Peredachi Informatsii 1, 12--25, 1965.

No context found.

V. Levenshtein, "Binary codes capable of correcting spurious insertions and deletions of ones", Problems of Information Transmission, 1:8--17, 1965.

No context found.

V. I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Russian Problemy Peredachi Informatsii, pages 1:12--25, 1965.

No context found.

Levenshtein, V.I.: Binary codes capable of correcting spurious insertions and deletions of ones (original in russian). Russian Problemy Peredachi Informatsii 1 (1965) 12--25

No context found.

V. I. Levenshtein, "Binary codes capable of correcting spurious insertions and deletions of ones," Problems of Information transmission, vol. 1, no. 1, pp. 8--17, 1965.

No context found.

V. I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. In Russiaa Problem s Peredachi Iaformatsii, pages 1:12 25, 1965.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC