Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory 10 (1966) 707--710  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Book Title - Book Editors Ios (Correct)
No context found.
Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory 10 (1966) 707--710
Dealing with Hardware Space Limits When Removing.. - Giraud, Lavenier (2005) (Correct)
No context found.
Vladimir I. Levenshtein. Binary codes capable of correcting deletions. Soviet Physics Doklady, 10(8):707--710, 1966.
BLANC: Learning Evaluation Metrics for MT - Lita, Rogati, Lavie (2005) (Correct)
No context found.
V.I. Levenshtein. 1965. Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk SSSR.
Pattern Recognition 39 (2006) 317 -- 327 - Www Elsevier Com (2006) (Correct)
No context found.
V.I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Sov. Phys. Dokl. 6 (1966.
G.A. Vouros and T. Panayiotopoulos (Eds.): SETN.. - Springer-Verlag.. (Correct)
No context found.
Levenshtein, V. I.: Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl., 6 (1966) 707-710.
S. Marinai and A. Dengel (Eds.): DAS 2004, LNCS.. - Springer-Verlag.. (2004) (Correct)
No context found.
Levenshtein, V. I.: Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl., 6 (1966) 707-710
Exploring Syntactic Relation Patterns for Question Answering - Shen, Kruijff, Klakow (2005) (1 citation) (Correct)
No context found.
Levenshtein, V. I.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Doklady Akademii Nauk SSSR 163(4) (1965) 845-848
CDER: Efficient MT Evaluation Using Block Movements - Leusch, Ueffing, Ney (2006) (1 citation) (Correct)
No context found.
V. I. Levenshtein. 1966. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10(8):707--710, Feb.
Detecting Similarities in Ontologies with the.. - Ziegler, Kiefer.. (2006) (Correct)
No context found.
V. I. Levenshtein. Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady, 10:707--710, 1966.
Weighted Kernel Functions for SVM Learning in String.. - Vanschoenwinkel.. (2005) (Correct)
No context found.
V. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics - Doklady 10,, 10:707--710, 1966.
Appropriate Kernel Functions for Support Vector Machine .. - Vanschoenwinkel.. (2005) (Correct)
No context found.
Levenshtein, V.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics - Doklady 10, 10 (1966) 707--710
Approximate Nearest Neighbors and Sequence Comparison - With Block Operations (Correct)
No context found.
V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Cybernetics and Control Theory, 10(8):707-710, 1966.
Generic Similarity Detection in Ontologies with the - Soqa-Simpack Toolkit Patrick (2006) (Correct)
No context found.
V. I. Levenshtein. Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady, 10:707--710, 1966.
Relaxed Precision and Recall for Ontology Matching - Marc Ehrig Institute (Correct)
No context found.
I. V. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory, 1966.
Personalized Information Access in a Bibliographic.. - Haase, Ehrig, Hotho, .. (2004) (Correct)
No context found.
Levenshtein, I. V. 1966. Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory.
Proceedings of the 9th Conference on Computational Natural.. - Pages Ann Arbor (Correct)
No context found.
V. Levenshtein. 1965. Binary codes capable of correcting deletions, insertions and reversals. Doklady Akademii Nauk SSSR, 163(4):845--848.
Bit-Parallel Approximate String Matching Algorithms with.. - Hyyrö (2003) (Correct)
No context found.
V. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10(8):707--710, 1966. Original in Russian in Doklady Akademii Nauk SSSR, 163(4):845--848, 1965.
On Bit-parallel Processing of Multi-byte Text - Hyyrö, Takaba, Shinohara, Takeda (2004) (Correct)
No context found.
Levenshtein, V.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10(8):707--710, 1966.
Practical Methods for Approximate String Matching - Hyyrö (Correct)
No context found.
V. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10(8):707--710, 1966.
Increased Bit-Parallelism for Approximate String Matching - Hyyrö, Fredriksson, Navarro (Correct)
No context found.
V. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10(8):707--710, 1966. Original in Russian in Doklady Akademii Nauk SSSR, 163(4):845--848, 1965.
Applying Spelling Error Correction Techniques - For Improving Semantic (2005) (Correct)
No context found.
V. Levenshtein. 1965. Binary codes capable of correcting deletions, insertions and reversals. Doklady Akademii Nauk SSSR, 163(4):845--848.
Bootstrapping Ontology Alignment Methods with APFEL - Ehrig, Staab, Sure (2005) (Correct)
No context found.
I. V. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory, 1966.
XAROP: A Midterm Report in Introducing a.. - Tempich, Ehrig.. (2004) (1 citation) (Correct)
No context found.
Levenshtein, I.V.: Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory (1966)
Ontology Mapping - An Integrated Approach - Ehrig, Sure (2004) (Correct)
No context found.
I. V. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory, 1966.
Efficiency of Ontology Mapping Approaches - Ehrig, Staab (2004) (Correct)
No context found.
Levenshtein, I.V.: Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory (1966)
First 50 documents Next 50
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