Relevant bibliographies by topics / Parseren

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Parseren'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Parseren.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Parseren"

1

Slivnik, Bostjan. "LL conflict resolution using the embedded left LR parser." Computer Science and Information Systems 9, no. 3 (2012): 1105–24. http://dx.doi.org/10.2298/csis111216023s.

Full text
Abstract:
A method for resolving LL(k) conflicts using small LR(k) parsers (called embedded left LR(k) parsers) is described. An embedded left LR(k) parser is capable of (a) producing the prefix of the left parse of the input string and (b) stopping not on the end-of-file marker but on any string from the set of lookahead strings fixed at the parser generation time. The conditions regarding the termination of the embedded left LR(k) parser if used within LL(k) (and similar) parsers are defined and examined in-depth. It is proved that an LL(k) parser augmented with a set of embedded left LR(k) parsers can parse any deterministic context-free grammar in the same asymptotic time as LR(k) parser. As the embedded left LR(k) parser produces the prefix of the left parse, the LL(k) parser augmented with embedded left LR(k) parsers still produces the left parse and the compiler writer does not need to bother with different parsing strategies during the compiler implementation.
APA, Harvard, Vancouver, ISO, and other styles
2

Ballesteros, Miguel, Chris Dyer, Yoav Goldberg, and Noah A. Smith. "Greedy Transition-Based Dependency Parsing with Stack LSTMs." Computational Linguistics 43, no. 2 (2017): 311–47. http://dx.doi.org/10.1162/coli_a_00285.

Full text
Abstract:
We introduce a greedy transition-based parser that learns to represent parser states using recurrent neural networks. Our primary innovation that enables us to do this efficiently is a new control structure for sequential neural networks—the stack long short-term memory unit (LSTM). Like the conventional stack data structures used in transition-based parsers, elements can be pushed to or popped from the top of the stack in constant time, but, in addition, an LSTM maintains a continuous space embedding of the stack contents. Our model captures three facets of the parser's state: (i) unbounded look-ahead into the buffer of incoming words, (ii) the complete history of transition actions taken by the parser, and (iii) the complete contents of the stack of partially built tree fragments, including their internal structures. In addition, we compare two different word representations: (i) standard word vectors based on look-up tables and (ii) character-based models of words. Although standard word embedding models work well in all languages, the character-based models improve the handling of out-of-vocabulary words, particularly in morphologically rich languages. Finally, we discuss the use of dynamic oracles in training the parser. During training, dynamic oracles alternate between sampling parser states from the training data and from the model as it is being learned, making the model more robust to the kinds of errors that will be made at test time. Training our model with dynamic oracles yields a linear-time greedy parser with very competitive performance.
APA, Harvard, Vancouver, ISO, and other styles
3

Partridge, Andrew, and David Wright. "Predictive parser combinators need four values to report errors." Journal of Functional Programming 6, no. 2 (1996): 355–64. http://dx.doi.org/10.1017/s0956796800001714.

Full text
Abstract:
AbstractA combinator-based parser is a parser constructed directly from a BNF grammar, using higher-order functions (combinators) to model the alternative and sequencing operations of BNF. This paper describes a method for constructing parser combinators that can be used to build efficient predictive parsers which accurately report the cause of parsing errors. The method uses parsers that return values (parse trees or error indications) decorated with one of four tags.
APA, Harvard, Vancouver, ISO, and other styles
4

Ho, Edward Kei Shin, and Lai Wan Chan. "How to Design a Connectionist Holistic Parser." Neural Computation 11, no. 8 (1999): 1995–2016. http://dx.doi.org/10.1162/089976699300016061.

Full text
Abstract:
Connectionist holistic parsing offers a viable and attractive alternative to traditional algorithmic parsers. With exposure to a limited subset of grammatical sentences and their corresponding parse trees only, a holistic parser is capable of learning inductively the grammatical regularity underlying the training examples that affects the parsing process. In the past, various connectionist parsers have been proposed. Each approach had its own unique characteristics, and yet some techniques were shared in common. In this article, various dimensions underlying the design of a holistic parser are explored, including the methods to encode sentences and parse trees, whether a sentence and its corresponding parse tree share the same representation, the use of confluent inference, and the inclusion of phrases in the training set. Different combinations of these design factors give rise to different holistic parsers. In succeeding discussions, we scrutinize these design techniques and compare the performances of a few parsers on language parsing, including the confluent preorder parser, the backpropagation parsing network, the XERIC parser of Berg (1992), the modular connectionist parser of Sharkey and Sharkey (1992), Reilly's (1992) model, and their derivatives. Experiments are performed to evaluate their generalization capability and robustness. The results reveal a number of issues essential for building an effective holistic parser.
APA, Harvard, Vancouver, ISO, and other styles
5

