next up previous contents
Next: About this document ... Up: Algorithms for Linguistic Processing Previous: The construction of lgrep   Contents

Bibliography

1
Steven Abney.
Partial parsing via finite-state cascades.
In John Carroll, editor, Workshop on Robust Parsing; Eight European Summer School in Logic, Language and Information, pages 8-15, 1995.

2
Hiyan Alshawi, editor.
The Core Language Engine.
ACL-MIT press, Cambridge Mass., 1992.

3
R. H. Baayen, R. Piepenbrock, and H. van Rijn.
The CELEX Lexical Database (CD-ROM).
Linguistic Data Consortium, University of Pennsylvania, Philadelphia, PA, 1993.

4
J. K. Baker.
Trainable grammars for speech recognition.
In Jared J. Wolf and Dennis H. Klatt, editors, Speech Communication Papers Presented ath the 97th Meething of the Acoustical Society of America, MIT Cambridge, 1979.

5
Kenneth R. Beesley.
Constraining separated morphotactic dependencies in finite-state grammars.
In Finite-state Methods in Natural Language Processing, pages 118-127, Ankara, 1998.

6
A.W. Black.
Finite state machines from feature grammars.
In International Workshop on Parsing Technologies, pages 277-285, Pittsburgh, 1989.

7
E. Black, S. Eubank, H. Kashioka, R. Garside, G. Leech, and D. Magerman.
Beyond skeleton parsing: Producing a comprehensive large-scale general-english treebank with full grammatical analysis.
In Proceedings of the 16th International Conference on Computational Linguistics (COLING), pages pages 107-112, Copenhagen, 1996.

8
Ezra Black, Stephen Eubank, Hideki Kashioka, and David Magerman.
Probabilistic parsing of unrestricted english text, with a highly-detailed grammar.
In Joe Zhou and Kenneth Church, editors, Proceedings of the Fifth Workshop on Very Large Corpora, Beijing and Hong Kong, 1997.

9
Rens Bod.
Enriching Linguistics with Statistics: Performance Models of Natural Language.
PhD thesis, University of Amsterdam, 1995.

10
Remko Bonnema, Gertjan van Noord, and Gert Veldhuizen van Zanten.
Evaluation results NLP components OVIS2.
Technical Report 57, NWO Priority Programme Language and Speech Technology, 1998.

11
Gosse Bouma and Ineke Schuurman.
De positie van het Nederlands in taal- en spraaktechnologie.
De Nederlandse Taalunie, 1998.

12
Michael R. Brent.
Automatic acquisition of subcategorization frames from untagged text.
In 29th Annual Meeting of the Association for Computational Linguistics, pages 209-214, Berkeley, 1991.

13
Michael R. Brent.
From grammar to lexicon.
Computational Linguistics, 19(2):243-262, 1993.

14
Joan Bresnan, editor.
The Mental Representation of Grammatical Relations.
MIT Press, Cambridge Mass., 1982.

15
Eric Brill.
A simple rule-based part-of-speech tagger.
In Proceedings Third Conference on Applied Natural Language Processing, pages 152-155, Trento, Italy, 1992.

16
Eric Brill.
Transformation-based error-driven learning and natural language processing: A case study in part of speech tagging.
Computational Linguistics, 21(4):543-566, 1995.

17
Eric Brill and Philip Resnik.
A rule-based appraoch to prepositional phrase attachment disambiguation.
In Proceedings of the 15th International Conference on Computational Linguistics (COLING), Kyoto, 1994.

18
Ted Briscoe and John Carroll.
Generalized probabilistic LR parsing.
Computational Linguistics, 19(1), 1993.

19
Ted Briscoe, Claire Grover, Bran Boguraev, and John Carroll.
A formalism and environment for the development of a large grammar of english.
In Proceedings of the 10th International Joint Conference on Artificial Intelligence, pages 703-708, Milan, 1987.

20
Bob Carpenter and Gerald Penn.
The Attribute Logic Engine User Guide, 1998.
Version 3.1 Beta.

21
Glenn Carroll and Mats Rooth.
Valence induction with a head-lexicalized PCFG.
www.ims.uni-stuttgart.de/~mats, 1997.

22
John Carroll, Guido Minnen, and Ted Briscoe.
Can subcategorisation probabilities help a statistical parser?
In Proceedings 6th Workshop on Very Large Corpora, Montreal, 1998.

23
Jean-Pierre Chanod and Pasi Tapanainen.
A robust finite-state grammar for french.
In John Carroll, editor, Workshop on Robust Parsing, Prague, 1996.

