... Sci.,10(1):136–163.Aravind K. Joshi and Yves Schabes. 1992. Tree- adjoining grammarsand lexicalized grammars. InMaurice Nivat and Andreas Podelski, editors, Tree Au-tomata and Languages. North-Holland.Aravind ... Joshi and Yves Schabes. 1997. Tree- adjoining grammars. In Grzegorz Rozenberg and ArtoSalomaa, editors, Beyond Words, volume 3 of Hand-book ofFormal Languages, pages 69–123. Springer.Makoto Kanazawa. ... research.nii.ac.jp/˜kanazawa.Makoto Kanazawa and Ryo Yoshinaka. 2005. Lexical-ization of second-order ACGs. Technical Report NII-2005-012E, National Institute of Informatics, Tokyo,Japan.Stephan Kepser and James...
... we extract TAGgrammarsandtree schemata. Above all, full-scale syntactic tags and well-formed morphological analy-sis in Sejong Treebank allow us to extract syntactic features. In addition, ... Introduction An electronic grammar is an interface between the complexity and the diversity of natural language and the regularity and the effectiveness ofa lan-guage processing, and it is one of the ... grammar development have been taken during last decades. Automatic grammar development means that a system extracts a grammar from a Treebank which has an implicit Treebank grammar. The grammar...
... formulation of derivation for tree- adjoining grammars has important ramifications for a wide variety of uses of the formalism, from syntactic analysis to semantic interpretation and statistical language ... Levy, and M. Takahashi. 1975. Tree adjunct grammars. Journal of Com- puter and System Sciences, 10(1). Anthony Kroch and Aravind K. Joshi. 1985. Lin- guistic relevance oftreeadjoining grammars. ... structures. Statis- tical analysis can be explored through the speci- fication of derivational probabilities as formalized in stochastic tree- adjoining grammars. Semantic analysis can be overlaid through...
... Combinatory Graanmaxs and Paxasitic Gaps. Natural Language and Linguistic The- ory, 5:403-439. Frank van Haxmelen a~ d Allan Bundy. 1988. Explemation-Based Generafization Paxtial Evalua- tion. ... Some Novel Applications of Explanation-Based Learning to Parsing Lexicalized Tree- Adjoining Grammars& quot; B. Srinivas and Aravind K. Joshi Department of Computer and Information Science ... developing tree- adjoining grammars. In Third Conference on Ap- plied Natural Language Processing, Trento, Italy. Manny Rayner. 1988. Applying Explanation-Based Generalization to Natural Langua4ge...
... German andsome other languages, cannot be adequately described with a TAG. We have proposed two more powerful exten- sions of TAG: a variant of the well-studied MC -TAG, and aTAG formalism ... of Pennsylvania. - 26 - Long-Distance Scrambling andTreeAdjoining Grammars* Tilman Becker~ Aravind K. Joshi, Owen Rainbow University of Pennsylvania, Department of Computer and Information ... in a standard TAG, the ID relation between a mother and a daughter node is not necessarily an immediate dominance relation because of the possibility of ad- joining another tree at the daughter...
... lavelli/satta@irst.it Abstract In this paper a bidirectional parser for Lexicalized Tree AdjoiningGrammars will be presented. The algorithm takes advantage ofa peculiar characteristic of Lexicalized TAGs, ... (Vijay-Shanker and Joshi, 1985, Harbusch, 1990), hence they cannot take ad- vantage of anchor information in a direct way. The presented algorithm directly exploits both the advan- tages of ... Pittsburgh, PA. Schabes, Yves, 1990. Mathematical and Computational Aspects of Lexicalized Grammars. PhD Thesis, Department of Computer and Information Science, University of Pennsylvania. Schabes,...
... Computational Linguis- tics, 17(3):315-323. A. K. Joshi and Y. Schabes. 1992. Tree- adjoining gram- mars and lexicalized grammars. In M. Nivat and A. Podelski, editors, Tree automata and languages, ... formalism and its linguistic rele- vance. TAGs have been shown to have relations with both phrase-structure grammarsand de- pendency grammars (Rambow and Joshi, 1995), which is relevant because ... NT is a set of nonterminal symbols, E is a set of terminal symbols, 2: is a set of initial trees and .A is a set of auxiliary trees. Trees in :TU .A are also called elementary trees. We...
... will make some assumptions on all tree- adjoining grammars (and synchronous tree- adjoining grammars) . A tree- adjoining grammar (TAG) is a finite set of initial trees anda finite set of auxiliary trees. ... 43002 Tarragona, Spain.andreas.maletti@urv.catAbstract A characterization of the expressive power of synchronous tree- adjoining grammars (STAGs) in terms oftree transducers (orequivalently, synchronous ... we assumethat all adjunctions are mandatory; i.e., if an aux-iliary tree can be adjoined, then we need to make an adjunction. Thus, a derivation starting from an initial tree to a derived tree...
... extended domain of locality and "mildly-context sensitive" power) makes it attractive to Natural Language Processing : LTAGs are parsable in polynomial time and allow an elegant and psycholinguistically ... Parsing preferences with Lexicalized TreeAdjoiningGrammars : exploiting the derivation tree Alexandra KINYON TALANA Universite Paris 7, case 7003, 2pl Jussieu 75005 Paris France Alexandra.Kinyon@linguist.jussieu.fr ... must be a leaf node for each realized argument of the head ofan elementary tree. • Semantic consistency : No elementary tree is semantically void • Semantic minimality : an elementary tree...
... cat> =np. This says that Give is a verb, with vp as its pa- rent, an s as its grandparent andan NP to the left of its parent. It also has an NP to its right, anda tree rooted in a ... inheritance allows us to manipulate total instead of partial de- scriptions of trees. The abstract verb class in the Vijay-Shanker & Schabes account subsumes both in- transitive and transitive ... specifications to which additional featural information may be added 5, and are anno- tated to indicate node type: <> indicates an anchor node, and I indicates a substitution node (where a...
... wrapping operation W of MHG's and the adjoining operation of TAG& apos;s. 2.1 Wrapping andAdjoining The weak equivalence of MHG's and TAG& apos;s is a conse- quence of the similarities ... Head Grammarsand Natural Language. PhD thesis, Stanford University, August, 1984. [6] Roach, K. FormalPropertiesof Head Grammars. 1985. Presented at Mathematics of Language workshop at ... University of Pennsylvania, Philadelphia, January, 1986. [4] Kroch, A. and Joshi, A. K. Linguistic Relevance ofTree Adjoining Grammars. Technical Report MS-CIS-85- 18, Department of Computer and...