Home Catalogue search

eng

Refine your search:

Search in the Catalogues and Directories






	Sort by
Simple Search

Page: 1 2 3 4

Hits 1 – 20 of 66

1	Strong Learning of Probabilistic Tree Adjoining Grammars
	Clark, Alexander
	In: Proceedings of the Society for Computation in Linguistics (2021)
	BASE
	Show details

2	Minimalist Grammars in the Light of Logic
	Salvati, Sylvain
	In: https://hal.inria.fr/inria-00563807 ; [Research Report] 2011, pp.39 (2011)
	BASE
	Show details

3	The Copying Power of Well-Nested Multiple Context-Free Grammars
	Makoto, Kanazawa; Salvati, Sylvain
	In: Language and Automata Theory and Applications ; https://hal.inria.fr/inria-00525077 ; Language and Automata Theory and Applications, 2010, Trier, Germany. pp.344-355, ⟨10.1007/978-3-642-13089-2_29⟩ ; http://www.springerlink.com/content/b8w7r53761614lk7/ (2010)
	BASE
	Show details

4	On the relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG)
	Kallmeyer, Laura; Parmentier, Yannick
	In: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008) ; https://hal.inria.fr/inria-00232587 ; 2nd International Conference on Language and Automata Theory and Applications (LATA 2008), Research Group on Mathematical Linguistics at Universitat Rovira i Virgili University, Mar 2008, Tarragona, Spain. pp.263-274 (2008)
	BASE
	Show details

5	Type logic served by co-Merge, Merge and Move: an account for sluicing and questions of “common European” and Japanese types
	Zakharyaschev, Ivan
	In: Syntactic structures / Синтаксические Структуры (Sintaksicheskie struktury) ; https://hal.inria.fr/inria-00138201 ; Syntactic structures / Синтаксические Структуры (Sintaksicheskie struktury), A.B. Letuchiy, V.S. Volk, N.A. Korotkova, Ya.G. Testelets, Apr 2007, Moscow, Russia (2007)
	BASE
	Show details

6	A Case Study of the Convergence of Mildly Context-Sensitive Formalisms for Natural Language Syntax: from Minimalist Grammars to Multiple Context-Free Grammars
	Mery, Bruno; Amblard, Maxime; Durand, Irène...
	In: https://hal.inria.fr/inria-00117306 ; [Research Report] RR-6042, INRIA. 2006, pp.67 (2006)
	BASE
	Show details

7	Encoding second order string ACG with Deterministic Tree Walking Transducers.
	Salvati, Sylvain
	In: The 11th conference on Formal Grammar ; https://hal.inria.fr/inria-00333886 ; The 11th conference on Formal Grammar, Paola Monachesi; Gerald Penn; Giorgio Satta; Shuly Wintner, 2006, Malaga, Spain. pp.143-156 (2006)
	BASE
	Show details

8	Parsing TAG with Abstract Categorial Grammar.
	Salvati, Sylvain
	In: TAG+8: Workshop On Tree Adjoining Grammar And Related Formalisms ; https://hal.inria.fr/inria-00334009 ; TAG+8: Workshop On Tree Adjoining Grammar And Related Formalisms, 2006, Sidney, Australia (2006)
	BASE
	Show details

9	Learning Recursive Automata from Positive Examples
	Tellier, Isabelle
	In: ISSN: 0992-499X ; EISSN: 1958-5748 ; Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle ; https://hal.inria.fr/inria-00470101 ; Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, Lavoisier, 2006, New Methods in Machine Learning. Theory and Applications, 20 (6), pp.775-804. ⟨10.3166/ria.20.775-804⟩ (2006)
	BASE
	Show details

10	Consolidating the Results of the CIRCSIM-Tutor Project and Further Consolidation of the Results of the CIRCSIM-Tutor Project
	Evens, Martha W.
	In: DTIC AND NTIS (2003)
	BASE
	Show details

11	Language Independent NER using a Unified Model of Internal and Contextual Evidence
	Cucerzan, Silviu; Yarowsky, David
	In: DTIC (2002)
	BASE
	Show details

12	Chinese Numbers, MIX, Scrambling, and Range Concatenation Grammars
	Boullier, Pierre
	In: https://hal.inria.fr/inria-00073064 ; [Research Report] RR-3614, INRIA. 1999 (1999)
	BASE
	Show details

13	A Methodological Study: A Semiotic Approach to Analyzing the Content of Information
	Ainslie, Frances M.; Atwood, Nancy A.; Burnstein, David D....
	In: DTIC AND NTIS (1996)
	BASE
	Show details

14	Language and Logic: Research in the Formalization of Discourse.
	Perlis, Donald; Perlis, Elizabeth
	In: DTIC AND NTIS (1996)
	BASE
	Show details

15	Centering: A Framework for Modelling the Local Coherence of Discourse
	Grosz, Barbara J.; Joshi, Aravind K.; Weinstein, Scott
	In: DTIC AND NTIS (1995)
	BASE
	Show details

16	Perceptions of Coherence and Usability in Environmental Impact Documents As Functions of Visual and Linguistic Cues.
	Shankland, Ronald B.
	In: DTIC AND NTIS (1995)
	BASE
	Show details

17	The Unsupervised Acquisition of a Lexicon from Continuous Speech.
	De Marcken, Carl
	In: DTIC AND NTIS (1995)
	BASE
	Show details

18	Text-To-Speech Phrasing Enhancement System Using Neural Networks.
	Julig, Louise F.
	In: DTIC AND NTIS (1995)
	BASE
	Show details

19	BBN: Description of the PLUM System as Used for MUC-5
	Weischedel, Ralph; Ayuso, Damaris; Boisen, Sean...
	In: DTIC (1993)
	BASE
	Show details

20	Labelled Formal Languages and Their Uses.
	Greene, Daniel H.
	In: DTIC AND NTIS (1991)
	Abstract: This research augments formal languages with the machinery necessary to describe labelled combinatorial objects such as trees, permutations, and networks. The most attractive feature of this method of describing combinatorial objects is the direct translation to generating functions, treating the grammar of an ordinary formal language as a set of equations and then solving these equations yields an enumerating generating function. This is still true of labelled formal languages although the equations are usually differential rather than rational or algebraic. There are two promising applications for labelled formal languages. In the analysis of algorithms one often identifies combinatorial quantities that can be described with labelled formal languages and, using the translation mentioned about, these quantities can be easily computed. The other application uses labelled formal languages to control a general-purpose system for the ranking, sequencing, and selection of combinatorial objects. Both of these applications demonstrate the value of labelled formal languages as a descriptive and analytic tool.
	Keyword: ALGORITHMS; PROGRAMMING LANGUAGES; COMBINATORIAL ANALYSIS; COMPUTER LOGIC; COMPUTER PROGRAMMING; Computer Programming and Software; CONTEXT SENSITIVE GRAMMARS; FIELDS(COMPUTER PROGRAMS); PERMUTATIONS; THESES
	URL: http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA328418 http://www.dtic.mil/docs/citations/ADA328418
	BASE
	Hide details

Page: 1 2 3 4

© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern