Thematische Bibliographien / Grammar, comparative and general Parsing

Auswahl der wissenschaftlichen Literatur zum Thema „Grammar, comparative and general Parsing“

Autor: Grafiati
Veröffentlicht am 4. Juni 2021
Zuletzt aktualisiert am 13. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Grammar, comparative and general Parsing" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte

Zeitschriftenartikel zum Thema "Grammar, comparative and general Parsing":

1

KIM, JONG-BOK, Jaehyung Yang und sanghoun Song. „Parsing Korean Comparative Constructions in a Typed-Feature Structure Grammar“. Language and Information 14, Nr. 1 (30.06.2010): 1–24. http://dx.doi.org/10.29403/li.14.1.1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Cooper, William E. „Parsing, Language Learning, and the Grammar“. Contemporary Psychology: A Journal of Reviews 30, Nr. 6 (Juni 1985): 451–52. http://dx.doi.org/10.1037/023835.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Shi, Zhi Yuan, Yu Qiang Sun, Yu Wan Gu, Fu Quan Ji und Jing Fen Du. „The Study about Parsing of RGG Grammar“. Advanced Materials Research 204-210 (Februar 2011): 255–58. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.255.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Visualization is the main form of human-computer interaction. The grammar formal description of visual language opens and explores the s application cope and theoretical research field of grammar. At present, graph grammar describing visual language is one of the best the formal methods. In the paper, formal parsing method of RGG grammar is studied deeply, a parsing algorithm about RGG grammar is described, and its application on Petri net is discussed.
4

Bao, Lei. „A Trajectory Classification Model Using Grammar Parsing“. IEEE Access 8 (2020): 218416–23. http://dx.doi.org/10.1109/access.2020.3042614.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Cousot, Patrick, und Radhia Cousot. „Parsing as abstract interpretation of grammar semantics“. Theoretical Computer Science 290, Nr. 1 (Januar 2003): 531–44. http://dx.doi.org/10.1016/s0304-3975(02)00034-8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Juffs, Alan. „Grammar and parsing and a transition theory“. Applied Psycholinguistics 27, Nr. 1 (Januar 2006): 69–71. http://dx.doi.org/10.1017/s0142716406060115.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
The article by Clahsen and Felser (CF) on grammatical processing in language learning is a timely and much-needed synthesis of research on this topic. It correctly identifies both morphological processing and syntactic processing as key areas that require attention. This commentary raises two issues: the relationship between the grammar and the parser, and the need for a transition theory in adult second language (L2) learning.
7

Gildea, Daniel. „Grammar Factorization by Tree Decomposition“. Computational Linguistics 37, Nr. 1 (März 2011): 231–48. http://dx.doi.org/10.1162/coli_a_00040.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
We describe the application of the graph-theoretic property known as treewidth to the problem of finding efficient parsing algorithms. This method, similar to the junction tree algorithm used in graphical models for machine learning, allows automatic discovery of efficient algorithms such as the O(n4) algorithm for bilexical grammars of Eisner and Satta. We examine the complexity of applying this method to parsing algorithms for general Linear Context-Free Rewriting Systems. We show that any polynomial-time algorithm for this problem would imply an improved approximation algorithm for the well-studied treewidth problem on general graphs.
8

Sun, Weiwei, und Xiaojun Wan. „Data-driven, PCFG-based and Pseudo-PCFG-based Models for Chinese Dependency Parsing“. Transactions of the Association for Computational Linguistics 1 (Dezember 2013): 301–14. http://dx.doi.org/10.1162/tacl_a_00229.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
We present a comparative study of transition-, graph- and PCFG-based models aimed at illuminating more precisely the likely contribution of CFGs in improving Chinese dependency parsing accuracy, especially by combining heterogeneous models. Inspired by the impact of a constituency grammar on dependency parsing, we propose several strategies to acquire pseudo CFGs only from dependency annotations. Compared to linguistic grammars learned from rich phrase-structure treebanks, well designed pseudo grammars achieve similar parsing accuracy and have equivalent contributions to parser ensemble. Moreover, pseudo grammars increase the diversity of base models; therefore, together with all other models, further improve system combination. Based on automatic POS tagging, our final model achieves a UAS of 87.23%, resulting in a significant improvement of the state of the art.
9

