Zobrazeno 1 - 10
of 513
pro vyhledávání: '"Top-down parsing language"'
Publikováno v:
ACM Transactions on Asian and Low-Resource Language Information Processing. 16:1-35
In recent years, transition-based parsers have shown promise in terms of efficiency and accuracy. Though these parsers have been extensively explored for multiple Indian languages, there is still considerable scope for improvement by properly incorpo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80e8282d0f2f7f1fabadb218e5a7b81d
https://doi.org/10.1145/3005447
https://doi.org/10.1145/3005447
Publikováno v:
Repositório Institucional da UFRN
Universidade Federal do Rio Grande do Norte (UFRN)
instacron:UFRN
Universidade Federal do Rio Grande do Norte (UFRN)
instacron:UFRN
Parsing Expression Grammars (PEGs) describe top-down parsers. Unfortunately, the error-reporting techniques used in conventional top-down parsers do not directly apply to parsers based on Parsing Expression Grammars (PEGs), so they have to be somehow
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b72fc37bf593c851814c66dfe66a2171
https://doi.org/10.1016/j.scico.2016.08.004
https://doi.org/10.1016/j.scico.2016.08.004
Autor:
Héctor Martínez Alonso, Anders Søgaard, Anders Johannsen, Željko Agić, Natalie Schluter, Barbara Plank
Publikováno v:
Transactions of the Association for Computational Linguistics. 4:301-312
We propose a novel approach to cross-lingual part-of-speech tagging and dependency parsing for truly low-resource languages. Our annotation projection-based approach yields tagging and parsing models for over 100 languages. All that is needed are fre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2493c319ad60102028a57fa7821adc6
https://doi.org/10.1162/tacl_a_00100
https://doi.org/10.1162/tacl_a_00100
Publikováno v:
ACM Transactions on Asian and Low-Resource Language Information Processing. 16:1-24
Semantic parsing maps a sentence in natural language into a structured meaning representation. Previous studies show that semantic parsing with synchronous context-free grammars (SCFGs) achieves favorable performance over most other alternatives. Mot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29d0477a8a370cab58ca7e033311f9be
https://doi.org/10.1145/2963099
https://doi.org/10.1145/2963099
Autor:
Adrian Johnstone, Elizabeth Scott
Publikováno v:
Science of Computer Programming. 125:1-22
GLL (Generalised LL) parsing algorithms provide a sequentialisation of recursive-descent style parsing that yields efficient, compiled parsers which admit any context free grammar, including left recursive and non-left-factored rules. The resulting p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fa6b4e844674661e830610217405d37
https://doi.org/10.1016/j.scico.2016.04.003
https://doi.org/10.1016/j.scico.2016.04.003
Autor:
Sung Dong Kim
Publikováno v:
KIPS Transactions on Software and Data Engineering. 5:21-28
The performance of an English-Korean machine translation system depends heavily on its English parser. The parser in this paper is a part of the rule-based English-Korean MT system, which includes many syntactic rules and performs the chart-based par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::067b2dd13f8cd85a4dc5792a4d2393ed
https://doi.org/10.3745/ktsde.2016.5.1.21
https://doi.org/10.3745/ktsde.2016.5.1.21
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::7625c59a7d415902b6d9d949606e4d0a
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-152098
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-152098
Autor:
Stefano Crespi Reghizzi, Matteo Pradella, Federica Panella, Dino Mandrioli, Alessandro Barenghi
Publikováno v:
Science of Computer Programming. 112:195-226
The property of local parsability allows to parse inputs through inspecting only a bounded-length string around the current token. This in turn enables the construction of a scalable, data-parallel parsing algorithm, which is presented in this work.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f905450c9b0429baccad1e9a336022a
https://doi.org/10.1016/j.scico.2015.09.002
https://doi.org/10.1016/j.scico.2015.09.002
Publikováno v:
International Journal of Speech Technology. 19:313-323
The importance of the parsing task for NLP applications is well understood. However developing parsers remains difficult because of the complexity of the Arabic language. Most parsers are based on syntactic grammars that describe the syntactic struct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae60b6c5ef089cbafc488188bf204894
https://doi.org/10.1007/s10772-015-9300-x
https://doi.org/10.1007/s10772-015-9300-x
Autor:
Andrew C. Myers, Chinawat Isradisaikul
Publikováno v:
PLDI
Writing a parser remains remarkably painful. Automatic parser generators offer a powerful and systematic way to parse complex grammars, but debugging conflicts in grammars can be time-consuming even for experienced language designers. Better tools fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10ffa825babf7f09326cdd300f1696b2
https://doi.org/10.1145/2813885.2737961
https://doi.org/10.1145/2813885.2737961