-
1
-
-
0003791899
-
-
Parsing. Prentice Hall, Englewood Cliffs, NJ
-
Aho, Alfred V. and Jeffrey D. Ullman. 1972. Parsing, volume 1 of The Theory of Parsing, Translation and Compiling. Prentice Hall, Englewood Cliffs, NJ.
-
(1972)
The Theory of Parsing, Translation and Compiling
, vol.1
-
-
Aho, A.V.1
Ullman, J.D.2
-
2
-
-
0041355527
-
On formal properties of simple phrase structure grammars
-
Yehoshua Bar-Hillel, editor. Addison-Wesley, Reading, MA
-
Bar-Hillel, Yehoshua, M. Perles, and E. Shamir. 1964. On formal properties of simple phrase structure grammars. In Yehoshua Bar-Hillel, editor, Language and Information: Selected Essays on Their Theory and Application. Addison-Wesley, Reading, MA, pages 116-150.
-
(1964)
Language and Information: Selected Essays on Their Theory and Application
, pp. 116-150
-
-
Bar-Hillel, Y.1
Perles, M.2
Shamir, E.3
-
4
-
-
0015617823
-
Applying probabilistic measures to abstract languages
-
Booth, Taylor L. and Richard A. Thompson. 1973. Applying probabilistic measures to abstract languages. IEEE Transactions on Computers, C-22(5):442-450.
-
(1973)
IEEE Transactions on Computers
, vol.C-22
, Issue.5
, pp. 442-450
-
-
Booth, T.L.1
Thompson, R.A.2
-
6
-
-
85135366718
-
The berkeley restaurant project
-
Yokohama, Japan
-
Jurafsky, Daniel, Chuck Wooters, Gary Tajchman, Jonathan Segal, Andreas Stolcke, Eric Fosler, and Nelson Morgan. 1994. The Berkeley Restaurant Project. In Proceedings of the International Conference on Spoken Language Processing (ICSLP-94), pages 2139-2142, Yokohama, Japan.
-
(1994)
Proceedings of the International Conference on Spoken Language Processing (ICSLP-94)
, pp. 2139-2142
-
-
Jurafsky, D.1
Wooters, C.2
Tajchman, G.3
Segal, J.4
Stolcke, A.5
Fosler, E.6
Morgan, N.7
-
7
-
-
0028550267
-
Recognition can be harder than parsing
-
Lang, Bernard. 1994. Recognition can be harder than parsing. Computational Intelligence, 10(4):486-494.
-
(1994)
Computational Intelligence
, vol.10
, Issue.4
, pp. 486-494
-
-
Lang, B.1
-
9
-
-
0348198473
-
Finite-state transducers in language and speech processing
-
Mohri, Mehryar. 1997. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2):269-311.
-
(1997)
Computational Linguistics
, vol.23
, Issue.2
, pp. 269-311
-
-
Mohri, M.1
-
10
-
-
0012267739
-
Regular approximation of context-free grammars through transformation
-
J.-C. Junqua and G. van Noord, editors. Kluwer Academic
-
Mohri, Mehryar and Mark-Jan Nederhof. 2001. Regular approximation of context-free grammars through transformation. In J.-C. Junqua and G. van Noord, editors, Robustness in Language and Speech Technology. Kluwer Academic, pages 153-163.
-
(2001)
Robustness in Language and Speech Technology
, pp. 153-163
-
-
Mohri, M.1
Nederhof, M.-J.2
-
11
-
-
0012259830
-
Practical experiments with regular approximation of context-free languages
-
Nederhof, Mark-Jan. 2000. Practical experiments with regular approximation of context-free languages. Computational Linguistics, 26(1):17-44.
-
(2000)
Computational Linguistics
, vol.26
, Issue.1
, pp. 17-44
-
-
Nederhof, M.-J.1
-
12
-
-
33646433372
-
Probabilistic parsing as intersection
-
Laboratoire Lorrain de recherche en informatique et ses applications (LORIA), Nancy, France, April
-
Nederhof, Mark-Jan and Giorgio Satta. 2003. Probabilistic parsing as intersection. In Proceedings of the Eighth International Workshop on Parsing Technologies, pages 137-148, Laboratoire Lorrain de recherche en informatique et ses applications (LORIA), Nancy, France, April.
-
(2003)
Proceedings of the Eighth International Workshop on Parsing Technologies
, pp. 137-148
-
-
Nederhof, M.-J.1
Satta, G.2
-
15
-
-
0015385156
-
Probabilistic grammars and automata
-
Santos, Eugene S. 1972. Probabilistic grammars and automata. Information and Control, 21:27-47.
-
(1972)
Information and Control
, vol.21
, pp. 27-47
-
-
Santos, E.S.1
-
16
-
-
0026419167
-
On multiple context-free grammars
-
Seki, Hiroyuki, Takashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991. On multiple context-free grammars. Theoretical Computer Science, 88:191-229.
-
(1991)
Theoretical Computer Science
, vol.88
, pp. 191-229
-
-
Seki, H.1
Matsumura, T.2
Fujii, M.3
Kasami, T.4
-
18
-
-
85015248996
-
Precise N-gram probabilities from stochastic context-free grammars
-
Las Cruces, NM, June
-
Stolcke, Andreas and Jonathan Segal. 1994. Precise N-gram probabilities from stochastic context-free grammars. In Proceedings of the 32nd Annual Meeting of the ACL, pages 74-79, Las Cruces, NM, June.
-
(1994)
Proceedings of the 32nd Annual Meeting of the ACL
, pp. 74-79
-
-
Stolcke, A.1
Segal, J.2
-
19
-
-
33745169143
-
The use of shared forests in tree adjoining grammar parsing
-
Utrecht, The Netherlands, April
-
Vijay-Shanker, K. and David J. Weir. 1993. The use of shared forests in tree adjoining grammar parsing. In Proceedings of the Sixth Conference of the European Chapter of the ACL, pages 384-393, Utrecht, The Netherlands, April.
-
(1993)
Proceedings of the Sixth Conference of the European Chapter of the ACL
, pp. 384-393
-
-
Vijay-Shanker, K.1
Weir, D.J.2
-
20
-
-
0026372948
-
Integration of speech recognition and natural language processing in the MIT Voyager system
-
Toronto
-
Zue, Victor, James Glass, David Goodine, Hong Leung, Michael Phillips, Joseph Polifroni, and Stephanie Seneff. 1991. Integration of speech recognition and natural language processing in the MIT Voyager system. In Proceedings of the ICASSP-91, Toronto, volume 1, pages 713-716.
-
(1991)
Proceedings of the ICASSP-91
, vol.1
, pp. 713-716
-
-
Zue, V.1
Glass, J.2
Goodine, D.3
Leung, H.4
Phillips, M.5
Polifroni, J.6
Seneff, S.7
|