24
Noam Chomsky.
Formal properties of grammars.
In R. Duncan Luce, Robert R. Bush, and Eugene Galanter, editors, Handbook of Mathematical Psychology; Volume II, pages 323-418. John Wiley, 1963.

25
Noam Chomsky.
On the notion `rule of grammar'.
In Jerry E. Fodor and Jerrold J. Katz, editors, The Structure of Language; Readings in the Philosophy of Language, pages 119-136. Prentice Hall, 1964.

26
Noam Chomsky.
Aspects of the Theory of Syntax.
MIT press, Cambridge Mass., 1965.

27
Michael Collins.
A new statistical parser based on bigram lexical dependencies.
In 34th Annual Meeting of the Association for Computational Linguistics, Santa Cruz, 1996.

28
Michael Collins.
Three generative, lexicalised models for statistical parsing.
In 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics, Madrid, 1997.

29
Michael Collins and J. Brooks.
Prepositional phrase attachment through a backed-off model.
In Proceedings of the Third Workshop on Very Large Corpora, Cambridge MA, 1995.

30
Jan Daciuk.
Incremental Construction of Finite-state Automata and Transducers, and their Use in the Natural Language Processing.
PhD thesis, Technical University of Gdansk, 1998.

31
Erika F. de Lima.
Acquiring german prepositinal subcategorization frames from corpora.
In Joe Zhou and Kenneth Church, editors, Proceedings of the Fifth Workshop on Very Large Corpora, Beijing and Hong Kong, 1997.

32
P. C. Uit den Boogaart.
Woordfrequenties in geschreven en gesproken Nederlands.
Oosthoek, Scheltema & Holkema, Utrecht, 1975.
Werkgroep Frequentie-onderzoek van het Nederlands.

33
Jason M. Eisner.
Three new probabilistic models for dependency parsing: An exploration.
In Proceedings of the 16th International Conference on Computational Linguistics (COLING), pages 340-345, Copenhagen, 1996.

34
Jason M. Eisner.
An empirical comparison of probability models for dependency grammar.
Technical report, CIS department, University of Pennsylvania, 1997.
cmp-lg/9706004.

35
Ergo.
English resource grammar online; a multi-purpose broad-coverage computational grammar of english, 1998.
hpsg.stanford.edu/hpsg/ergo.html.

36
Edmund Grimley Evans.
Approximating context-free grammars with a finite-state calculus.
In 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics, pages 452-459, Madrid, 1997.

37
Edmund Grimley Evans, George Anton Kiraz, and Stephen G. Pulman.
Compiling a partition-based two-level formalism.
In Proceedings of the 16th International Conference on Computational Linguistics (COLING), Copenhagen, 1996.

38
Gerald Gazdar, Ewan Klein, Geoffrey Pullum, and Ivan Sag.
Generalized Phrase Structure Grammar.
Blackwell, 1985.

39
Gregory Grefenstette.
Light parsing as finite-state filtering.
In EACI 1996 Workshop Extended Finite-State Models of Language, Budapest, 1996.

40
Gregory Grefenstette and Pasi Tapanainen.
What is a word, what is a sentence? problems of tokenization.
Technical Report MLTT-004, Xerox Research Centre Europe, MLTT, 1994.

41
Ralph Grishman, Ngo Thanh Nhan, Elaine Marsh, and Lynette Hirschman.
Automated determination of sublanguage syntactic usage.
In Proceedings of the 10th International Conference on Computational Linguistics and the 22nd Annual Meeting of the Association for Computational Linguistics (COLING), Stanford, 1984.

42
Maurice Gross.
The use of Finite Automata in the Lexical Representation of Natural Language.
Lecture Notes in Computer Science. Springer Verlag, Berlin, 1989.

43
Maurice Gross.
Local grammars.
In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 330-354. MIT Press, Cambridge, 1997.

44
The XTAG Research Group.
A Lexicalized Tree Adjoining Grammar for English.
Institute for Research in Cognitive Science, University of Pennsylvania, 1998.
cs.CL/9809024.

45
Claire Grover, John Carroll, and Ted Briscoe.
The ALVEY natural language tools grammar (4th release).
Technical Report 284, Computer Laboratory, Cambridge University UK, 1993.

46
Peter Hellwig.
Dependency unification grammar.
In Proceedings of the 11th International Conference on Computational Linguistics (COLING), pages 195-198, Bonn, 1986.

47
Riny Huybrechts.
The weak inadequacy of context-free phrase structure grammars.
In Ger de Haan, Mieke Trommelen, and Wim Zonneveld, editors, Van Periferie naar Kern. Foris, 1984.

48
F. Jelinek, J. Lafferty, D. Magerman, R. Mercer, A. Ratnaparkhi, and S. Roukos.
Decision tree parsing using a hidden derivation model.
In Proceedings of the 1994 Human Language Technology Workshop (ARPA), pages 272-277, 1994.

49
Frederick Jelinek.
Statistical Methods for Speech Recognition.
MIT Press, 1998.

50
C. Douglas Johnson.
Formal Aspects of Phonological Description.
Mouton, The Hague, 1972.

51
Mark Johnson.
Finite-state approximation of constraint-based grammars using left-corner grammar transforms.
In COLING-ACL '98. 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics. Proceedings of the Conference, Montreal, 1998.

52
Philip N. Johnson-Laird.
Mental Models.
Harvard University Press, 1983.

53
Aravind K. Joshi and B. Srinivas.
Disambiguation of super parts of speech (supertags): Almost parsing.
In Proceedings of the 15th International Conference on Computational Linguistics (COLING), Kyoto, Japan, 1994.

54
Ronald M. Kaplan and Martin Kay.
Regular models of phonological rule systems.
Computational Linguistics, 20(3):331-378, 1994.

55
Fred Karlsson, Atro Voutilainen, Juha Heikkila, and Atro Anttila.
Constraint Grammar, A Language-independent System for Parsing Unrestricted Text.
Mouton de Gruyter, 1995.

56
Lauri Karttunen.
The replace operator.
In 33th Annual Meeting of the Association for Computational Linguistics, M.I.T. Cambridge Mass., 1995.

57
Lauri Karttunen.
The proper treatment of optimality theory in computational phonology.
In Finite-state Methods in Natural Language Processing, pages 1-12, Ankara, 1998.

58
George Anton Kiraz.
Compiling regular formalisms with rule features into finite-state automata.
In 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics, Madrid, 1997.

59
Kimmo Koskenniemi.
Two-level morphology: a general computational model for word-form recognition and production.
Technical Report 11, Department of General Linguistics, University of Helsinki, 1983.

60
Jan Koster.
Dutch as an SOV language.
Linguistic Analysis, 1, 1975.

61
Tomasz Kowaltowski, Cláudio L. Lucchesi, and Jorge Stolfi.
Minimization of binary automata.
Technical Report Relatório Téchnico DCC-22/93, Departamento de Ciência de Computacão, Universidade Estudual de Campinas, 1993.

62
Steven Krauwer and Louis des Tombe.
Transducers and grammars as theories of language.
Theoretical Linguistics, 8:173-202, 1981.

63
J. G. Kruyt.
Nationale tekstcorpora in internationaal perspectief.
Forum der Letteren, 36(1):47-58, 1995.

64
Seungmi Lee and Key-Sun Choi.
Automatic acquisition of language model based on head-dependent relation between words.
In 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Montreal, 1998.

65
Sabine Lehmann, Stephan Oepen, Sylvie Regnier-Prost, Klaus Netter, Veronika Lux, Judith Klein, Kirsten Falkedal, Frederik Fouvry, Dominique Estival, Eva Dauphin, Hervé Compagnion, Judith Baur, Lorna Balkan, and Doug Arnold.
Tsnlp--test suites for natural language processing, 1996.
cmp-lg/9607018.

66
Pim Levelt.
Corpus gesproken Nederlands, 1998.
zie ook www.elis.rug.ac.be/cgn/.

67
LFG ParGram.
Parallel grammar project, 1998.
www.parc.xerox.com/istl/groups/nltt/pargram/.

68
Linguistic Data Consortium, University of Pennsylvania, Philadelphia.
tgrepdoc--documentation for tgrep.

69
David M. Magerman.
Statistical decision-tree models for parsing.
In 33th Annual Meeting of the Association for Computational Linguistics, MIT Cambridge, 1995.

70
Chris Manning.
Automatic acquisition of a large subcategorization dictionary from corpora.
In 29th Annual Meeting of the Association for Computational Linguistics, pages 235-242, Berkeley, 1991.

71
Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz.
Building a large annotated corpus of english: The Penn treebank.
Computational Linguistics, 19(2), 1993.

72
Mitchell Marcuss, Grace Kim, Mary Ann Marcinkiewicz, Robert MacIntyre, Ann Bies, Mark Ferguson, Karen Katz, and Britta Schasberger.
The Penn treebank: Annotating predicate argument structure.
In Proceedings of the 1994 Human Language Technology Workshop (ARPA), pages 110-115, 1994.

73
George Miller and Noam Chomsky.
Finitary models of language users.
In R. Luce, R. Bush, and E. Galanter, editors, Handbook of Mathematical Psychology. Volume 2. John Wiley, 1963.

74
Mehryar Mohri.
On some applications of finite-state automata theory to natural language processing.
Natural Language Engineering, 2:61-80, 1996.
Originally appeared in 1994 as Technical Report, institut Gaspard Monge, Paris.

75
Mehryar Mohri, Michael Riley, Don Hindle, Andrej Ljolje, and Fernando Pereira.
Full expansion of context-dependent networks in large vocabulary speech recognition.
In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP '98), Seattle, 1998.

76
Mehryar Mohri and Richard Sproat.
An efficient compiler for weighted rewrite rules.
In 34th Annual Meeting of the Association for Computational Linguistics, Santa Cruz, 1996.

77
Mark-Jan Nederhof.
Regular approximations of CFLs: A grammatical view.
In International Workshop on Parsing Technologies, pages 159-170, 1997.

78
Mark-Jan Nederhof.
Context-free parsing through regular approximation.
In Finite-state Methods in Natural Language Processing, pages 13-24, Ankara, 1998.

79
Referentiebestand Nederlands.
Referentiebestand nederlands (rbn), 1998.
www.taalunie.org/%5F%5F/werkt/rbn.html.

80
Kemal Oflazer.
Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction.
Computational Linguistics, 22(1):73-89, 1996.

81
Parole.
Le-parole, preparatory action for linguistic resources organisation for language engineering. project summary, 1998.
www2.echo.lu/langeng/en/le2/le-parole/le-parole.html.

82
Fernando Pereira and Yves Schabes.
Inside-outside reestimation from partially bracketed corpora.
In 30th Annual Meeting of the Association for Computational Linguistics, Newark, Delaware, 1992.

83
Fernando C. N. Pereira and Michael D. Riley.
Speech recognition by composition of weighted finite automata, 1996.
cmp-lg/9603001.

84
Fernando C. N. Pereira and R. N. Wright.
Finite-state approximation of phrase structure grammars.
In 29th Annual Meeting of the Association for Computational Linguistics, Berkeley, 1991.

85
Fernando C. N. Pereira and Rebecca N. Wright.
Finite-state approximation of phrase-structure grammars.
In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 149-173. MIT Press, Cambridge, 1997.

86
Carl Pollard and Ivan Sag.
Head-driven Phrase Structure Grammar.
University of Chicago / CSLI, 1994.

87
Alan Prince and Paul Smolensky.
Optimality theory: Constraint interaction in generative grammar.
Technical Report TR-2, Rutgers University Cognitive Science Center, New Brunswick, NJ, 1993.
MIT Press, To Appear.

88
Steve Pulman.
Grammars, parsers, and memory limitations.
Language and Cognitive Processes, 1(3):197-225, 1986.

89
A. Ratnaparkhi, J. Reynar, and S. Roukos.
A maximum entropy model for prepositional phrase attachment.
In Proceedings of the 1994 Human Language Technology Workshop (ARPA), 1994.

90
Manny Rayner.
Applying explanation-based generalization to natural language processing.
In Proceedings of the International Conference on Fifth Generation Computer Systems, Kyoto, 1988.

91
Manny Rayner and David Carter.
Fast parsing using pruning and grammar specialization.
In 34th Annual Meeting of the Association for Computational Linguistics, Santa Cruz, 1996.

92
Manny Rayner and Christer Samuelsson.
Using explanation-based learning to increase performance in a large NL query system.
In Proceedings DARPA Speech and Natural Language Workshop. Morgan Kaufmann, 1990.

93
Philip Resnik.
Left-corner parsing and psychological plausability.
In Proceedings of the 14th International Conference on Computational Linguistics (COLING), Nantes, 1992.

94
Emmanuel Roche.
Parsing with finite-state transducers.
In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 241-281. MIT Press, Cambridge, 1997.

95
Emmanuel Roche and Yves Schabes.
Deterministic part-of-speech tagging with finite-state transducers.
Computational Linguistics, 21(2), 1995.

96
C.M. Rood.
Efficient finite-state approximation of context free grammars.
In A. Kornai, editor, Extended Finite State Models of Language, Proceedings of the ECAI'96 workshop, pages 58-64, Budapest University of Economic Sciences, Hungary, 1996.

97
D. J. Rosenkrantz and P. M. Lewis-II.
Deterministic left corner parsing.
In IEEE Conference of the 11th Annual Symposium on Switching and Automata Theory, pages 139-152, 1970.

98
Ivan Sag.
English relative clause constructions.
Journal of Linguistics, 1997.
to appear.

99
Christer Samuelsson.
Fast Natural-Language Parsing Using Explanation-Based Learning.
PhD thesis, Swedish Institute of Computer Science, Kista, 1994.

100
Remko Scha.
Taaltheorie en taaltechnologie; competence en performance.
In Computertoepassingen in de Neerlandistiek. Landelijke Vereniging van Neerlandici (LVVN Jaarboek), Almere, 1990.

101
Remko Scha, Remko Bonnema, Rens Bod, and Khalil Simaán.
Disambiguation and interpretation of wordgraphs using data oriented parsing. Probabilistic natural language processing in the NWO priority programme on language and speech technology. October 1996 deliverable.
Technical Report 31, NWO Priority Programme Language and Speech Technology, 1996.
Chapter 4.

102
Stuart M. Shieber.
Evidence against the non-context-freeness of natural language.
Linguistics and Philosophy, 8, 1985.

103
Max D. Silberztein.
The lexical analysis of natural language.
In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 175-203. MIT Press, Cambridge, 1997.

104
Wojciech Skut, Thorsten Brants, Brigitte Krenn, and Hans Uszkoreit.
A linguistically interpreted corpus of german newspaper text.
In ESSLLI-98 Workshop on Recent Advances in Corpus Annotation, Saarbrücken, 1998.
cmp-lg/9807008.

105
B. Srinivas and A. Joshi.
Some novel applications of explanation-based learning to parsing lexicalized tree-adjoining grammars.
In 33th Annual Meeting of the Association for Computational Linguistics, MIT Cambridge, 1995.

106
R.E. Stearns.
A regularity test for pushdown machines.
Information and Control, 11:323-340, 1967.

107
Pasi Tapanainen.
Applying a finite-state intersection grammar.
In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 311-327. MIT Press, Cambridge, 1997.

108
J.S. Ullian.
Partial algorithm problems for context free languages.
Information and Control, 11:80-101, 1967.

109
Hans Uszkoreit.
Categorial unification grammar.
In Proceedings of the 11th International Conference on Computational Linguistics (COLING), Bonn, 1986.

110
L.G. Valiant.
Regularity and related problems for deterministic pushdown automata.
Journal of the ACM, 22(1):1-10, 1975.

111
Gertjan van Noord.
FSA Utilities: A toolbox to manipulate finite-state automata.
In Darrell Raymond, Derick Wood, and Sheng Yu, editors, Automata Implementation, pages 87-108. Springer Verlag, 1997.
Lecture Notes in Computer Science 1260.

112
Gertjan van Noord.
The treatment of epsilon moves in subset construction.
In Finite-state Methods in Natural Language Processing, Ankara, 1998.
cmp-lg/9804003.

113
Gertjan van Noord and Gosse Bouma.
Adjuncts and the processing of lexical rules.
In Proceedings of the 15th International Conference on Computational Linguistics (COLING), pages 250-256, Kyoto, 1994.
cmp-lg/9404011.

114
Gertjan van Noord and Gosse Bouma.
Hdrug, A flexible and extendible development environment for natural language processing.
In Proceedings of the EACL/ACL workshop on Environments for Grammar Development, Madrid, 1997.

115
Gertjan van Noord, Gosse Bouma, Rob Koeling, and Mark-Jan Nederhof.
Robust grammatical analysis for spoken dialogue systems.
Journal of Natural Language Engineering, 1998.
To appear; 48 pages.

116
Marc van Oostendorp and Ton van der Wouden.
Corpus internet.
In Nederlandse Taalkunde, 1998.
to appear.

117
K. Vijay-Shanker.
Using descriptions of trees in a tree adjoining grammar.
Computational Linguistics, 18(4), 1993.

118
Piek Vossen and Laura Bloksma.
Categories and classifications in eurowordnet.
In Proceedings of First International Conference on Language Resources and Evaluation, Granada, 1998.

119
Atro Voutilainen.
Designing a (finite-state) parsing grammar.
In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 283-310. MIT Press, Cambridge, 1997.

120
Atro Voutilainen and Pasi Tapanainen.
Ambiguity resolution in a reductionist parser.
In Sixth Conference of the European Chapter of the Association for Computational Linguistics, Utrecht, 1993.

121
Jakub Zavrel and Walter Daelemans.
Memory-based learning: Using similarity for smoothing.
In 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics, pages 436-443, Madrid, 1997.

122
Henk Zeevat, Ewan Klein, and Jo Calder.
Unification categorial grammar.
In Nicholas Haddock, Ewan Klein, and Glyn Morrill, editors, Categorial Grammar, Unification Grammar and Parsing. Centre for Cognitive Science, University of Edinburgh, 1987.
Volume 1 of Working Papers in Cognitive Science.




2000-07-10