EDBT 2026 Demo / reviewers in the wild / expert
Teruo Okuda
dblp:34/2524
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1976
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Algorithms and data structures · 67% Coding theory · 33% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › sequence algorithms › string algorithms › string matching
approximate string matching |
0.0 | 1 | 1976 | A Method for the Correction of Garbled Words Based on the Levenshtein Metric · IEEE Trans. Computers 1976 |
Coding theory › error-correcting codes
levenshtein distance |
0.0 | 1 | 1976 | A Method for the Correction of Garbled Words Based on the Levenshtein Metric · IEEE Trans. Computers 1976 |
Algorithms and data structures › sequence algorithms
string algorithms |
0.0 | 1 | 1976 | A Method for the Correction of Garbled Words Based on the Levenshtein Metric · IEEE Trans. Computers 1976 |
Information retrieval › query understanding
spelling correction |
0.0 | 1 | 1976 | A Method for the Correction of Garbled Words Based on the Levenshtein Metric · IEEE Trans. Computers 1976 |
Methods — techniques the papers use, named apart from their topics
weighted levenshtein distance · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1976 | A Method for the Correction of Garbled Words Based on the Levenshtein MetricabstractIn this paper we propose a new method for correcting garbled words based on Levenshtein distance and weighted Levenshtein distance. We can correct not only substitution errors, but also insertion errors and deletion errors by this method. According to the results of simulation on nearly 1000 high occurrence English words, higher error correcting rates can be achieved by this method than any other method tried to date. Hardware realization of the method is possible, though it is rather complicated. Teruo Okuda, Eiichi Tanaka, Tamotsu Kasai |
IEEE Trans. Computers | 1 |