Huang, Yan, Akira Murakami, Theodora Alexopoulou, and Anna Korhonen. "Dependency parsing of learner English." International Journal of Corpus Linguistics 23, no. 1 (2018): 28–54. http://dx.doi.org/10.1075/ijcl.16080.hua.

Full text
Abstract:
Abstract Current syntactic annotation of large-scale learner corpora mainly resorts to “standard parsers” trained on native language data. Understanding how these parsers perform on learner data is important for downstream research and application related to learner language. This study evaluates the performance of multiple standard probabilistic parsers on learner English. Our contributions are three-fold. Firstly, we demonstrate that the common practice of constructing a gold standard – by manually correcting the pre-annotation of a single parser – can introduce bias to parser evaluation. We propose an alternative annotation method which can control for the annotation bias. Secondly, we quantify the influence of learner errors on parsing errors, and identify the learner errors that impact on parsing most. Finally, we compare the performance of the parsers on learner English and native English. Our results have useful implications on how to select a standard parser for learner English.
APA, Harvard, Vancouver, ISO, and other styles
6

Berger, Ulrich, Alison Jones, and Monika Seisenberger. "Program extraction applied to monadic parsing." Journal of Logic and Computation 29, no. 4 (2019): 487–518. http://dx.doi.org/10.1093/logcom/exv078.

Full text
Abstract:
Abstract This article outlines a proof-theoretic approach to developing correct and terminating monadic parsers. Using modified realizability, we extract formally verified and terminating programs from formal proofs. By extracting both primitive parsers and parser combinators, it is ensured that all complex parsers built from these are also correct, complete and terminating for any input. We demonstrate the viability of our approach by means of two case studies: we extract (i) a small arithmetic calculator and (ii) a non-deterministic natural language parser. The work is being carried out in the interactive proof system Minlog.
APA, Harvard, Vancouver, ISO, and other styles
7

Pitler, Emily. "A Crossing-Sensitive Third-Order Factorization for Dependency Parsing." Transactions of the Association for Computational Linguistics 2 (December 2014): 41–54. http://dx.doi.org/10.1162/tacl_a_00164.

Full text
Abstract:
Parsers that parametrize over wider scopes are generally more accurate than edge-factored models. For graph-based non-projective parsers, wider factorizations have so far implied large increases in the computational complexity of the parsing problem. This paper introduces a “crossing-sensitive” generalization of a third-order factorization that trades off complexity in the model structure (i.e., scoring with features over multiple edges) with complexity in the output structure (i.e., producing crossing edges). Under this model, the optimal 1-Endpoint-Crossing tree can be found in O( n4) time, matching the asymptotic run-time of both the third-order projective parser and the edge-factored 1-Endpoint-Crossing parser. The crossing-sensitive third-order parser is significantly more accurate than the third-order projective parser under many experimental settings and significantly less accurate on none.
APA, Harvard, Vancouver, ISO, and other styles
8

HUTTON, GRAHAM, and ERIK MEIJER. "Monadic parsing in Haskell." Journal of Functional Programming 8, no. 4 (1998): 437–44. http://dx.doi.org/10.1017/s0956796898003050.

Full text
Abstract:
This paper is a tutorial on defining recursive descent parsers in Haskell. In the spirit of one-stop shopping, the paper combines material from three areas into a single source. The three areas are functional parsers (Burge, 1975; Wadler, 1985; Hutton, 1992; Fokker, 1995), the use of monads to structure functional programs (Wadler, 1990, 1992a, 1992b), and the use of special syntax for monadic programs in Haskell (Jones, 1995; Peterson et al., 1996). More specifically, the paper shows how to define monadic parsers using do notation in Haskell.Of course, recursive descent parsers defined by hand lack the efficiency of bottom-up parsers generated by machine (Aho et al., 1986; Mogensen, 1993; Gill and Marlow, 1995). However, for many research applications, a simple recursive descent parser is perfectly sufficient. Moreover, while parser generators typically offer a fixed set of combinators for describing grammars, the method described here is completely extensible: parsers are first-class values, and we have the full power of Haskell available to define new combinators for special applications. The method is also an excellent illustration of the elegance of functional programming.
APA, Harvard, Vancouver, ISO, and other styles
9

Ferraro, Jeffrey, Ye Ye, Per Gesteland, et al. "The effects of natural language processing on cross-institutional portability of influenza case detection for disease surveillance." Applied Clinical Informatics 08, no. 02 (2017): 560–80. http://dx.doi.org/10.4338/aci-2016-12-ra-0211.

Full text
Abstract:
SummaryObjectives: This study evaluates the accuracy and portability of a natural language processing (NLP) tool for extracting clinical findings of influenza from clinical notes across two large healthcare systems. Effectiveness is evaluated on how well NLP supports downstream influenza case-detection for disease surveillance.Methods: We independently developed two NLP parsers, one at Intermountain Healthcare (IH) in Utah and the other at University of Pittsburgh Medical Center (UPMC) using local clinical notes from emergency department (ED) encounters of influenza. We measured NLP parser performance for the presence and absence of 70 clinical findings indicative of influenza. We then developed Bayesian network models from NLP processed reports and tested their ability to discriminate among cases of (1) influenza, (2) non-influenza influenza-like illness (NI-ILI), and (3) ‘other’ diagnosis.Results: On Intermountain Healthcare reports, recall and precision of the IH NLP parser were 0.71 and 0.75, respectively, and UPMC NLP parser, 0.67 and 0.79. On University of Pittsburgh Medical Center reports, recall and precision of the UPMC NLP parser were 0.73 and 0.80, respectively, and IH NLP parser, 0.53 and 0.80. Bayesian case-detection performance measured by AUROC for influenza versus non-influenza on Intermountain Healthcare cases was 0.93 (using IH NLP parser) and 0.93 (using UPMC NLP parser). Case-detection on University of Pittsburgh Medical Center cases was 0.95 (using UPMC NLP parser) and 0.83 (using IH NLP parser). For influenza versus NI-ILI on Intermountain Healthcare cases performance was 0.70 (using IH NLP parser) and 0.76 (using UPMC NLP parser). On University of Pisstburgh Medical Center cases, 0.76 (using UPMC NLP parser) and 0.65 (using IH NLP parser).Conclusion: In all but one instance (influenza versus NI-ILI using IH cases), local parsers were more effective at supporting case-detection although performances of non-local parsers were reasonable.Citation: Ferraro JP, Ye Y, Gesteland PH, Haug PJ, Tsui F(R), Cooper GF, Van Bree R, Ginter T, Nowalk AJ, Wagner M. The effects of natural language processing on cross-institutional portability of influenza case detection for disease surveillance. Appl Clin Inform 2017; 8: 560–580 https://doi.org/10.4338/ACI-2016-12-RA-0211
APA, Harvard, Vancouver, ISO, and other styles
10

Sangati, Federico, and Frank Keller. "Incremental Tree Substitution Grammar for Parsing and Sentence Prediction." Transactions of the Association for Computational Linguistics 1 (December 2013): 111–24. http://dx.doi.org/10.1162/tacl_a_00214.

Full text
Abstract:
In this paper, we present the first incremental parser for Tree Substitution Grammar (TSG). A TSG allows arbitrarily large syntactic fragments to be combined into complete trees; we show how constraints (including lexicalization) can be imposed on the shape of the TSG fragments to enable incremental processing. We propose an efficient Earley-based algorithm for incremental TSG parsing and report an F-score competitive with other incremental parsers. In addition to whole-sentence F-score, we also evaluate the partial trees that the parser constructs for sentence prefixes; partial trees play an important role in incremental interpretation, language modeling, and psycholinguistics. Unlike existing parsers, our incremental TSG parser can generate partial trees that include predictions about the upcoming words in a sentence. We show that it outperforms an n-gram model in predicting more than one upcoming word.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Parseren"

1

Willmer, David. "Theatricality, mediation, and public space : the legacy of Parsi theatre in South Asian cultural history /." Online version, 1999. http://bibpurl.oclc.org/web/21701.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Preußer, Thomas. "The wisent Parser Generator." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-98686.

