Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "parsing" wg kryterium: Temat


Tytuł:
A dependency-based approach to word contextualization using compositional distributional semantics
Autorzy:
Gamallo, Pablo
Powiązania:
https://bibliotekanauki.pl/articles/103863.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
distributional semantics
compositionality
dependency-based parsing
Opis:
We propose a strategy to build the distributional meaning of sentences mainly based on two types of semantic objects: context vectors associated with content words and compositional operations driven by syntactic dependencies. The compositional operations of a syntactic dependency make use of two input vectors to build two new vectors representing the contextualized sense of the two related words. Given a sentence, the iterative application of dependencies results in as many contextualized vectors as content words the sentence contains. At the end of the contextualization process, we do not obtain a single compositional vector representing the semantic denotation of the whole sentence (or of the root word), but one contextualized vector for each constituent word of the sentence. Our method avoids the troublesome high-order tensor representations of approaches relying on category theory, by defining all words as first-order tensors (i.e. standard vectors). Some corpus-based experiments are performed to both evaluate the quality of the contextualized vectors built with our strategy, and to compare them to other approaches on distributional compositional semantics. The experiments show that our dependency-based method performs as (or even better than) the state-of-the-art.
Źródło:
Journal of Language Modelling; 2019, 7, 1; 99-138
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A syntactic component for Vietnamese language processing
Autorzy:
Le-Hong, P.
Roussanaly, A.
Nguyen, T. M. H.
Powiązania:
https://bibliotekanauki.pl/articles/103931.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
language
parsing
segmentation
syntactic component
tagging
tree-adjoining grammar
Vietnamese
Opis:
This paper presents the development of a grammar and a syntactic parser for the Vietnamese language. We first discuss the construction of a lexicalized tree-adjoining grammar using an automatic extraction approach. We then present the construction and evaluation of a deep syntactic parser based on the extracted grammar. This is a complete system that produces syntactic structures for Vietnamese sentences. A dependency annotation scheme for Vietnamese and an algorithm for extracting dependency structures from derivation trees are also proposed. This is the first Vietnamese parsing system capable of producing both constituency and dependency analyses. It offers encouraging performance: accuracy of 69.33% and 73.21% for constituency and dependency analysis, respectively.
Źródło:
Journal of Language Modelling; 2015, 3, 1; 145-184
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Adapting a constituency parser to user-generated content in polish opinion mining
Autorzy:
Pluwak, A.
Korczynski, W.
Kisiel-Dorohinicki, M.
Powiązania:
https://bibliotekanauki.pl/articles/305485.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
user generated content
text normalization
parsing
sentiment analysis
Opis:
The paper focuses on the adjustment of NLP tools for Polish; e.g., morphological analyzers and parsers, to user-generated content (UGC). The authors discuss two rule-based techniques applied to improve their efficiency: pre-processing (text normalization) and parser adaptation (modified segmentation and parsing rules). A new solution to handle OOVs based on inflectional translation is also offered.
Źródło:
Computer Science; 2016, 17 (1); 23-44
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An analysis of the concurrent calculation of the First Sets
Autorzy:
Jeruszka, P.
Powiązania:
https://bibliotekanauki.pl/articles/122760.pdf
Data publikacji:
2014
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
First Sets
concurrent computing
construction of languages
parsing
zbiory pierwsze
programowanie współbieżne
analiza składniowa
Opis:
This paper is focused on the process of computing First Sets. The First Sets are used to build structures which control a syntax analyser (also known as parser). Three methods of creating First Sets were compared in terms of execution time. The first method is known sequential algorithm and the author’s own methods are concurrent computing sets for each non-terminal symbol (called the CEN method) and concurrent computing sets for each production (called the CEP method). These methods have been tested on personal computer. Three programming languages (including the C language) were used in the research. The results and the analysis of calculations allow the author to hypothesise that the problem of computing First Sets is hard to concurrence.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2014, 13, 3; 67-74
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Application of Probabilistic Grammars to Efficient Machne Translation
Autorzy:
Skórzewski, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/1037598.pdf
Data publikacji:
2010-09-15
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
a* algorithm
machine translation
natural language parsing
pcfg
probabilistic grammars
Opis:
In this paper we present one of the algorithms used to parse probabilistic context-free grammars: the A* parsing algorithm, which is based on the A* graph search method. We show an example of application of the algorithm in an existing machine translation system. The existing CYK-based parser used in the Translatica system was modified by applying the A* parsing algorithm in order to examine the possibilities of improving its performance. This paper presents the results of applying the A* algorithm with different heuristic functions and their impact on the performance of the parser.
Źródło:
Investigationes Linguisticae; 2010, 21; 90-98
1426-188X
1733-1757
Pojawia się w:
Investigationes Linguisticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Chomsky-Schützenberger parking for weighted multiple context-free languages
Autorzy:
Denkinger, T.
Powiązania:
https://bibliotekanauki.pl/articles/103915.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
Chomsky-Schützenberger
parsing
multiple context-free grammars
linear context-free rewriting systems
Opis:
We prove a Chomsky-Schützenberger representation theorem for multiple context-free languages weighted over complete commutative strong bimonoids. Using this representation we devise a parsing algorithm for a restricted form of those devices.
Źródło:
Journal of Language Modelling; 2017, 5, 1; 3-55
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Data-oriented parsing with discontinuous constituents and function tags
Autorzy:
van Cranenburgh, A.
Scha, R.
Bod, R.
Powiązania:
https://bibliotekanauki.pl/articles/103879.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
discontinuous constituents
statistical parsing
tree-substitution grammar
Opis:
Statistical parsers are effective but are typically limited to producing projective dependencies or constituents. On the other hand, linguistically rich parsers recognize non-local relations and analyze both form and function phenomena but rely on extensive manual grammar engineering. We combine advantages of the two by building a statistical parser that produces richer analyses. We investigate new techniques to implement treebank-based parsers that allow for discontinuous constituents. We present two systems. One system is based on a Linear Context-Free Rewriting System (LCFRS), while using a Probabilistic Discontinuous Tree-Substitution Grammar (PDTSG) to improve disambiguation performance. Another system encodes discontinuities in the labels of phrase-structure trees, allowing for efficient context-free grammar parsing. The two systems demonstrate that tree fragments as used in treesubstitution grammar improve disambiguation performance Chile capturing non-local relations on an as-needed basis. Additionally, we present results for models that produce function tags, resulting in a more linguistically adequate model of the data. We report substantial accuracy improvements in discontinuous parsing for German, English, and Dutch, including results on spoken Dutch.
Źródło:
Journal of Language Modelling; 2016, 4, 1; 57-111
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generative power of reduction-based parsable ETPR(k) graph grammars for syntactic pattern recognition
Autorzy:
Flasiński, M.
Powiązania:
https://bibliotekanauki.pl/articles/385088.pdf
Data publikacji:
2018
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
syntactic pattern recognition
graph grammar
parsing
rozpoznawanie wzoru syntaktycznego
gramatyka grafowa
Opis:
Further results of research into parsable graph grammars used for syntactic pattern recognition (Pattern Recognition: 21, 623-629 (1988); 23, 765-774 (1990); 24, 12-23 (1991); 26, 1-16 (1993); 43, 2249-2264 (2010), Comput. Vision Graph. Image Process. 47, 1-21 (1989), Computer-Aided Design 27, 403-433 (1995), Theoret. Comp. Sci. 201, 189-231 (1998), Pattern Analysis Applications bf 17, 465-480 (2014)) are presented in the paper. The generative power of reduction-based parsable ETPR(k) graph grammars is investigated. The analogy between the triad of CF - LL(k) - LR(k) string languages and the triad of NLC - ETPL(k) - ETPR(k) graph languages is discussed.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2018, 12, 2; 61-81
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
How to embed noncrossing trees in Universal Dependencies treebanks in a low-complexity regular language
Autorzy:
Yli-Jyrä, Anssi Mikael
Powiązania:
https://bibliotekanauki.pl/articles/103803.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
bounded stack
coding morphisms
context-free grammars
dependencies
finite-state
parsing
state complexity
treebanks
Opis:
A recently proposed balanced-bracket encoding (Yli-Jyrä and Gómez-Rodríguez 2017) has given us a way to embed all noncrossing dependency graphs into the string space and to formulate their exact arcfactored inference problem (Kuhlmann and Johnsson 2015) as the best string problem in a dynamically constructed and weighted unambiguous context-free grammar. The current work improves the encoding and makes it shallower by omitting redundant brackets from it. The streamlined encoding gives rise to a bounded-depth subset approximation that is represented by a small finite-state automaton. When bounded to 7 levels of balanced brackets, the automaton has 762 states and represents a strict superset of more than 99.9999% of the noncrossing trees available in Universal Dependencies 2.4 (Nivre et al. 2019). In addition, it strictly contains all 15-vertex noncrossing digraphs. When bounded to 4 levels and 90 states, the automaton still captures 99.2% of all noncrossing trees in the reference dataset. The approach is flexible and extensible towards unrestricted graphs, and it suggests tight finite-state bounds for dependency parsing, and for the main existing parsing methods.
Źródło:
Journal of Language Modelling; 2019, 7, 2; 177-232
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Is the Artificial Intelligent? A Perspective on AI-based Natural Language Processors
Autorzy:
Błachnio, Wojciech
Powiązania:
https://bibliotekanauki.pl/articles/601211.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
Artificial Intelligence, Natural Language Processors, Fluid Construction Grammar, parsing, cognition
Opis:
The issue of the relation between AI and human mind has been riddling the scientific world since ages. Being the mother lode of research, AI can be scrutinised from a plethora of perspectives. One of them is a linguistic perspective, which encompasses AI’s capability to understand language. Having been an innate and exclusive faculty of human mind, language is now manifested in a countless number of ways, transcending beyond the human-only production. There are applications that can not only understand what is meant by an utterance, but also engage in a quasi-humane discourse. The manner of their operating is perfectly organised and can be accounted for by incorporating linguistic theories. The main theory used in this article is Fluid Construction Grammar, which has been developed by Luc Steels. It is concerned with parsing and segmentation of any utterance – two processes that are pivotal in AI’s understanding and production of language. This theory, in addition with five main facets of languages (phonological, morphological, semantic, syntactic and pragmatic) provides a valuable insight into the discrepancies between natural and artificial perception of language. Though there are similarities between them, the article shall conclude with what makes two adjacent capabilities different. The aim of this paper is to display the mechanisms of AI natural language processors with the aid of contemporary linguistic theories, and present possible issues which may ensue from using artificial language-recognising systems.
Źródło:
New Horizons in English Studies; 2019, 4
2543-8980
Pojawia się w:
New Horizons in English Studies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mention Detection for Coreference Resolution in Polish. Development of the Formal Grammar
Autorzy:
Wójcicka, Alicja
Kopeć, Mateusz
Powiązania:
https://bibliotekanauki.pl/articles/677372.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Instytut Slawistyki PAN
Tematy:
coreference resolution
mention detection
shallow parsing
Formal Grammar for Polish
Opis:
Mention Detection for Coreference Resolution in Polish. Development of the Formal GrammarThis paper presents the results of an improvement and extension of the Shallow Grammar of Polish, designed for the needs of the Computer-based Methods for Coreference Resolution in Polish Texts (CORE) project. The role of the Grammar was to detect nominal groups (i.e. multi-level nested phrases) that could be considered as mentions in coreference resolution tasks. In this article, the reorganization and changes to the Grammar are described, as well as the results of an evaluation of the Polish Coreference Corpus with manual annotations of mentions and coreferential expressions. A comparison of the second version of the Grammar with an evaluation of the first version reveals an improvement to the recall and F1 measures. Parsing płytki relacji koreferencji w języku polskim. Rozwój gramatyki formalnejCelem artykułu jest przedstawienie rezultatów prac zmierzających do rozszerzenia gramatyki powierzchniowej języka polskiego, stworzonej na potrzeby projektu "Komputerowe metody identyfikacji nawiązań w tekstach polskich" (grant NCN nr 6505/B/T02/2011/40), oraz poprawy wyników jej działania. Rolą gramatyki powierzchniowej jest wykrywanie grup nominalnych, które mogą wchodzić w relację koreferencji z innymi wyrażeniami w tekście. Nowa gramatyka została przetestowana z użyciem Polskiego Korpusu Koreferencyjnego, w którym grupy nominalne oraz relacje koreferencji między nimi zostały oznaczone ręcznie. Porównanie nowej wersji gramatyki z wersją poprzednią wykazało poprawę zarówno skuteczności wykrywania odpowiednich grup, jak i wzrost miary F1.
Źródło:
Cognitive Studies; 2016, 16
2392-2397
Pojawia się w:
Cognitive Studies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On different approaches to syntactic analysis into bi-lexical dependencies : An empirical comparison of direct, PCFG-based, and HPSG-based parsers
Autorzy:
Ivanova, A.
Oepen, S.
Dridan, R.
Flickinger, D.
Øvrelid, L.
Lapponi, E.
Powiązania:
https://bibliotekanauki.pl/articles/103851.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
syntactic dependency parsing
domain variation
Opis:
We compare three different approaches to parsing into syntactic, bilexical dependencies for English: a ‘direct’ data-driven dependenci parser, a statistical phrase structure parser, and a hybrid, ‘deep’ grammar-driven parser. The analyses from the latter two are postconverted to bi-lexical dependencies. Through this ‘reduction’ of All three approaches to syntactic dependency parsers, we determine empirically what performance can be obtained for a common set of dependenci types for English; in- and out-of-domain experimentation ranges over diverse text types. In doing so, we observe what trade-offs apply along three dimensions: accuracy, efficiency, and resilience to domain variation. Our results suggest that the hand-built grammar in one of our parsers helps in both accuracy and cross-domain parsing performance. When evaluated extrinsically in two downstream tasks – negation resolution and semantic dependency parsing – these accuracy gains do sometimes but not always translate into improved end-to-end performance.
Źródło:
Journal of Language Modelling; 2016, 4, 1; 113-144
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parsing based on n-path tree - controlled grammars
Autorzy:
Čermák, M.
Koutný, J.
Meduna, A.
Powiązania:
https://bibliotekanauki.pl/articles/375747.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
regulated rewriting
derivation tree
tree-controlled grammars
path-controlled grammars
parsing
n-path tree-controlled grammars
Opis:
This paper discusses recently introduced kind of linguistically motivated restriction placed on tree-controlled grammars-context-free grammars with some root-to-leaf paths in their derivation trees restricted by a control language. We deal with restrictions placed on n greater-than or equal to 1 paths controlled by a deterministic context-free language, and we recall several basic properties of such a rewriting system. Then, we study the possibilities of corresponding parsing methods working in polynomial time and demonstrate that some non-context-free languages can be generated by this regulated rewriting model. Furthermore, we illustrate the syntax analysis of LL grammars with controlled paths. Finally, we briefly discuss how to base parsing methods on bottom-up syntax-analysis.
Źródło:
Theoretical and Applied Informatics; 2011, 23, 3-4; 213-228
1896-5334
Pojawia się w:
Theoretical and Applied Informatics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Partial semantic parsing of sentences by means of grammatically augmented ontology and weighted affix context-free grammar
Autorzy:
Davydov, M.
Lozynska, O.
Pasichnyk, V.
Powiązania:
https://bibliotekanauki.pl/articles/410807.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Oddział w Lublinie PAN
Tematy:
grammatically augmented ontology
weighted affix context free grammar
semantic parsing
syntactic parsing
template productions
gramatyka bezkontekstowa
analiza semantyczna
analiza składniowa
produkcja szablonów
Opis:
In spite of the fact that modern statistical and neural net based tools for parsing natural language texts supersede classical approaches there are still areas where generative grammars are used. These are areas where collection of universal parallel corpuses is still in the progress. National sign languages are among them. Ontologies and common sense databases play valuable role in parsing and translation of such languages. Grammatically augmented ontology (GAO) is an ontology extension that links phrases to their meaning. The link is established via special expressions that connect phrase meaning to grammatical and semantical attributes of words that constitute it. The article introduces a new approach to sentence parsing that is based on integration of ontology relations into productions of weighted affix context-free grammar (WACFG). For that reason a new parser for WACFG grammar was developed inspired by works of C.H.A. Koster. Basic properties of WACFG are discussed and the algorithm for selection and convertion of GAO expressions into the set of WACFG productions is provided. The proposed algorithm turned out to be feasible in the context of parsing and translating Ukrainian Spoken and Ukrainian Sign language. The developed approach for mixed semantical and syntactical sentence parsing was tested on the database of sentences from Ukrainian fairy tail by Ivan Franko “Fox Mykyta” where 92 % of sentences were correctly parsed.
Źródło:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2017, 6, 2; 27-32
2084-5715
Pojawia się w:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Plädoyer für Förderung der Vorlesekompetenz im DaF-Bereich – potenzielle Verfahren zur Stärkung der Leseflüssigkei
Plea for Promotion of Reading Competence in German as a Foreign Language – Potential Methods to Strengthen Reading Fluency
Autorzy:
Żytyńska, Małgorzata
Powiązania:
https://bibliotekanauki.pl/articles/2233697.pdf
Data publikacji:
2022-12-19
Wydawca:
Komisja Nauk Filologicznych Polskiej Akademii Nauk, Oddział we Wrocławiu
Tematy:
reading competence
reading training
reading fluency
reading speed
prosodic parsing
Opis:
This article deals with methods of oral-reading, which aim to improve reading competence and reading fluency. Important when reading aloud are the following components: decoding, accuracy, automaticity, fluency, reading speed and text comprehension. All these components should be practised with the following oral-reading methods: repeated reading, assisted reading or paired repeated reading. All of these reading-aloud methods contribute to the increase in reading competence. Therefore, they should be applied also in the teaching of German as a foreign language.
Źródło:
Academic Journal of Modern Philology; 2022, Special Issue, 16; 277-287
2299-7164
2353-3218
Pojawia się w:
Academic Journal of Modern Philology
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies