Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Jan Daciuk"'
Autor:
Jan Daciuk
Publikováno v:
Computational Linguistics, Vol 30, Iss 2 (2021)
Externí odkaz:
https://doaj.org/article/413658c4cd2a4804b86eac6826fdb971
Publikováno v:
Computational Linguistics, Vol 26, Iss 1 (2021)
Externí odkaz:
https://doaj.org/article/8ba73a7f7c0f46358d85d8fe77045997
Autor:
Jan Daciuk, Rafael C. Carrasco
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 43:779-790
We describe a technique that maps unranked trees to arbitrary hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to other hashing techniques based on automata, our procedure builds a pseudo-minimal DTA for this purpose. A ps
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df4fa5f0c3d5836f7b3fc4880448abf8
https://doi.org/10.1051/ita/2009018
https://doi.org/10.1051/ita/2009018
Publikováno v:
Algorithmica. 55:95-110
We describe an algorithm that allows the incremental addition or removal of unranked ordered trees to a minimal frontier-to-root deterministic finite-state tree automaton (DTA). The algorithm takes a tree t and a minimal DTA A as input; it outputs a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cde134527617e9bbeeaaeebd6fd3a29a
https://doi.org/10.1007/s00453-008-9172-4
https://doi.org/10.1007/s00453-008-9172-4
Autor:
Jan Daciuk
Publikováno v:
Computational Linguistics. 30:227-235
In a recent article, Carrasco and Forcada (June 2002) presented two algorithms: one for incremental addition of strings to the language of a minimal, deterministic, cyclic automaton, and one for incremental removal of strings from the automaton. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6b161d6b5d56474ee88b487e4a112309
https://doi.org/10.1162/089120104323093302
https://doi.org/10.1162/089120104323093302
Autor:
Jan Daciuk, Dawid Weiss
Publikováno v:
Implementation and Application of Automata ISBN: 9783642222559
CIAA
CIAA
This paper is a follow-up to Jan Daciuk's experiments on space-efficient finite state automata representation that can be used directly for traversals in main memory [4]. We investigate several techniques of reducing the memory footprint of minimal a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ff1e2a5841f7f1a25a2786523ce28e9
https://doi.org/10.1007/978-3-642-22256-6_12
https://doi.org/10.1007/978-3-642-22256-6_12
Publikováno v:
Scientific Applications of Language Methods
Rozdzial przedstawia wykorzystanie automatow skonczonych jako slownikow jezyka naturalnego. Podane są podstawy teoretyczne. Omowione są zastosowania: realizacja doskonalej funkcji mieszającej, analizy i syntezy morfologicznej, poprawiania pisowni
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47f4ea8d11c791a0519ad2b4c1b80216
https://doi.org/10.1142/9781848165458_0004
https://doi.org/10.1142/9781848165458_0004
Autor:
Jan Daciuk, Jakub Piskorski
Publikováno v:
Advances in Soft Computing ISBN: 9783540335207
Intelligent Information Systems
Intelligent Information Systems
Finite-state automata are state-of-the-art representation of dictionaries in natural language processing. We present a novel compression technique that is especially useful for gazetteers - a particular sort of dictionaries. We replace com- mon subst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5fbdd704feab28b89fd3f4c2fbb68b92
https://doi.org/10.1007/3-540-33521-8_9
https://doi.org/10.1007/3-540-33521-8_9
Publikováno v:
Advances in Soft Computing ISBN: 3540250565
Intelligent Information Systems
Intelligent Information Systems
Minimal perfect hashing provides a mapping between a set of n unique words and n consecutive numbers. When implemented with minimal finite-state automata, the mapping is determined only by the (usually alphabetical) order of words in the set. Additio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3eb10d71ea0c7a63a973e87f30c2e66
https://doi.org/10.1007/3-540-32392-9_18
https://doi.org/10.1007/3-540-32392-9_18
Publikováno v:
Implementation and Application of Automata ISBN: 9783540310235
CIAA
CIAA
Pseudo-minimal automata ([1],[2]) are minimal acyclic automata that have a proper element (a transition or a state) for each word belonging to the language of the automaton. That proper element is not shared with any other word, and it can be used fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24f24560a46c755b4a4f21fd7062a86a
https://doi.org/10.1007/11605157_29
https://doi.org/10.1007/11605157_29