Full text
Abstract:
Objective: This document is not an introduction to parser generators. Readers should rather have a good understanding of them, especially of LALR parser generators. This document merely describes the main aspects of the implementation of a LALR parser generator named wisent. It is divided into a concise description of the programming interface and an overview over the data structures and specifics of the implementation of the wisent parser generator.
APA, Harvard, Vancouver, ISO, and other styles
3

Preußer, Thomas. "The wisent Parser Generator." Technische Universität Dresden, 2004. https://tud.qucosa.de/id/qucosa%3A26195.

Full text
Abstract:
Objective: This document is not an introduction to parser generators. Readers should rather have a good understanding of them, especially of LALR parser generators. This document merely describes the main aspects of the implementation of a LALR parser generator named wisent. It is divided into a concise description of the programming interface and an overview over the data structures and specifics of the implementation of the wisent parser generator.
APA, Harvard, Vancouver, ISO, and other styles
4

Odegaard, Gunn Pedersen. "Forbikjøringsspor på IC-parsellen Sørli-Brumunddal : Utredning av konsepter." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for bygg, anlegg og transport, 2013. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-21767.

Full text
Abstract:
Intercity-utbyggingen er en av landets største jernbane satsinger i nyere tid og i forbindelse med utbygningen ønsker Jernbaneverket å få utredet ulike konsepter for plassering av forbikjøringsspor. Denne oppgaven har gjennom et grundig litteratursøk laget en generell vurdering av tre ulike konsepter, samt utført en ?case-studie? av Stange forbikjøringsspor. De ulike konseptene er som følger:?Forbikjøringsspor på stasjon?Forbikjøringsspor ved stasjon ?Forbikjøringsspor vilkårlig plassering langs strekningenBehovet for utredningen er kommet som en konsekvens av at det i dag ikke eksisterer noen forbikjøringsspor i Norge. Det finnes da heller ingen retningslinje på hvordan de bør bli utformet eller hvilke krav man må ta hensyn til ved planleggingen av dem. Videre ble det klart at Jernbaneverket ønsker å plassere forbikjøringssporene på stasjonene, mens kommunene gjerne vil plassere dem utenfor sentrumskjernen, da disse arealene ofte er av stor verdi for kommunen. Oppgaven baserer seg i stor grad på bestemmelsene i konseptvalgutredningen for Intercity Oslo - Lillehammer (KVU?IC) som ble ferdigstilt 2012. I KVU-IC ble det bestemt at det skal være blandet trafikk på strekningen Oslo ? Lillehammer, og at hastigheten på den aktuelle parsellen Sørli ? Brumunddal skal være 250 km/h. Videre var det ønskelig at det skulle være forbikjøringsspor hver 10 km. I forbindelse med Intercity-utbyggingen er det bestemt at maksimal hastighet som tog kan passere plattform i, er 200 km/h (Nordli, 2013). Dette er lagt til grunn ved vurderingen av konseptene. Det ble utført et litteraturstudium for å undersøke hvordan andre land i samme eller ulik situasjon som i Norge løser utfordringene, samt en gjennomgang av ulike rapporter fra Norge. Hovedfokuset i litteraturstudiet var kapasitetsutfordringer, sikkerhet og tekniske løsninger for forbikjøringssporene. Basert på litteratursøket og på KVU-ICs bestemmelser ble det laget seks ulike krav for å evaluere konseptene: kapasitet og pålitelighet, reisetid, sikkerhet, arealer, kostander og teknisk utforming. Disse evalueringskriteriene ble lagt til grunn ved vurdering av de ulike konseptene. Da denne oppgaven baserer seg på KVU-IC, veide evalueringskravene kapasitet, reisetid og sikkerhet tyngst ved evalueringen. Resultatet fra analysen er vist i tabellen under. Fra tabellen ser man tydelig at det er konseptet på stasjon som kommer best ut. Hovedårsaken til dette er at man med de to andre konseptene får et reisetidstillegg på grunn av at man må kjøre med redusert hastigheten gjennom stasjonen. En hastighetsreduksjon gjennom stasjonen blir vurdert som en stor svakhet ved systemet når man skal bygge en ny jernbane for fremtiden. Dersom hastigheten var satt til 200 km/h ville resultatet blitt annerledes ut. Både kapasitet og reisetid ville blitt grønn i tabellen for konseptene ved stasjon og vilkårlig plassering. Dette viser betydningen av de kravene som er satt ved et prosjekt, og at små justeringer kan påvirke valg av konsept. Stange forbikjøringsspor ble prosjektert og to konsepter for plassering ble vurdert; På stasjon og ved stasjon. Fra analysen utpekte konseptet på stasjonen som det beste og ble anbefalt. Resultatet fra vurderingen er vist i tabellen under. På grunn av det reisetidstillegg man får ved å legge forbikjøringssporet ved stasjon, anbefales det å legge forbikjøringssporet på Stange stasjon. Gjennom prosjekteringen har det vist seg at forbikjøringssporene hovedsakelig vil ligge innenfor Jernbaneverkets eiendomsgrenser og tar da i liten grad av kommunens arealer. Gjennom arbeidet med oppgaven er det konkludert med at det er vanskelig å lage en generell retningslinje for hvor forbikjøringssporene skal plasseres. Alle prosjekter må vurderes individuelt basert på kravene til strekningen som helhet og lokal forhold på stedet. Men, gjennom oppgaven er det belyst viktige elementer som man bør ta hensyn til ved planleggingen av nye forbikjøringsspor. 
APA, Harvard, Vancouver, ISO, and other styles
5

