Approximate String Matching by Fuzzy Automata

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F09%3A00010243" target="_blank" >RIV/61989592:15310/09:00010243 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Approximate String Matching by Fuzzy Automata

Original language description

We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata. This technique can be used to search or match strings in special cases when some pairs of symbols are more similar to each other than the others. This kind of similarity cannot be handled by usual searching algorithms.We present sample situations, which would use this kind of searching. Then we define a fuzzy automaton, and some basic constructions we need for our purposes. We continue with definition of our fuzzyautomaton based approximate string matching algorithm, and add some notes to fuzzy-trellis construction which can be used for approximate searching.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Advances in Soft Computing

ISSN

1615-3871

e-ISSN

—

Volume of the periodical

59

Issue of the periodical within the volume

59

Country of publishing house

DE - GERMANY

Number of pages

10

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—