An efficient implementation of a new POP model

10th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2003

Volumn , Issue , 2003, Pages 19-26

  Bod, Rens ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

% REDUCTIONS; EFFICIENT IMPLEMENTATION; ERROR RATE; FREQUENT SUBTREES; PARSE TREES; PROCESSING TIME; RELATIVE REDUCTION; SUB TREES; TREEBANKS; WALL STREET JOURNAL;

FORESTRY;

EID: 33646029849     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (44)

1. Black, E., J. Lafferty and S. Roukos, 1992. Development and Evaluation of a Broad-Coverage Probabilistic Grammar of English-Language Computer Manuals. Proceedings ACL'92, Newark, Delaware.
2. Black, E., R. Garside and G. Leech, 1993. Statistically-Driven Computer Grammars of English: The IBM/Lancaster Approach. Rodopi: Amsterdam-Atlanta.
3. Bod, R. 1992. Data Oriented Parsing, Proceedings COLING'92, Nantes, France.
4. Bod, R. 1993. Using an Annotated Language Corpus as a Virtual Stochastic Grammar, Proceedings AAAI'93, Washington D.C.
5. Bod, R. 1998. Beyond Grammar: An Experience-Based Theory of Language, Stanford, CSLI Publications.
6. Bod, R. 2000a. Combining Semantic and Syntactic Structure for Language Modeling in Speech Recognition. Proceedings ICSLP'2000, Beijing, China.
7. Bod, R. 2000b. Parsing with the Shortest Derivation, Proceedings COLING'2 000, Saarbriicken, Germany.
8. Bod, R. 2001. What is the Minimal Set of Subtrees that Achieves Maximal Parse Accuracy? Proceedings ACL'2001, Toulouse, France.
9. Bod, R. 2002. A Unified Model of Structural Organization in Language and Music. Journal of Artificial Intelligence Research 17, 289-308.
10. Bod, R. 2003. Do All Fragments Count? Natural Language Engineering, 9(2). (in press)
11. Bod, R., J. Hay and S. Jannedy (eds.), 2003a. Probabilistic Linguistics. Cambridge, the MIT Press.
12. Bod, R., R. Scha and K. Sima'an (eds.), 2003b. Data-Oriented Parsing. CSLI Publications.
13. Bonnema, R., R. Bod, and R. Scha, 1997. A DOP Model for Semantic Interpretation, Proceedings ACL/EACL-97, Madrid, Spain.
14. Bonnema, R., P. Buying and R. Scha, 1999. A New Probability Model for Data-Oriented Parsing, Proceedings of the 12th Amsterdam Colloquium, Amsterdam, The Netherlands.
15. Briscoe, T. and N. Waegner, 1992. Robust Stochastic Parsing Using the Inside-Outside Algorithm. in AAAI Workshop Notes on Statistically-Based Techniques in Natural Language Processing.
16. Chappelier J. and M. Rajman, 2000. Monte Carlo Sampling for NP-hard Maximization Problems in the Framework of Weighted Parsing. in NLP 2000, Lecture Notes in Artificial Intelligence 1835, 106-117.
17. Chappelier J., M. Rajman and A. Rozenknop, 2002. Polynomial Tree Substitution Grammars: Characterization and New Examples. Proceedings of 7th conference on Formal Grammar.
18. Charniak, E. 1996. Tree-bank Grammars, Proceedings AAAT96, Menlo Park, Ca.
19. Charniak, E. 1997. Statistical Parsing with a Context-Free Grammar and Word Statistics, Proceedings AAAI-97, Menlo Park, Ca.
20. Charniak, E. 2000. A Maximum-Entropy-Inspired Parser. Proceedings ANLP-NAACL'2000, Seattle, Washington.
21. Chiang, D. 2000. Statistical parsing with an automatically extracted tree adjoining grammar. Proceedings ACL'2000, Hong Kong, China.
22. Collins, M. 1996. A New Statistical Parser Based on Bigram Lexical Dependencies, Proceedings ACL'96, Santa Cruz, Ca.
23. Collins, M. 1997. Three Generative Lexicalised Models for Statistical Parsing, Proceedings ACL'97, Madrid, Spain.
24. Collins, M. 1999. Head-Driven Statistical Models for Natural Language Parsing, PhD thesis, University of Pennsylvania, PA.
25. Collins, M. 2000. Discriminative Reranking for Natural Language Parsing, Proceedings ICML-2000, Stanford, Ca.
26. Collins M. and N. Duffy, 2002. New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron. Proceedings ACL'2002, Philadelphia, PA.
27. Eisner, J. 1996. Three new probabilistic models for dependency parsing: an exploration. Proceedings COLING-96, Copenhagen, Denmark.
28. Eisner, J. 1997. Bilexical Grammars and a Cubic-Time Probabilistic Parser. Proceedings Fifth International Workshop on Parsing Technologies, Boston, Mass.
29. Fujisaki, T., F. Jelinek, J. Cocke, E. Black and T. Nishino, 1989. A Probabilistic Method for Sentence Disambiguation. Proceedings 1st Mt. Workshop on Parsing Technologies, Pittsburgh, PA.
30. Goodman, J. 1996. Efficient Algorithms for Parsing the DOP Model, Proceedings Empirical Methods in Natural Language Processing, Philadelphia, PA.
31. Goodman, J. 1998. Parsing Inside-Out, Ph.D. thesis, Harvard University, Mass.
32. Goodman, J. 2002. Efficient Parsing of DOP with PCFG-Reductions. To appear in Bod, R., Sima'an, K. and Scha, R. (eds), Data Oriented Parsing, Stanford, CSLI Publications.
33. Johnson, M. 1998a. PCFG Models of Linguistic Tree Representations, Computational Linguistics 24(4), 613-632.
34. Johnson, M. 1998b. The DOP Estimation Method is Biased and Inconsistent. Draft of Johnson (2002).
35. Johnson, M. 2002. The DOP Estimation Method is Biased and Inconsistent. Computational Linguistics, 28, 71-76.
36. Manning C. and H. Schatze, 1999. Foundations of Statistical Natural Language Processing. The MIT Press, Cambridge.
37. Marcus, M., B. Santorini and M. Marcinkiewicz, 1993. Building a Large Annotated Corpus of English: the Penn Treebank, Computational Linguistics 19(2).
38. Pereira, F. and Y. Schabes, 1992. Inside-Outside Reestimation from Partially Bracketed Corpora. Proceedings ACL'92, Newark, Delaware.
39. Scha, R. 1990. Taaltheorie en Taaltechnologie; Competence en Performance, in Q.A.M. de Kort and G.L J Leerdam (e d s), Computertoepassingen in de Neerlandistiek, Almere: Landelijke Vereniging van Neerlandici (LVVN-jaarboek).
40. Schabes, Y. 1992. Stochastic Lexicalized Tree-Adjoining Grammars. Proceedings COLING'92, Nantes, France.
41. Sima'an, K. 1995. An optimized algorithm for Data Oriented Parsing. Proceedings International Conference on Recent Advances in Natural Language Processing, Tzigov Chark, Bulgaria.
42. Sima'an, K. 1996. Computational Complexity of Probabilistic Disambiguation by means of Tree Grammars, In Proceedings COLING-96, Copenhagen, Denmark.
43. Sima'an, K. 1999. Learning Efficient Disambiguation. PhD thesis, University of Amsterdam, The Netherlands.
44. Sima'an, K. 2000. Tree-gram Parsing: Lexical Dependencies and Structural Relations, Proceedings ACL'2000, Hong Kong, China.