Xiao, Wei. "A dependency-based parser evaluation method." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq23555.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hiyakumoto, Laurie Satsue 1969. "PoEM : a parser of emotion metaphors." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/61537.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 1999.<br>Includes bibliographical references (leaves 77-80).<br>Although metaphor is generally recognized as an integral component of everyday language, very few computational systems capable of understanding metaphoric utterances exist today. This thesis describes one approach to the problem and presents PoEM, a prototype system which recognizes and interprets metaphoric descriptions of emotions and mental states in single-sentence input. Building upon previous work in knowledge-based metaphor comprehension, this research adopts a goal-driven approach which assumes each metaphor is selected by a speaker for its aptness at serving a particular communicative goal. To identify these goals, an empirical analysis of metaphor distribution in song lyrics was performed, and typical communicative intentions and surface patterns were identified for the top five most frequently occurring metaphor groups. These intentions and surface patterns have been implemented as a set of metaphor templates and interpretation rules in PoEM, using the WordNet lexical database for supplemental semantic information. Evaluation of PoEM demonstrates fairly high accuracy but low recall.<br>Laurie Satsue Hiyakumoto.<br>S.M.
APA, Harvard, Vancouver, ISO, and other styles
7

Crowfoot, Norman C. "A visual aid for designing regular expression parsers /." Online version of thesis, 1988. http://hdl.handle.net/1850/10446.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cerecke, Carl. "Locally least-cost error repair in LR parsers." Thesis, University of Canterbury. Computer Science, 2003. http://hdl.handle.net/10092/5492.

Full text
Abstract:
This thesis presents some methods for improving the efficiency and effectiveness of locally least-cost error repair algorithms for an LR-based parser. Three different algorithms for reducing the search space are described and compared using a collection of 59,643 incorrect Java programs collected from novice programmers. Two of the algorithms prove particularly effective at reducing the search space. Also presented is a more efficient priority queue implementation for storing transformations of the input string. The effect on repairs of different grammars describing the same language is investigated, and a comparison of different methods of assigning costs to edit operations is performed.
APA, Harvard, Vancouver, ISO, and other styles
9

Gross, Jason S. "An extensible framework for synthesizing efficient, verified parsers." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101581.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 73-75).<br>Parsers have a long history in computer science. This thesis proposes a novel approach to synthesizing efficient, verified parsers by refinement, and presents a demonstration of this approach in the Fiat framework by synthesizing a parser for arithmetic expressions. The benefits of this framework may include more flexibility in the parsers that can be described, more control over the low-level details when necessary for performance, and automatic or mostly automatic correctness proofs.<br>by Jason S. Gross.<br>S.M.
APA, Harvard, Vancouver, ISO, and other styles
10

Marti, Christof. "Automatic contract extraction developing a CIL parser /." Zürich : ETH, Eidgenössische Technische Hochschule Zürich, Professur für Software Engineering /Chair of Software Engineering, 2003. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=197.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Parseren"

1

Relational-realizational parsing. IILC, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