Kallmeyer, L., W. Maier, Y. Parmentier und J. Dellert. „TuLiPA - Parsing extensions of TAG with range concatenation grammars“. Bulletin of the Polish Academy of Sciences: Technical Sciences 58, Nr. 3 (01.09.2010): 377–91. http://dx.doi.org/10.2478/v10175-010-0036-0.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
TuLiPA - Parsing extensions of TAG with range concatenation grammarsIn this paper we present a parsing framework for extensions of Tree Adjoining Grammar (TAG) called TuLiPA (Tübingen Linguistic Parsing Architecture). In particular, besides TAG, the parser can process Tree-Tuple MCTAG with Shared Nodes (TT-MCTAG), a TAG-extension which has been proposed to deal with scrambling in free word order languages such as German. The central strategy of the parser is such that the incoming TT-MCTAG (or TAG) is transformed into an equivalent Range Concatenation Grammar (RCG) which, in turn, is then used for parsing. The RCG parser is an incremental Earley-style chart parser. In addition to the syntactic anlysis, TuLiPA computes also an underspecified semantic analysis for grammars that are equipped with semantic representations.
10

Cousot, Patrick, und Radhia Cousot. „Grammar semantics, analysis and parsing by abstract interpretation“. Theoretical Computer Science 412, Nr. 44 (Oktober 2011): 6135–92. http://dx.doi.org/10.1016/j.tcs.2011.06.005.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen
Die Auswahlen zum Thema "Grammar, comparative and general Parsing" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher

Dissertationen zum Thema "Grammar, comparative and general Parsing":

1

Daniels, Michael W. „Generalized ID/LP grammar a formalism for parsing linearization-Based HPSG grammars /“. Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1118867950.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Thesis (Ph.D.)--Ohio State University, 2005.
Title from first page of PDF file. Document formatted into pages; contains xiii, 173 p.; also includes graphics. Includes bibliographical references (p. 160-171). Available online via OhioLINK's ETD Center
2

Walenski, Matthew S. „Relating parsers and grammars : on the structure and real-time comprehension of English infinitival complements /“. Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2002. http://wwwlib.umi.com/cr/ucsd/fullcit?p3044770.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Yang, Yongsheng. „A maximum entropy approach to Chinese language parsing /“. View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20YANG.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002.
Includes bibliographical references (leaves 54-55). Also available in electronic version. Access restricted to campus users.
4

Prost, Jean-Philippe. „Modelling Syntactic Gradience with Loose Constraint-based Parsing“. Phd thesis, Université de Provence - Aix-Marseille I, 2008. http://tel.archives-ouvertes.fr/tel-00352828.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
La grammaticalité d'une phrase est habituellement conçue comme une notion binaire : une phrase est soit grammaticale, soit agrammaticale. Cependant, bon nombre de travaux se penchent de plus en plus sur l'étude de degrés d'acceptabilité intermédiaires, auxquels le terme de gradience fait parfois référence. À ce jour, la majorité de ces travaux s'est concentrée sur l'étude de l'évaluation humaine de la gradience syntaxique. Cette étude explore la possibilité de construire un modèle robuste qui s'accorde avec ces jugements humains.
Nous suggérons d'élargir au langage mal formé les concepts de Gradience Intersective et de Gradience Subsective, proposés par Aarts pour la modélisation de jugements graduels. Selon ce nouveau modèle, le problème que soulève la gradience concerne la classification d'un énoncé dans une catégorie particulière, selon des critères basés sur les caractéristiques syntaxiques de l'énoncé. Nous nous attachons à étendre la notion de Gradience Intersective (GI) afin qu'elle concerne le choix de la meilleure solution parmi un ensemble de candidats, et celle de Gradience Subsective (GS) pour qu'elle concerne le calcul du degré de typicité de cette structure au sein de sa catégorie. La GI est alors modélisée à l'aide d'un critère d'optimalité, tandis que la GS est modélisée par le calcul d'un degré d'acceptabilité grammaticale. Quant aux caractéristiques syntaxiques requises pour permettre de classer un énoncé, notre étude de différents cadres de représentation pour la syntaxe du langage naturel montre qu'elles peuvent aisément être représentées dans un cadre de syntaxe modèle-théorique (Model-Theoretic Syntax). Nous optons pour l'utilisation des Grammaires de Propriétés (GP), qui offrent, précisément, la possibilité de modéliser la caractérisation d'un énoncé. Nous présentons ici une solution entièrement automatisée pour la modélisation de la gradience syntaxique, qui procède de la caractérisation d'une phrase bien ou mal formée, de la génération d'un arbre syntaxique optimal, et du calcul d'un degré d'acceptabilité grammaticale pour l'énoncé.
À travers le développement de ce nouveau modèle, la contribution de ce travail comporte trois volets.
Premièrement, nous spécifions un système logique pour les GP qui permet la révision de sa formalisation sous l'angle de la théorie des modèles. Il s'attache notamment à formaliser les mécanismes de satisfaction et de relâche de contraintes mis en oeuvre dans les GP, ainsi que la façon dont ils permettent la projection d'une catégorie lors du processus d'analyse. Ce nouveau système introduit la notion de satisfaction relâchée, et une formulation en logique du premier ordre permettant de raisonner au sujet d'un énoncé.
Deuxièmement, nous présentons notre implantation du processus d'analyse syntaxique relâchée à base de contraintes (Loose Satisfaction Chart Parsing, ou LSCP), dont nous prouvons qu'elle génère toujours une analyse syntaxique complète et optimale. Cette approche est basée sur une technique de programmation dynamique (dynamic programming), ainsi que sur les mécanismes décrits ci-dessus. Bien que d'une complexité élevée, cette solution algorithmique présente des performances suffisantes pour nous permettre d'expérimenter notre modèle de gradience.
Et troisièmement, après avoir postulé que la prédiction de jugements humains d'acceptabilité peut se baser sur des facteurs dérivés de la LSCP, nous présentons un modèle numérique pour l'estimation du degré d'acceptabilité grammaticale d'un énoncé. Nous mesurons une bonne corrélation de ces scores avec des jugements humains d'acceptabilité grammaticale. Qui plus est, notre modèle s'avère obtenir de meilleures performances que celles obtenues par un modèle préexistant que nous utilisons comme référence, et qui, quant à lui, a été expérimenté à l'aide d'analyses syntaxiques générées manuellement.
5

Sharp, Randall Martin. „A model of grammar based on principles of government and binding“. Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/24917.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
This thesis describes an implementation of a model of natural language grammar based on current theories of transformational grammar, collectively referred to as Government and Binding (GB) theory. A description is presented of the principles of GB, including X-bar syntax and the theories of Case, Theta, Binding, Bounding, and Government The principles, in effect, constitute an embodiment of "universal grammar" (UG), i.e. the abstract characterization of the innately endowed human language faculty. Associated with the principles is a set of parameters that alter the effect of the principles. The "core grammar" of a specific language is an instantiation of UG with the parameters set in a particular way. To demonstrate the cross-linguistic nature of the theory, a subset of the "core grammars" of Spanish and English is implemented, including their parametric values and certain language-specific transformations required to characterize grammatical sentences. Sentences in one language are read in and converted through a series of reverse transformations to a base representation in the target language. To this representation, transformations are applied that produce a set of output sentences. The well-formedness of these sentences is verified by the general principles of UG as controlled by the parameters. Any that fail to meet the conditions are rejected so that only grammatical sentences are displayed. The model is written in the Prolog programming language.
Science, Faculty of
Computer Science, Department of
Graduate
6

Grindlay, Benjamin James William. „Missing the point : the effect of punctuation on reading performance“. Title page, abstract and contents only, 2002. http://web4.library.adelaide.edu.au/theses/09PH/09phg866.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Altmann, Gerald T. M. „Reference and the resolution of local syntactic ambiguity : the effect of context during human sentence processing“. Thesis, University of Edinburgh, 1986. http://hdl.handle.net/1842/6672.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
In this thesis we shall investigate the kinds of information which the Human Sentence Processing Mechanism employs during the resolution of local syntactic ambiguity in written texts. The thesis is in three parts. In Part I we consider some current models of syntactic ambiguity resolution. On the one hand, we consider the structural approaches, in which the processor considers only syntactic information when choosing between alternatives. On the other, we consider the interactive approaches, in which different kinds of information are brought to bear during the resolution process. In Part II, we describe a number of experiments which contrast the predictions of these two approaches. In particular, we investigate the processing of sentences which are locally ambiguous between a simple noun phrase analysis and a complex noun phrase analysis. Frazier (1979) predicts that the simple noun phrase analysis is chosen because it utilizes fewest phrasal nodes in its associated phrase marker. Crain and Steedman (1985), however, predict that the interpretation of the noun phrase is determined by referential factors, such as whether or not a unique referent can be identified for the noun phrase. The results support Crain and Steedman's interactive hypothesis. In Part III, we consider some theoretical issues concerning the timing of the processor's decisions. Crain and Steedman's original model is modified in the light of such considerations. We explore the implications of the modification for the status of syntax and semantics within our model of sentence comprehension. In the final chapter, we attempt to explain the existence of parsing preferences in sentences which are presented in isolation, and for which no explicit contextual information has been provided. We conclude that contextual considerations, such as the distinction between what is and what is not already known to the hearer, are of fundamental importance during the resolution of local syntactic ambiguity by the Human Sentence Processing Mechanism.
8

Cheung, Yam-Leung. „The negative wh-construction“. Diss., Restricted to subscribing institutions, 2008. http://proquest.umi.com/pqdweb?did=1779690041&sid=25&Fmt=2&clientId=48051&RQT=309&VName=PQD.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Finer, Daniel L. „The formal grammar of switch-reference“. New York : Garland, 1985. http://books.google.com/books?id=xkxiAAAAMAAJ.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Sato, Hiromi. „Selection for clausal complements and tense features /“. Thesis, Connect to this title online; UW restricted, 2003. http://hdl.handle.net/1773/8432.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "Grammar, comparative and general Parsing":

1

Gorrell, Paul. Syntax and parsing. Cambridge [England]: Cambridge University Press, 1995.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Sabourin, Conrad. Computational parsing: Bibliography. Montréal, Qué: Infolingua, 1994.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Zoll, Cheryl. Parsing below the segment in a constraint-based framework. Stanford, Calif: CSLI Publications, 1998.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Pritchett, Bradley L. Grammatical competence and parsing performance. Chicago: University of Chicago Press, 1992.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Sabourin, Conrad. Computational parsing: Syntactic analysis, semantic interpretation, parsing algorithms, parsing strategies : bibliography. Montréal: Infolingua, 1994.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Ranta, Aarne. Grammatical framework: Programming with multilingual grammars. Stanford, Calif: CSLI Publications, Center for the Study of Language and Information, 2011.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Vincenzi, Marica De. Syntactic parsing strategies in Italian: The minimal chain principle. Dordrecht: Kluwer Academic Publishers, 1991.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Yamashita, Hiroko. Processing and producing head-final structures. Dordrecht: Springer, 2011.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Hemforth, Barbara. Kognitives Parsing: Repräsentation und Verarbeitung sprachlichen Wissens. Sankt Augustin: Infix, 1993.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Shieber, Stuart M. Constraint-based grammar formalisms: Parsing and type inference for natural and computer languages. Cambridge, Mass: MIT Press, 1992.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "Grammar, comparative and general Parsing":

1

Infante-Lopez, Gabriel, und Martín Ariel Domínguez. „A New General Grammar Formalism for Parsing“. In Advances in Artificial Intelligence, 244–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-25324-9_21.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

„General“. In Comparative Grammar of the Semitic Languages, 109–10. Routledge, 2015. http://dx.doi.org/10.4324/9781315011707-17.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

„General“. In Comparative Grammar of the Semitic Languages, 176–89. Routledge, 2015. http://dx.doi.org/10.4324/9781315011707-26.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

„CHAPTER II. GENERAL SURVEY OF THE SEMITIC LANGUAGES“. In Lectures on the Comparative Grammar of the Semitic Languages, 10–34. Piscataway, NJ, USA: Gorgias Press, 2002. http://dx.doi.org/10.31826/9781463207922-004.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Sierra, Josefina, und Josefina Santibáñez. „Propositional Logic Syntax Acquisition Using Induction and Self-Organisation“. In Handbook of Research on Agent-Based Societies, 185–98. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-236-7.ch013.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
This chapter addresses the problem of the acquisition of the syntax of propositional logic. An approach based on general purpose cognitive capacities such as invention, adoption, parsing, generation, and induction is proposed. Self-organisation principles are used to show how a shared set of preferred lexical entries and grammatical constructions, that is, a language, can emerge in a population of autonomous agents which do not have any initial linguistic knowledge. Experiments in which a population of autonomous agents constructs a grammar that allows communicating the formulas of a propositional logic language are presented. These experiments extend previous work by considering a larger population and a much larger search space of grammar rules. In particular, the agents are allowed to order the expressions associated with the constituents of a logical formula in arbitrary order. Previous work assumed that the expressions associated with the connectives should be placed in the first position of the sentence.

Konferenzberichte zum Thema "Grammar, comparative and general Parsing":

1

Rosen, David W. „Efficient Converters for Feature-Based Mechanical Component Representations“. In ASME 1993 Design Technical Conferences. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/detc1993-0398.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Annotation:
Abstract To enable the development of design-for-manufacturability tools for thin-walled mechanical components, converters are needed to convert design representations of components into representations with which manufacturability evaluations can be performed. In our work components are designed with features and represented as graphs. Conversely, manufacturing representations consist of manufacturing features, that in general are different than design features. Thus, the problem of converting feature-based representations arises. In this paper, manufacturing features are defined using graph grammars which provide a general, formal, structured description of how to convert features. Unfortunately, using graph grammar parsing as the basis for conversion is not computationally viable due to the nature of graph isomorphism determination. By taking advantage of the known structure of design representations and of manufacturing features, and by utilizing AI techniques for efficient pattern-matchers, it is shown that efficient converters can be constructed that do not require graph isomorphism determination. Conditions are given for the construction of polynomial time converters and a general conversion module is presented. An example converter is illustrated for tooling cost evaluation in injection molding and die casting.

Zur Bibliographie