J. Carroll and D. Weir. Encoding frequency information in lexicalized grammars. In Proceedings of the 5 Int. Workshop on Parsing Technologies, MIT, Cambridge, MA, September 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Parsing Techniques for Lexicalized Context-Free Grammars - Satta (2000) (2 citations) (Correct)
....properties that are common to several of the above mentioned lexicalized grammars. In what follows, we report a formal definition of LCFGs and give a brief outline of the results that will be more carefully presented in the talk. Other abstractions of lexicalized grammars have been presented in [2] and in [10] In those works, however, the major emphasis is on the study of linguistic expressiveness and of parameter estimation problems, respectively, for different lexicalized grammar formalisms. 2 Lexicalized context free grammars We can think of a lexicalized context free grammar as a ....
J. Carroll and D. Weir. Encoding frequency information in lexicalized grammars. In Proceedings of the 5 Int. Workshop on Parsing Technologies, MIT, Cambridge, MA, September 1997.
What is the Minimal Set of Fragments that Achieves Maximal Parse.. - Bod (6 citations) (Correct)
....language parsing. As it happens, quite some convergence has already taken place. The history of stochastic parsing models shows a consistent increase in the scope of statistical dependencies that are captured by these models. Figure 4 gives a (very) schematic overview of this increase (see Carroll Weir 2000, for a more detailed account of a subsumption lattice where SCFG is at the bottom and DOP at the top) context free rules Charniak (1996) Collins (1996) Eisner (1996) context free rules, headwords Charniak (1997) context free rules, headwords, grandparent nodes Collins (2000) ....
J. Carroll and D. Weir, 2000. Encoding Frequency Information in Lexicalized Grammars, in H. Bunt and A. Nijholt (eds.), Advances in Probabilistic and Other Parsing Technologies, Kluwer Academic Publishers.
Probabilistic State-Dependent Grammars for Plan Recognition - Pynadath, Wellman (2000) (8 citations) (Correct)
....contextfree grammar (PCFG) Charniak, 1993; Gonzalez Thomason, 1978) to represent a distribution over possible action sequences. Existing PCFG parsing algorithms would support a restricted set of plan recognition queries. Other grammatical models (Black et al. 1992; Schabes Waters, 1993; Carroll Weir, 1997; Magerman, 1995) make fewer independence assumptions than do PCFGs (thus supporting a wider class of problem domains) while still supporting efficient parsing algorithms. The typical parsing algorithm produces the conditional probability of a particular symbol (subplan) or parse tree (plan ....
Carroll, J. & Weir, D. (1997). Encoding frequency information in lexicalized grammars. In Proceedings of the International Workshop on Parsing Technologies, pp. 8--17.
A Faster Parsing Algorithm for Lexicalized Tree-Adjoining.. - Eisner, Satta (2000) (Correct)
....as one another, differing only in their selectional constraints. Thus, the selectional constraints at each node in an elementary tree only depend on the tree s head and the internal structure of the tree itself. Grammars satisfying this requirement have been called node dependent or SLG(2) in (Carroll Weir, 1997), and bilexical in (Eisner, 1997; Eisner Satta, 1999; Eisner, 2000) If we drop the above assumption, the grammar can capture lexical relations of arity larger than two. For instance, in an LTAG which is not bilexical, a verb V 1 could anchor many instances of the basic transitive sentence ....
CARROLL J. & WEIR D. (1997). Encoding frequency information in lexicalized grammars. In Proceedings of the 5 th Int. Workshop on Parsing Technologies, MIT, Cambridge, MA.
Learning Stochastic Lexicalized Tree Grammars from HPSG - Neumann, Flickinger (1999) (7 citations) (Correct)
....considerably, such that processing times of other components (lexical and morphological processing) become crucial. It is not difficult to integrate these pruning strategies into our parser (see sec. 3) which would help us to keep the chart as small as possible during parsing of one sentence. In [ Carroll and Weir, 1997 ] a classification of different methods (named S(1) to S(4) for encoding frequency information in lexicalized grammars is given and applied to prominent existing approaches. The one with the most globally dependent frequencies is S(4) and Bod s DOP framework [ Bod, 1995 ] actually belongs to that ....
J. Carroll and D. Weir. Encoding frequency information in lexicalized grammars. In Proceedings of 5th ACL/SIGPARSE International Workshop on Parsing Technologies, MIT, Cambridge, 1997.
Conditions on Consistency of Probabilistic Tree Adjoining Grammars - Sarkar (Correct)
....random) value for each parameter. If the initial assignment causes the grammar to be inconsistent, then iterative re estimation might converge to an inconsistent grammar 1 . ffl Techniques used in this paper can be used to determine consistency for other probability models based on TAGs (Carroll and Weir, 1997). 2 Notation In this section we establish some notational conventions and definitions that we use in this paper. Those familiar with the TAG formalism only need to give a cursory glance through this section. A probabilistic TAG is represented by (N; Sigma; I; A; S; OE) where N; Sigma are, ....
J. Carroll and D. Weir. 1997. Encoding frequency information in lexicalized grammars. In Proc. 5th Int'l Workshop on Parsing Technologies IWPT-97, Cambridge, Mass.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC