Zobrazeno 1 - 10
of 100
pro vyhledávání: '"GIORGIO SATTA"'
Publikováno v:
Computational Linguistics, Vol 48, Iss 3 (2022)
Unlike other mildly context-sensitive formalisms, Combinatory Categorial Grammar (CCG) cannot be parsed in polynomial time when the size of the grammar is taken into account. Refining this result, we show that the parsing complexity of CCG is exponen
Externí odkaz:
https://doaj.org/article/bbf2672191a44779a09e1683012e01b5
Publikováno v:
Computational Linguistics, Vol 45, Iss 2, Pp 339-379 (2019)
We present algorithms for extracting Hyperedge Replacement Grammar (HRG) rules from a graph along with a vertex order. Our algorithms are based on finding a tree decomposition of smallest width, relative to the vertex order, and then extracting one r
Externí odkaz:
https://doaj.org/article/bfb0194d49b641a883676ddf0a882cec
Publikováno v:
Computational Linguistics, Vol 44, Iss 3, Pp 447-482 (2018)
We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994). As our main result, we prove that any parsing algorithm for this formalism will take in the worst case exponential time when th
Externí odkaz:
https://doaj.org/article/d8430fc61c2b44f1b27abd11c00080f2
Publikováno v:
IJCoL, Vol 4, Iss 1, Pp 77-88 (2018)
The Fourth Italian Conference on Computational Linguistics (CLiC-it 2017) took place in Rome, in December 2017. As in previous editions, it served as the prime forum in Italy for discussing research in computational linguistics and Natural Language P
Externí odkaz:
https://doaj.org/article/0ac4fe6d0c6a4ff5b8975d8ee8d6e387
Publikováno v:
Computational Linguistics, Vol 44, Iss 1, Pp 119-186 (2018)
Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, and using models involving graphs that parallels th
Externí odkaz:
https://doaj.org/article/010e8c1fc19b4a4a9d282979566ba5c8
Publikováno v:
Computational Linguistics, Vol 44, Iss 1, Pp 85-118 (2018)
Motivated by the task of semantic parsing, we describe a transition system that generalizes standard transition-based dependency parsing techniques to generate a graph rather than a tree. Our system includes a cache with fixed size m, and we characte
Externí odkaz:
https://doaj.org/article/8f7e64c681744bf584db7baa9f347cf0
Publikováno v:
Algorithms, Vol 13, Iss 10, p 262 (2020)
Parsing is a key task in computer science, with applications in compilers, natural language processing, syntactic pattern matching, and formal language theory. With the recent development of deep learning techniques, several artificial intelligence a
Externí odkaz:
https://doaj.org/article/d51ce338aaae4274b6830fd0765284fc
Publikováno v:
Computational Linguistics, Vol 44, Iss 1 (2017)
Motivated by the task of semantic parsing, we describe a transition system that generalizes standard transition-based dependency parsing techniques to generate a graph rather than a tree. Our system includes a cache with fixed size m, and we characte
Externí odkaz:
https://doaj.org/article/8a3fc1bed9594548900558c8539839c7
Publikováno v:
Computational Linguistics, Vol 44, Iss 1 (2017)
Graphs have a variety of uses in natural language processing, particularly as representations of linguistic meaning. A deficit in this area of research is a formal framework for creating, combining, and using models involving graphs that parallels th
Externí odkaz:
https://doaj.org/article/b089f8da0a3447d692fb2fe87b7448ff
Publikováno v:
FSMNLP
We develop a finite-state transducer for translating unranked trees into general graphs. This work is motivated by recent progress in semantic parsing for natural language, where sentences are first mapped into tree-shaped syntactic representations,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83cc261bba0c6047498eb1c8d38dd8dd
http://hdl.handle.net/11577/3398880
http://hdl.handle.net/11577/3398880