Search

Your search keyword '"Oliveira, Arlindo"' showing total 13 results
Start Over Author "Oliveira, Arlindo" Topic edit distance
13 results on '"Oliveira, Arlindo"'

1. Indexed Hierarchical Approximate String Matching

Author

Russo, Luís M. S., Navarro, Gonzalo, Oliveira, Arlindo L., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Amir, Amihood, editor, Turpin, Andrew, editor, and Moffat, Alistair, editor

Published
2009
Full Text
View/download PDF

2. Faster Generation of Super Condensed Neighbourhoods Using Finite Automata

Author

Russo, Luís M. S., Oliveira, Arlindo L., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Consens, Mariano, editor, and Navarro, Gonzalo, editor

Published
2005
Full Text
View/download PDF

3. Constraint Relaxations for Discovering Unknown Sequential Patterns

Author

Antunes, Cláudia, Oliveira, Arlindo L., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goethals, Bart, editor, and Siebes, Arno, editor

Published
2005
Full Text
View/download PDF

4. An Efficient Algorithm for Generating Super Condensed Neighborhoods

Author

Russo, Luís M. S., Oliveira, Arlindo L., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Apostolico, Alberto, editor, Crochemore, Maxime, editor, and Park, Kunsoo, editor

Published
2005
Full Text
View/download PDF

5. Efficient generation of super condensed neighborhoods.

Author

Russo, Luís M.S. and Oliveira, Arlindo L.

Subjects
DYNAMIC programming, ALGORITHMS, MACHINE theory, NEIGHBORHOODS
Abstract

Abstract: Indexing methods for the approximate string matching problem spend a considerable effort generating condensed neighborhoods. Condensed neighborhoods, however, are not a minimal representation of a pattern neighborhood. Super condensed neighborhoods, proposed in this work, are smaller, provably minimal and can be used to locate approximate matches that can later be extended by on-line search. We present an algorithm for generating Super Condensed Neighborhoods. The algorithm can be implemented either by using dynamic programming or non-deterministic automata. The time complexity is for the first case and for the second, where m is the pattern size, s is the size of the super condensed neighborhood and k the number of errors. Previous algorithms depended on the size of the condensed neighborhood instead. These algorithms can be implemented using Bit-Parallelism and Increased Bit-Parallelism techniques. Our experimental results show that the resulting algorithms are fast and achieve significant speedups, when compared with the existing proposals that use condensed neighborhoods. [Copyright &y& Elsevier]

Published
2007
Full Text
View/download PDF

13. Non-adjacent Digrams Improve Matching of Cross-Lingual Spelling Variants

Author

Kari Visala, Heikki Keskustalo, Ari Pirkola, Erkka Leppänen, Kalervo Järvelin, Nascimento, Mario A, De, Moura Edleno S, Oliveira, Arlindo L, and University of Tampere

Subjects
Matching (statistics), Information retrieval, business.industry, Computer science, InformationSystems_INFORMATIONSTORAGEANDRETRIEVAL, String searching algorithm, Approximate string matching, computer.software_genre, Spelling, Index (publishing), Tietojenkäsittelyoppi ja informaatiotieteet - Computer and information sciences, Multilingualism, Edit distance, Artificial intelligence, business, computer, Word (computer architecture), Natural language processing
Abstract

Untranslatable query keys pose a problem in dictionary-based cross-language information retrieval (CLIR). One solution consists of using approximate string matching methods for finding the spelling variants of the source key among the target database index. In such a setting, it is important to select a matching method suited especially for CLIR. This paper focuses on comparing the effectiveness of several matching methods in a cross-lingual setting. Search words from five domains were expressed in six languages (French, Spanish, Italian, German, Swedish, and Finnish). The target data consisted of the index of an English full-text database. In this setting, we first established the best method among six baseline matching methods for each language pair. Secondly, we tested novel matching methods based on binary digrams formed of both adjacent and non-adjacent characters of words. The latter methods consistently outperformed all baseline methods.

Published
2003

Catalog

Books, media, physical & digital resources
See catalog results