The Parsee religion & the manners & customs of the Parsees. K.R. Cama Oriental Institute, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rājasthāna kā Pārasī raṅgamañca. Ema. Āra. Inṭaraneśanala, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jamshedji, Modi Jivanji. The religious ceremonies and customs of the Parsees. 2nd ed. Society for the Promotion of Zoroastrian Religious Knowledge & Education, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Parsee Novel. Prestige Books, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fire and spice: Parsi cookery. Serif, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pauw, Guy de. Probabilistische parsers: Contextgevoeligheid en pattern-matching. Universiteit Antwerpen, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

PARSEME.1st: SGML for software developers. Prentice Hall PTR, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mārśala, Ratana Rustamajī. Gujarātī Sāhitya-patrakāratva-raṅgabhūmine kshetre pārasīonuṃ pradāna. Gūrjara Grantharatna Kāryālaya, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Quinn, James Thomas. A Java based lisp parser. The Author), 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Parseren"

1

Joneleit-Oesch, Silja. "Parsen." In Metzler Lexikon Religion. J.B. Metzler, 2000. http://dx.doi.org/10.1007/978-3-476-03704-6_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Weik, Martin H. "parser." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_13641.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Joneleit-Oesch, Silja. "Parsen." In Metzler Lexikon Religion. J.B. Metzler, 2005. http://dx.doi.org/10.1007/978-3-476-00091-0_398.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Petrone, Luigi. "Reusing batch parsers as incremental parsers." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60692-0_44.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Green, Jennifer, and Michael Green. "Zoroastrians (Parsees)." In Dealing with Death. Springer US, 1991. http://dx.doi.org/10.1007/978-1-4899-7216-3_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fokker, Jeroen. "Functional parsers." In Advanced Functional Programming. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-59451-5_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Leermakers, René. "LR Parsers." In The Functional Treatment of Parsing. Springer US, 1993. http://dx.doi.org/10.1007/978-1-4615-3186-9_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Modi, Jivanji Jamshedji. "Parsee life in Parsee songs *." In An Ethnography of the Parsees of India. Routledge India, 2021. http://dx.doi.org/10.4324/9781003194323-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rieger, Wolfgang. "Parser-Manual." In Edition PAGE. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-642-78702-7_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Church, Kenneth W. "Parser Implementation." In The Kluwer International Series in Engineering and Computer Science. Springer US, 1987. http://dx.doi.org/10.1007/978-1-4613-2013-5_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Parseren"

1

Baia, Jardel, Arley Prates, and Daniela Claro. "CoNLL Dependency Parser: Extrinsic Evaluation through the Open Information Extraction task." In Symposium on Knowledge Discovery, Mining and Learning. Sociedade Brasileira de Computação, 2020. http://dx.doi.org/10.5753/kdmile.2020.11976.

Full text
Abstract:
Dependency Parsers (DP) are parsers that analyze dependencies between words in a sentence. Currently, dependency parser evaluation is a problem whose solutions are not well defined in the scientific community. Although the DP intrinsic metrics are the foremost choice of evaluation, extrinsic evaluation enables a different evaluation based on a downstream. Different results of DP can vary according to the domain task. Thus, this work applies an Open Information Extraction (OIE) method in Portuguese to provide an extrinsic evaluation of a set of CONLL Dependency Parsers. Our results demonstrate that there is a difference in the evaluation of Dependency Parsers considering a particular task.
APA, Harvard, Vancouver, ISO, and other styles
2

Anastasyev, D. G. "EXPLORING PRETRAINED MODELS FOR JOINT MORPHO-SYNTACTIC PARSING OF RUSSIAN." In International Conference on Computational Linguistics and Intellectual Technologies "Dialogue". Russian State University for the Humanities, 2020. http://dx.doi.org/10.28995/2075-7182-2020-19-1-12.

Full text
Abstract:
In this paper, we build a joint morpho-syntactic parser for Russian. We describe a method to train a joint model which is significantly faster and as accurate as a traditional pipeline of models. We explore various ways to encode the word-level information and how they can affect the parser’s performance. To this end, we utilize learned from scratch character-level word embeddings and grammeme embeddings that have shown state-of-theart results for similar tasks for Russian in the past. We compare them with the pretrained contextualized word embeddings, such as ELMo and BERT, known to lead to the breakthrough in miscellaneous tasks in English. As a result, we prove that their usage can significantly improve parsing quality.
APA, Harvard, Vancouver, ISO, and other styles
3

