55 Hits in 4.4 sec

Page 3617 of Mathematical Reviews Vol. , Issue 2000e [page]

2000 Mathematical Reviews  
and tree adjoining grammars.  ...  In the past, various formalisms extending context-free grammars have proved equivalent to tree adjoining grammars (TAGs), introduced by computational linguists to model natural languages.  ... 

Page 455 of Computational Linguistics Vol. 23, Issue 3 [page]

1997 Computational Linguistics  
Bidirectional parsing of lexicalized tree adjoining grammar. In Proceedings of the Fifth Conference of the European Chapter of the Association for Computational Linguistics, Berlin. Matsumoto, Y., H.  ...  In Proceedings of the IEEE Conference of the 11th Annual Symposium on Switching and Automata Theory, pages 139-152. Sahlin, Dan. 1991. An Automatic Partial Evaluator for Full Prolog.  ... 

Bidirectional Push Down Automata [chapter]

Miguel A. Alonso, Víctor J. Díaz, Manuel Vilares
2003 Lecture Notes in Computer Science  
We define a new model of automata for the description of bidirectional parsing strategies for context-free grammars and a tabulation mechanism that allow them to be executed in polynomial time.  ...  This new model of automata provides a modular way of defining bidirectional parsers, separating the description of a strategy from its execution.  ...  In this direction, we have investigated a bidirectional version of Linear Indexed Automata for Tree Adjoining Grammars [1] .  ... 
doi:10.1007/3-540-44977-9_3 fatcat:syai6czn2rbprd6unc5dqbefem

Closure properties of linear context-free tree languages with an application to optimality theory

