Inexact tree pattern matching with 1-degree edit distance using finite automata (Q2689648)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7662544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inexact tree pattern matching with 1-degree edit distance using finite automata |
scientific article; zbMATH DE number 7662544 |
Statements
Inexact tree pattern matching with 1-degree edit distance using finite automata (English)
0 references
13 March 2023
0 references
inexact tree pattern matching
0 references
approximate tree pattern matching
0 references
1-degree edit distance
0 references
finite automaton
0 references
dynamic programming
0 references
0.7886565923690796
0 references
0.7884330153465271
0 references
0.7700148224830627
0 references
0.7692220211029053
0 references