Fenwick, Matthew, Gerard Weatherby, Heidi JC Ellis, and Michael R. Gryk. "Parser Combinators: A Practical Application for Generating Parsers for NMR Data." In 2013 Tenth International Conference on Information Technology: New Generations (ITNG). IEEE, 2013. http://dx.doi.org/10.1109/itng.2013.39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kuncoro, Adhiguna, Miguel Ballesteros, Lingpeng Kong, Chris Dyer, and Noah A. Smith. "Distilling an Ensemble of Greedy Dependency Parsers into One MST Parser." In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 2016. http://dx.doi.org/10.18653/v1/d16-1180.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Litschko, Robert, Ivan Vulić, Željko Agić, and Goran Glavaš. "Towards Instance-Level Parser Selection for Cross-Lingual Transfer of Dependency Parsers." In Proceedings of the 28th International Conference on Computational Linguistics. International Committee on Computational Linguistics, 2020. http://dx.doi.org/10.18653/v1/2020.coling-main.345.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Litschko, Robert, Ivan Vulić, Željko Agić, and Goran Glavaš. "Towards Instance-Level Parser Selection for Cross-Lingual Transfer of Dependency Parsers." In Proceedings of the 28th International Conference on Computational Linguistics. International Committee on Computational Linguistics, 2020. http://dx.doi.org/10.18653/v1/2020.coling-main.345.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Thummalapenta, Suresh, and Tao Xie. "Parseweb." In the twenty-second IEEE/ACM international conference. ACM Press, 2007. http://dx.doi.org/10.1145/1321631.1321663.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ray, Avik, Yilin Shen, and Hongxia Jin. "Learning Out-of-Vocabulary Words in Intelligent Personal Agents." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/599.

Full text
Abstract:
Semantic parsers play a vital role in intelligent agents to convert natural language instructions to an actionable logical form representation. However, after deployment, these parsers suffer from poor accuracy on encountering out-of-vocabulary (OOV) words, or significant accuracy drop on previously supported instructions after retraining. Achieving both goals simultaneously is non-trivial. In this paper, we propose novel neural networks based parsers to learn OOV words; one incorporating a new hybrid paraphrase generation model, and an enhanced sequence-to-sequence model. Extensive experiments on both benchmark and custom datasets show our new parsers achieve significant accuracy gain on OOV words and phrases, and in the meanwhile learn OOV words while maintaining accuracy on previously supported instructions.
APA, Harvard, Vancouver, ISO, and other styles
9

Mauny, Michel, and Daniel de Rauglaudre. "Parsers in ML." In the 1992 ACM conference. ACM Press, 1992. http://dx.doi.org/10.1145/141471.141510.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Martins, André F. T., Dipanjan Das, Noah A. Smith, and Eric P. Xing. "Stacking dependency parsers." In the Conference. Association for Computational Linguistics, 2008. http://dx.doi.org/10.3115/1613715.1613738.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Parseren"

1

Hwa, Rebecca. On Minimizing Training Corpus for Parser Acquisition. Defense Technical Information Center, 2001. http://dx.doi.org/10.21236/ada458746.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Malitsky, Y. Porting the UAL SXF Parser to a Windows Platform. Office of Scientific and Technical Information (OSTI), 2003. http://dx.doi.org/10.2172/1157301.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Seneff, Stephanie. TINA: A Probabilistic Syntactic Parser for Speech Understanding Systems. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada458586.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kramer, Thomas R. A parser that converts a boundary representation into a features representation. National Institute of Standards and Technology, 1989. http://dx.doi.org/10.6028/nist.ir.88-3864.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Abel, Donald. The Parser Converter Loader: An Implementation of the Computational Chemistry Output Language (CCOL). Portland State University Library, 2000. http://dx.doi.org/10.15760/etd.6802.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Barker, S., and F. Glandorf. Integrated Information Support System (IISS). Volume 8. User Interface Subsystem. Part 41. Electronic Documentation System (EDS) Parser Unit Test Plan. Defense Technical Information Center, 1990. http://dx.doi.org/10.21236/ada248979.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

SGML parser validation procedures. National Institute of Standards and Technology, 1995. http://dx.doi.org/10.6028/nist.ir.5538.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Parseren' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography