| 1 |
Enhanced Matching of Children’s Faces in “Super-Recognisers” But Not High-Contact Controls
|
|
|
|
BASE
|
|
Show details
|
|
|
| 2 |
A Semi-Automated Approach for Multilingual Terminology Matching: Mapping the French Version of the ICD-10 to the ICD-10 CM
|
|
|
|
In: ISSN: 0926-9630 ; EISSN: 1879-8365 ; Studies in Health Technology and Informatics ; https://hal.archives-ouvertes.fr/hal-02887372 ; Studies in Health Technology and Informatics, IOS Press, 2020, 270, pp.18-22. ⟨10.3233/SHTI200114⟩ (2020)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
DeezyMatch: A Flexible Deep Learning Approach to Fuzzy String Matching ...
|
|
: Association for Computational Linguistics, 2020
|
|
BASE
|
|
Show details
|
|
|
| 4 |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures
|
|
|
|
BASE
|
|
Show details
|
|
|
| 5 |
String Indexing with Compressed Patterns
|
|
Bille, Philip; Steiner, Teresa Anna. - : LIPIcs - Leibniz International Proceedings in Informatics. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), 2020
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Extracting Problem Linkages to Improve Knowledge Exchange between Science and Technology Domains using an Attention-based Language Model ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 9 |
Extracting Problem Linkages to Improve Knowledge Exchange between Science and Technology Domains using an Attention-based Language Model ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Practical Performance of Space Efficient Data Structures for Longest Common Extensions ...
|
|
|
|
BASE
|
|
Show details
|
|
|
| 15 |
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures ...
|
|
Nakashima, Katsuhito; Fujisato, Noriki; Hendrian, Diptarama; Nakashima, Yuto; Yoshinaka, Ryo; Inenaga, Shunsuke; Bannai, Hideo; Shinohara, Ayumi; Takeda, Masayuki. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020
|
|
Abstract:
Two strings x and y over Σ ∪ Π of equal length are said to parameterized match (p-match) if there is a renaming bijection f:Σ ∪ Π → Σ ∪ Π that is identity on Σ and transforms x to y (or vice versa). The p-matching problem is to look for substrings in a text that p-match a given pattern. In this paper, we propose parameterized suffix automata (p-suffix automata) and parameterized directed acyclic word graphs (PDAWGs) which are the p-matching versions of suffix automata and DAWGs. While suffix automata and DAWGs are equivalent for standard strings, we show that p-suffix automata can have Θ(n²) nodes and edges but PDAWGs have only O(n) nodes and edges, where n is the length of an input string. We also give O(n |Π| log (|Π| + |Σ|))-time O(n)-space algorithm that builds the PDAWG in a left-to-right online manner. As a byproduct, it is shown that the parameterized suffix tree for the reversed string can also be built in the same time and space, in a right-to-left online manner. ... : LIPIcs, Vol. 161, 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020), pages 26:1-26:14 ...
|
|
Keyword:
DAWGs; parameterized matching; suffix automata; suffix trees
|
|
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12151/
https://dx.doi.org/10.4230/lipics.cpm.2020.26
|
|
BASE
|
|
Hide details
|
|
|
| 17 |
Research on Uyghur Pattern Matching Based on Syllable Features
|
|
|
|
In: Information ; Volume 11 ; Issue 5 (2020)
|
|
BASE
|
|
Show details
|
|
|
| 18 |
Scalable Name Lookup for NDN Using Hierarchical Hashing and Patricia Trie
|
|
|
|
In: Applied Sciences ; Volume 10 ; Issue 3 (2020)
|
|
BASE
|
|
Show details
|
|
|
| 19 |
How Much Do We Learn from Addresses? On the Syntax, Semantics and Pragmatics of Addressing Systems
|
|
|
|
In: ISPRS International Journal of Geo-Information ; Volume 9 ; Issue 5 (2020)
|
|
BASE
|
|
Show details
|
|
|
|
|
