Jones, M. A., & Eisner, J. (1992). A probabilistic parser and its application. In AAAI-92 Workshop on Statistically-Based NLP Techniques, San Jose, CA, pp. 20--27. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Role of the Lemma in Form Variation - Jurafsky, Bell, Girand (2000) (1 citation) (Correct)
....English function words, describes lemma based variation for different functions of that, some, there, and must. Such a difference has been repeatedly noted between the pronoun that (That was pretty heart rending for her) and the complementizer that (I can t say that I m an expert on the region) (Jones Eisner, 1992; Jespersen, 1933; Berkenfield, 2000) In this paper we examine the role of the lemma in explaining these kinds of variation. For example, consider the word to. Here a single wordform tu is shared by (at least) two lemmas: an infinitive marker ( we had to do it ) and a preposition ( I would ....
Jones, M. A., & Eisner, J. (1992). A probabilistic parser and its application. In AAAI-92 Workshop on Statistically-Based NLP Techniques, San Jose, CA, pp. 20--27.
An Efficient Probabilistic Context-Free Parsing Algorithm that.. - Stolcke (1995) (40 citations) (Correct)
....language syntax. In their probabilistic version, which defines a language as a probability distribution over strings, they have been used in a variety of applications: for the selection of parses for ambiguous inputs (Fujisaki et al. 1991) to guide the rule choice efficiently during parsing (Jones Eisner 1992); to compute island probabilities for non linear parsing (Corazza et al. 1991) In speech recognition, probabilistic context free grammars play a central role in integrating low level word models with higher level language models (Ney 1992) as well as in non finite state acoustic and phonotactic ....
.... acoustic and phonotactic modeling (Lari Young 1991) In some work, context free grammars are combined with scoring functions that are not strictly probabilistic (Nakagawa 1987) or they are used with context sensitive and or semantic probabilities (Magerman Marcus 1991; Magerman Weir 1992; Jones Eisner 1992; Briscoe Carroll 1993) Although clearly not a perfect model of natural language, stochastic context free grammars (SCFGs) are superior to non probabilistic CFGs, with probability theory providing a sound theoretical basis for ranking and pruning of parses, as well as for integration with ....
Jones, Mark A., & Jason M. Eisner. 1992. A probabilistic parser and its applications. In AAAI Workshop on Statistically-Based NLP Techniques, 20--27, San Jose, CA.
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