
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Jose Luis Verd?Mas, Rafael C. Carrasco, Jorge CaleraRubio, "Parsing with Probabilistic Strictly Locally Testable Tree Languages," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 7, pp. 10401050, July, 2005.  
BibTex  x  
@article{ 10.1109/TPAMI.2005.144, author = {Jose Luis Verd?Mas and Rafael C. Carrasco and Jorge CaleraRubio}, title = {Parsing with Probabilistic Strictly Locally Testable Tree Languages}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {27}, number = {7}, issn = {01628828}, year = {2005}, pages = {10401050}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2005.144}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Parsing with Probabilistic Strictly Locally Testable Tree Languages IS  7 SN  01628828 SP1040 EP1050 EPD  10401050 A1  Jose Luis Verd?Mas, A1  Rafael C. Carrasco, A1  Jorge CaleraRubio, PY  2005 KW  Index Terms Parsing with probabilistic grammars KW  stochastic learning KW  tree grammars. VL  27 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] G. Riccardi, R. Pieraccini, and E. Bocchieri, “Stochastic Automata for Language Modeling,” Computer Speech and Language, vol. 10, no. 4, pp. 265293, 1996.
[2] J. Hu, W. Turin, and M.K. Brown, “Language Modeling with Stochastic Automata,” Proc. Fourth Int'l Conf. Spoken Language Processing, vol. 1, pp. 406409, 1996, .
[3] Y. Esteve, F. Bechet, A. Nasr, and R.D. Mori, “Stochastic Finite State Automata Language Model Triggered by Dialogue States,” Proc. Eurospeech, pp. 725728, 2001.
[4] R. McNaughton and S. Papert, CounterFree Automata. Cambridge, Mass.: MIT Press, 1971.
[5] P. García and E. Vidal, “Inference of $k\hbox{}{\rm{Testable}}$ Languages in the Strict Sense and Application to Syntactic Pattern Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 9, pp. 920925, Sept. 1990.
[6] T. Yokomori, “On PolynomialTime Learnability in the Limit of Strictly Deterministic Automata,” Machine Learning, vol. 19, no. 2, pp. 153179, 1995.
[7] T. Yokomori, N. Ishida, and S. Kobayashi, “Learning Local Languages and Its Application to Protein AlphaChain Identification,” Proc. 27th Hawaii Int'l Conf. System Sciences, pp. 113122, 1994, .
[8] K.W. Church and W. Gale, “A Comparison of the Enhanced GoodTuring and Deleted Estimation Methods for Estimating Probabilities of English Bigrams,” Computer Speech and Language, vol. 5, pp. 1954, 1991.
[9] H. Ney, U. Essen, and R. Kneser, “On the Estimation of Small Probabilities by LeavingOneOut,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 12, pp. 12021212, Dec. 1995.
[10] E. Charniak, Statistical Language Learning. MIT Press, 1993.
[11] K. Sima'an, R. Bod, S. Krauwer, and R. Scha, “Efficient Disambiguation by Means of Stochastic Tree Substitution Grammars,” Proc. Int'l Conf. New Methods in Language Processing, D.B. Jones and H.L. Somers, eds., pp. 5058, Sept. 1994.
[12] A. Stolcke, “An Efficient ContextFree Parsing Algorithm that Computes Prefix Probabilities,” Computational Linguistics vol. 21, no. 2, pp. 165201, 1995.
[13] M. Thorup, “Disambiguating Grammars by Exclusion of SubParse Trees,” Acta Informatica, vol. 33, no. 6, pp. 511522, 1996.
[14] P. Prescod, “Formalizing XML and SGML Instances with Forest Automata Theory,” technical report, draft technical paper, Dept. of Computer Science, Univ. of Waterloo, Waterloo, Ontario, Canada, 2002.
[15] M. Murata, “Transformation of Documents and Schemas by Patterns and Contextual Conditions,” Proc. Principles of Document Processing, Third Int'l Workshop, C.K. Nicholas and D. Wood, eds., vol. 1293, pp. 153169, 1997.
[16] J. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Language, and Computation. Reading, Mass.: AddisonWesley, 1979.
[17] Y. Sakakibara, M. Brown, R.C. Underwood, I.S. Mian, and D. Haussler, “Stochastic ContextFree Grammars for Modeling RNA,” Proc. 27th Ann. Hawaii Int'l Conf. System Sciences, Vol. 5: Biotechnology Computing, L. Hunter, ed., pp. 284294, Jan. 1994.
[18] F. Gécseg and M. Steinby, Tree Automata. Budapest: Akademiai Kiado, 1984.
[19] Y. Sakakibara, “Efficient Learning of ContextFree Grammars from Positive Structural Examples,” Information and Computation, vol. 97, no. 1, pp. 2360, Mar. 1992.
[20] M. Nivat and A. Podelski, “Minimal Ascending and Descending Tree Automata,” SIAM J. Computing, vol. 26, no. 1, pp. 3958, 1997.
[21] T. Knuutila, “Inference of $k\hbox{}{\rm{Testable}}$ Tree Languages,” Proc. Int'l Workshop Structural and Syntactic Pattern Recognition, Advances in Structural and Syntactic Pattern Recognition, H. Bunke, ed., 1993.
[22] E. Black, S. Abney, D. Flickinger, C. Gdaniec, R. Grishman, P. Harrison, D. Hindle, R. Ingria, F. Jelinek, J. Klavans, M. Liberman, M. Marcus, S. Roukos, B. Santorini, and T. Strzalkowski, “A Procedure for Quantitatively Comparing the Syntatic Coverage of English Grammars,” Proc. Speech and Natural Language Workshop 1991, pp. 306311, 1991.
[23] C. Manning and H. Schütze, Foundations of Statistical Natural Language Processing. Cambridge, Mass.: MIT Press, 1999.
[24] A. Radford, M. Atkinson, D. Britain, H. Clahsen, and A. Spencer, Linguistics: An Introduction. Cambridge, U.K.: Cambridge Univ. Press, 1999.
[25] A.V. Aho, R. Sethi, and J.D. Ullman, Compilers Principles, Techniques, and Tools. Addison Wesley, 1986.
[26] W.J. Hutchins and H.L. Somers, An Introduction to Machine Translation. New York: Academic Press, 1992.
[27] T.M. Cover and J.A. Thomas, Elements of Information Theory. New York: John Wiley & Sons, 1991.
[28] C.S. Wetherell, “Probabilistic Languages: A Review and Some Open Questions,” ACM Computing Surveys, vol. 12, no. 4, pp. 361379, Dec. 1980.
[29] E. Gold, “Language Identification in the Limit,” Information and Control, vol. 10, pp. 447474, 1967.
[30] A. Stolcke and J. Segal, “Precise $n\hbox{}{\rm{Gram}}$ Probabilities from Stochastic ContextFree Grammars,” Technical Report TR94007, Int'l Computer Science Inst., Berkeley, Calif., Jan. 1994.
[31] J. CaleraRubio and R.C. Carrasco, “Computing the Relative Entropy between Regular Tree Languages,” Information Processing Letters, vol. 68, no. 6, pp. 283289, 1998.
[32] L.R. Rabiner, “A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition,” Proc. IEEE, vol. 77, no. 2, pp. 257285, Feb. 1989.
[33] R.C. Carrasco and J. Oncina, “LearningDeterministic Regular Grammars from Stochastic Samples in Polynomial Time,” RAIRO (Theoretical Informatics and Applications), vol. 33, no. 1, pp. 120, 1999.
[34] R.C. Carrasco, J. Oncina, and J. CaleraRubio, “Stochastic Inference of Regular Tree Languages,” Machine Learning, vol. 44, nos. 1/2, pp. 185197, 2001.
[35] L. Frazier and K. Rayner, “Making and Correcting Errors During Sentence Comprehension: Eye Movements in the Analysis of Structurally Ambiguous Sentences,” Cognitive Psychology, vol. 14, pp. 178210, 1982.
[36] M.P. Marcus, B. Santorini, and M. Marcinkiewicz, “Building a Large Annotated Corpus of English: The Penn Treebank,” Computational Linguistics, vol. 19, pp. 313330, 1993.
[37] E. Charniak, “TreeBank Grammars,” Proc. 13th Nat'l Conf. Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conf., pp. 10311036, 1996.
[38] M. Johnson, “PCFG Models of Linguistic Tree Representations,” Computational Linguistics, vol. 24, no. 4, pp. 613632, 1998.
[39] E. Black, F. Jelinek, J.D. Lafferty, D.M. Magerman, R.L. Mercer, and S. Roukos, “Towards HistoryBased Grammars: Using Richer Models for Probabilistic Parsing,” Proc. DARPA Speech and Natural Language Workshop, pp. 3137, 1992.
[40] R. Bod and R. Scha, “DataOriented Language Processing: An Overview,” Technical Report LP9613, Dept. of Computational Linguistics, Univ. of Amsterdam, The Netherlands, 1996.
[41] J. Sáchez and J. Benedi, “Consistency of Stochastic ContextFree Grammars from Probabilistic Estimation Based on Growth Transformations,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 9, pp. 10521055, Sept. 1997.
[42] Z. Chi and S. Geman, “Estimation of Probabilistic ContextFree Grammars,” Computational Linguistics, vol. 24, no. 2, pp. 299305, 1998.
[43] J. Chappelier and M. Rajman, “A Generalized CYK Algorithm for Parsing Stochastic CFG,” Proc. Tabulation in Parsing and Deduction, pp. 133137, Apr. 1998, http://www.asel.udel.edu/icslp/cdrom/vol1/ 996/a996.pdfciteseer.ist.psu.edu/article/ yokomori96learning.htmlftp://ftp.inria.fr/ INRIA/Projects/Atoll/TAPD98chappelier.ps.gz .
[44] J. Carroll, T. Briscoe, and A. Sanfilippo, “Parser Evaluation: A Survey and a New Proposal,” Proc. Int'l Conf. Language Resources and Evaluation, pp. 447454, 1998.
[45] A. Krotov, R. Gaizauskas, M. Hepple, and Y. Wilks, “Compacting the Penn Treebank Grammar,” Proc. COLINGACL'98 Joint Conf. (17th Int'l Conf. Computational Linguistics, and 36th Ann. Meeting of the Assoc. Computational Linguistics), pp. 699703, 1998.
[46] F. Pereira and Y. Schabes, “InsideOutside ReEstimation from Partially Bracketed Corpora,” Proc. 30th Ann. Meeting of the ACL, pp. 128135, 1992.