Stephan Kepser, Uwe Mönnich
2006 Theoretical Computer Science  
Context-free tree grammars, originally introduced by Rounds [Math. Systems Theory 4(3) (1970) , are powerful grammar devices for the definition of tree languages.  ...  For this class of linear context-free tree languages we show that the grammar derivation mode, which is very important for the general class of context-free tree languages, is immaterial.  ...  mechanisms of multiple context-free grammars, multicomponent tree adjoining grammars or linear context-free rewriting systems.  ... 
doi:10.1016/j.tcs.2005.11.024 fatcat:er5igrghifc2xg2wxwoti733lu

Learning Recursive Automata from Positive Examples

Isabelle Tellier
2006 Revue d'intelligence artificielle : Revue des Sciences et Technologies de l'Information  
The relation between these generalized automata and categorial grammars is studied in detail.  ...  Finally, new learnable subclasses of categorial grammars are defined, for which learning from strings is nearly not more expensive than from structures. RÉSUMÉ.  ...  This operation can be seen as what is called a substitution, explicitly used in the formalism of Tree Adjoining Grammars, for example (Joshi et al., 1997) .  ... 
doi:10.3166/ria.20.775-804 fatcat:s4kxnkdtefb7daokgwnihiaq5i

Parsing natural language idioms with bidirectional finite-state machines

T. Poibeau
2001 Theoretical Computer Science  
In this paper, we introduce the notion of bidirectional ÿnite-state automata (BFSA). A BFSA is deÿned by the following sequence: A left :!:A right , where !  ...  We present the use of such devices for natural language processing. In this context, BFSA have to be enriched with notions of proximity, optionality and contextual information.  ...  For a more complete implementation and some considerations on the problem, see [5, 14] . In analogy with the notion of tree family in Tree Adjoining Grammars (TAG), see [1] .  ... 
doi:10.1016/s0304-3975(00)00300-5 fatcat:du6i7thc7jh4lkvg62m4e7pcfm

6 — Program transformations [chapter]

1981 Lecture Notes in Computer Science  
We received kind help from Job Honig, Theo Vosse, John Carroll, and Hans de Vreught in finding a practical grammar for testing our algorithms from Chapter 4 on.  ...  This algorithm does not do much more than generalize backtracking: it allows the search tree to be investigated not only in depth-first order but also, for example, in breadth-first order.  ...  We have described part of an implementation which takes a context-free parse forest produced by some context-free parsing algorithm and turns it into a single decorated parse tree.  ... 
doi:10.1007/3-540-10284-1_6 fatcat:es5rjudpajglpmkjzzwsqsipzy

Valency-Augmented Dependency Parsing

Tianze Shi, Lillian Lee
2018 Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing  
We further show that our approach can be applied to an ostensibly different formalism and dataset, Tree Adjoining Grammar as extracted from the Penn Treebank; there, we outperform the previous stateof-the-art  ...  We present a complete, automated, and efficient approach for utilizing valency analysis in making dependency parsing decisions.  ...  Ana Smith for discussion and comments.  ... 
doi:10.18653/v1/d18-1159 dblp:conf/emnlp/ShiL18 fatcat:p33x22qewzdqrkryzwlarlyebm

Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence

Caio Corro, Joseph Le Roux, Mathieu Lacroix
2017 Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing  
We present a new method for the joint task of tagging and non-projective dependency parsing.  ...  main contributions of this paper are (1) a reduction from joint tagging and non-projective dependency parsing to the Generalized Maximum Spanning Arborescence problem, and (2) a novel decoding algorithm for  ...  Acknowledgements We thank the anonymous reviewers for their insightful comments. We thank Laura Kallmeyer and Kilian Evang for providing us with the script for the discontinuous PTB.  ... 
doi:10.18653/v1/d17-1172 dblp:conf/emnlp/CorroRL17 fatcat:pazp3dyeljcdfm3bjarjo5y7be

Formal Basis of a Language Universal

Milos Stanojevic, Mark Steedman
2021 Computational Linguistics  
Acknowledgments We are grateful to Peter Buneman, Shay Cohen, Paula Merlo, Chris Stone, Bonnie Webber, and the Referees for Computational Linguistics for helpful comments and advice.  ...  TAG Tree-Adjoining Grammars (Joshi 1985) are often compared to CCG because they are weakly equivalent, in the sense that they generate the same set of languages (Joshi, Vijay-Shanker, and Weir 1991)  ...  However, there is an interesting relation between the sorting automata for 231-avoiding permutations and the automata that sort separable permutations: 231-avoiding permutations are sortable with a single  ... 
doi:10.1162/coli_a_00394 dblp:journals/coling/StanojevicS21 fatcat:kdye5tsdljbubnkhnqbt32lzsm

Mobile Speech-to-Speech Translation of Spontaneous Dialogs: An Overview of the Final Verbmobil System [chapter]

Wolfgang Wahlster
2000 Artificial Intelligence  
Verbmobil is a speaker-independent and bidirectional speech-to-speech translation system for spontaneous dialogs in mobile situations.  ...  We conclude that Verbmobil has successfully met the project goals with more than 80% of approximately correct translations and a 90% success rate for dialog tasks. In: Wahlster (ed.)  ...  Verbmobil's multilingual generator includes a constraint-based microplanning component and a syntactic realization module that is based on the formalism of lexicalized tree-adjoining grammars (see Becker  ... 
doi:10.1007/978-3-662-04230-4_1 fatcat:rwlz5um2frfahomh6wibs4bvom

Reinforcement learning of minimalist grammars [article]

Peter beim Graben, Ronald Römer, Werner Meyer, Markus Huber, Matthias Wolff
2020 arXiv   pre-print
We outline a reinforcement learning algorithm for the acquisition of syntax and semantics of English utterances, based on minimalist grammar (MG), a recent computational implementation of generative linguistics  ...  State-of-the-art language technology scans the acoustically analyzed speech signal for relevant keywords that are subsequently inserted into semantic slots to interpret the user's intent.  ...  Recent research in computational linguistics has demonstrated that quite different grammar formalisms, such as tree-adjoining grammar [26] , multiple context-free grammar [46] , range concatenation grammar  ... 
arXiv:2005.00359v1 fatcat:wl35pwsb3najdgc5etzuquqgye

Scientific modelling in generative grammar and the dynamic turn in syntax

Ryan M. Nefdt
2016 Linguistics and Philosophy  
the University of Newcastle and friends and colleagues at the Arché Research Centre in St Andrews for helpful discussion concerning many of the ideas presented here.  ...  I would also like to thank three anonymous reviewers of this journal for their comments and criticism which led to the further development of many ideas present in this work.  ...  In DS, one kind of underspecified content takes place at locations in trees which through the operation of adjunction (borrowed from Tree-Adjoining Grammar) can be fixed to unfixed nodes.  ... 
doi:10.1007/s10988-016-9193-4 fatcat:afeb3lx5ybcllbnsctsrcc6bpm

Semantic Role Labeling as Syntactic Dependency Parsing [article]

Tianze Shi, Igor Malioutov, Ozan İrsoy
2020 arXiv   pre-print
Our approach is motivated by our empirical analysis that shows three common syntactic patterns account for over 98% of the SRL annotations for both English and Chinese data.  ...  Based on this observation, we present a conversion scheme that packs SRL annotations into dependency tree representations through joint labels that permit highly accurate recovery back to the original  ...  Tsai for discussion and comments.  ... 
arXiv:2010.11170v1 fatcat:qolkf4y7xze2pis6pzrxanbhlq

Unifying Physical Interaction, Linguistic Communication, and Language Acquisition of Cognitive Agents by Minimalist Grammars

Ronald Römer, Peter beim Graben, Markus Huber-Liebl, Matthias Wolff
2022 Frontiers in Computer Science  
Specifically, we use minimalist grammar (MG) for this aim, which is a recent computational implementation of generative linguistics.  ...  To this aim we outline a reinforcement learning algorithm for the acquisition of syntax and semantics of English utterances.  ...  AUTHOR CONTRIBUTIONS All authors listed have made a substantial, direct, and intellectual contribution to the work and approved it for publication.  ... 
doi:10.3389/fcomp.2022.733596 doaj:cfc0b0e98c554b238bc21a6263fe832e fatcat:hqziga2ljffuhdshmlzcqvwcv4
« Previous Showing results 1 — 15 out of 55 results