Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Gabriel Infante-Lopez"'
Publikováno v:
Algorithms, Vol 4, Iss 4, Pp 262-284 (2011)
The smallest grammar problem—namely, finding a smallest context-free grammar that generates exactly one sequence—is of practical and theoretical importance in fields such as Kolmogorov complexity, data compression and pattern discovery. We propos
Externí odkaz:
https://doaj.org/article/67a87f6420214577a7b290ed7a2a4f18
Publikováno v:
Research in Computing Science. 65:35-50
Unsupervised dependency parsing is acquiring great relevance in the area of Natural Language Processing due to the increasing number of utterances that become available on the Internet. Most current works are based on Depen- dency Model with Valence
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df30798b585633cbe2da4d5eb7a06906
https://doi.org/10.13053/rcs-65-1-3
https://doi.org/10.13053/rcs-65-1-3
Publikováno v:
Journal of Logic, Language and Information. 15:219-231
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering out unwanted parses. Probabilities in PCFGs induce an ordering relatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8816e3b3073615fb9c585b24bd538d7d
https://doi.org/10.1007/s10849-005-9002-x
https://doi.org/10.1007/s10849-005-9002-x
Publikováno v:
Journal of Discrete Algorithms
Journal of Discrete Algorithms, 2012, Special issue on Stringology, Bioinformatics and Algorithms, 11, pp.62-72. ⟨10.1016/j.jda.2011.04.006⟩
Journal of Discrete Algorithms, Elsevier, 2012, Special issue on Stringology, Bioinformatics and Algorithms, 11, pp.62-72. ⟨10.1016/j.jda.2011.04.006⟩
Journal of Discrete Algorithms, 2012, Special issue on Stringology, Bioinformatics and Algorithms, 11, pp.62-72. ⟨10.1016/j.jda.2011.04.006⟩
Journal of Discrete Algorithms, Elsevier, 2012, Special issue on Stringology, Bioinformatics and Algorithms, 11, pp.62-72. ⟨10.1016/j.jda.2011.04.006⟩
International audience; Motivated by the inference of the structure of genomic sequences, we address here the smallest grammar problem. In previous work, we introduced a new perspective on this problem, splitting the task into two different optimizat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d76bca6d746ae19daffc7a02e2a65dd
https://hal.inria.fr/inria-00536633
https://hal.inria.fr/inria-00536633
Publikováno v:
Logic for Programming, Artificial Intelligence, and Reasoning ISBN: 9783642287169
LPAR
LPAR
We present iSat, a Python command line tool to analyze and find structure in propositional satisfiability problems. iSat offers an interactive shell to control propositional SAT solvers and generate graph representations of the internal structure of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5122b4d9685ad207c2a8b4a926743284
https://doi.org/10.1007/978-3-642-28717-6_26
https://doi.org/10.1007/978-3-642-28717-6_26
Publikováno v:
NLPKE
Unsupervised parsing induction has attracted a significant amount of attention over the last few years. However, current systems exhibit a degree of complexity that can shy away newcomers to the field. We challenge the need for such complexity and pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff04e99838253fbd785b7dafd77321c2
https://doi.org/10.1109/nlpke.2011.6138216
https://doi.org/10.1109/nlpke.2011.6138216
Publikováno v:
Algorithms
Algorithms, 2011, 4, pp.262-284. ⟨10.3390/a4040262⟩
Algorithms, MDPI, 2011, pp.262-284. ⟨10.3390/a4040262⟩
Algorithms, Vol 4, Iss 4, Pp 262-284 (2011)
Algorithms; Volume 4; Issue 4; Pages: 262-284
Algorithms, 2011, 4, pp.262-284. ⟨10.3390/a4040262⟩
Algorithms, MDPI, 2011, pp.262-284. ⟨10.3390/a4040262⟩
Algorithms, Vol 4, Iss 4, Pp 262-284 (2011)
Algorithms; Volume 4; Issue 4; Pages: 262-284
International audience; The smallest grammar problem--namely, finding a smallest context-free grammar that generates exactly one sequence--is of practical and theoretical importance in fields such as Kolmogorov complexity, data compression and patter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5b959fd3137ed7ab062fa72322c19a4
https://inria.hal.science/inria-00638445
https://inria.hal.science/inria-00638445
Publikováno v:
Advances in Artificial Intelligence ISBN: 9783642253232
MICAI (1)
MICAI (1)
We introduce Probabilistic Constrained W-grammars (PCW-grammars), a two-level formalism capable of capturing grammatical frameworks used in three different state of the art grammar formalism, namely Bilexical Grammars, Markov Rules, and Stochastic Tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cd7825cc52cf5794697951a28fded16
https://doi.org/10.1007/978-3-642-25324-9_21
https://doi.org/10.1007/978-3-642-25324-9_21
Publikováno v:
LATA
LATA, May 2010, Trier, Germany
HAL
Language and Automata Theory and Applications ISBN: 9783642130885
LATA, May 2010, Trier, Germany
HAL
Language and Automata Theory and Applications ISBN: 9783642130885
International audience; The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as Kolmogorov complexity, data compression and patt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4bb469b4dc09253c5875a330b87c1d19
https://hal.inria.fr/inria-00476840
https://hal.inria.fr/inria-00476840
Publikováno v:
Advances in Natural Language Processing ISBN: 9783642147692
IceTAL
IceTAL
Head finder algorithms are used by supervised parsers during their training phase to transform phrase structure trees into dependency ones. For the same phrase structure tree, different head finders produce different dependency trees. Head finders us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e4acb47e27d89497aae5f95100f0299
https://doi.org/10.1007/978-3-642-14770-8_16
https://doi.org/10.1007/978-3-642-14770-8_16