IDL-expressions: A formalism for representing and parsing finite languages in natural language processing

Journal of Artificial Intelligence Research

Volumn 21, Issue , 2004, Pages 287-317

  Nederhof, Mark Jan ^a   Satta, Giorgio ^b  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; TRANSLATION (LANGUAGES);

FINITE LANGUAGES; IDL-EXPRESSIONS; MACHINE TRANSLATION; PARSING ALGORITHM;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 27344459154     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1309     Document Type: Review

References (42)

1. Aho, A., & Ullman, J. (1972). Parsing, Vol. 1 of The Theory of Parsing, Translation and Compiling. Prentice-Hall.
2. Aust, H., Oerder, M., Seide, F., & Steinbiss, V. (1995). The Philips automatic train timetable information system. Speech Communication, 17, 249-262.
3. Bangalore, S., & Rambow, O. (2000). Exploiting a probabilistic hierarchical model for generation. In The 18th International Conference on Computational Linguistics, Vol. 1, pp. 42-48, Saarbrücken, Germany.
4. Bar-Hillel, Y., Perles, M., & Shamir, E. (1964). On formal properties of simple phrase structure grammars. In Bar-Hillel, Y. (Ed.), Language and Information: Selected Essays on their Theory and Application, chap. 9, pp. 116-150. Addison-Wesley.
5. Beaven, J. (1992). Shake-and-bake machine translation. In Proc. of the fifteenth International Conference on Computational Linguistics, Vol. 2, pp. 602-609, Nantes.
6. Billot, S., & Lang, B. (1989). The structure of shared forests in ambiguous parsing. In 27th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pp. 143-151, Vancouver, British Columbia, Canada.
7. Brew, C. (1992). Letting the cat out of the bag: generation for Shake-and-Bake MT. In Proc. of the fifteenth International Conference on Computational Linguistics, Vol. 2, pp. 610-616, Nantes.
8. Brown, P., et al. (1990). A statistical approach to machine translation. Computational Linguistics, 16(2), 79-85.
9. Brzozowski, J. (1964). Derivatives of regular expressions. Journal of the ACM, 11(4:), 481-494.
10. Charniak, E. (2001). Immediate-head parsing for language models. In 39th Annual Meeting and 10th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference, pp. 116-123, Toulouse, France.
11. Daniels, M., &: Meurers, W. (2002). Improving the efficiency of parsing with discontinuous constituents. In Wintner, S. (Ed.), Proceedings of NLULP'02: The 7th International Workshop on Natural Language Understanding and Logic Programming, Vol. 92 of Datalogiske Skrifter, pp. 49-68, Copenhagen. Roskilde Universitetscenter.
12. Dassow, J., & Pǎun, G. (1989). Regulated Rewriting in Formal Language Theory. Springer-Verlag.
13. Earley, J. (1970). An efficient context-free parsing algorithm. Communications of the ACM, 13(2), 94-102.
14. Gazdar, G., Klein, E., Pullum, G., & Sag, I. (1985). Generalized Phrase Structure Grammar. Harvard University Press, Cambridge, MA.
15. Gischer, J. (1988). The equational theory of pomsets. Theoretical Computer Science, 61, 199-224.
16. Götz, T., & Meurers, W. (1995). Compiling HPSG type constraints into definite clause programs. In 33rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pp. 85-91, Cambridge, Massachusetts, USA.
17. Götz, T., & Penn, G. (1997). A proposed linear specification language. Volume 134 of Arbeitspapiere des SFB 340, Universität Tübingen.
18. Graham, S., & Harrison, M. (1976). Parsing of general context free languages. In Advances in Computers, Vol. 14, pp. 77-185. Academic Press, New York, NY.
19. Graham, S., Harrison, M., & Ruzzo, W. (1980). An improved context-free recognizer. ACM Transactions on Programming Languages and Systems, 2(3), 415-462.
20. Gusfield, D. (1997). Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge, UK.
21. Harrison, M. (1978). Introduction to Formal Language Theory. Addison-Wesley.
22. Jurafsky, D., & Martin, J. (2000). Speech and Language Processing. Prentice-Hall.
23. Knight, K. (1999). Decoding complexity in word-replacement translation models. Computational Linguistics, 25(4), 607-615.
24. Knight, K., & Hatzivassiloglou, V. (1995). Two-level, many-paths generation. In 33rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pp. 252-260, Cambridge, Massachusetts, USA.
25. Lang, B. (1994). Recognition can be harder than parsing. Computational Intelligence, 10(4), 486-494.
26. Langkilde, I. (2000). Forest-based statistical sentence generation. In 6th Applied Natural Language Processing Conference and 1st Meeting of the North American Chapter of the Association for Computational Linguistics, pp. 170-177 (Section 2), Seattle, Washington, USA.
27. Langkilde, I., & Knight, K. (1998). Generation that exploits corpus-based statistical knowledge. In 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Vol. 1, pp. 704-710, Montreal, Quebec, Canada.
28. Manandhar, S. (1995). Deterministic consistency checking of LP constraints. In Seventh Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference, pp. 165-172, Belfield, Dublin, Ireland.
29. Nederhof, M.-J., & Satta, G. (2004). The language intersection problem for non-recursive context-free grammars. Information and Computation. Accepted for publication.
30. Nederhof, M.-J., Satta, G., & Shieber, S. (2003). Partially ordered multiset context-free grammars and free-word-order parsing. In 8th International Workshop on Parsing Technologies, pp. 171-182, LORIA, Nancy, France.
31. Nevill-Manning, C., & Witten, I. (1997). Compression and explanation using hierarchical grammars. The Computer Journal, 40(2/3), 103-116.
32. Pollard, C., & Sag, I. (1994). Head-Driven Phrase Structure Grammar. University of Chicago Press.
33. Ramsay, A. (1999). Direct parsing with discontinuous phrases. Natural Language Engineering, 5(3), 271-300.
34. Reape, M. (1989). A logical treatment of semi-free word order and bounded discontinuous constituency. In Fourth Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference, pp. 103-110, Manchester, England.
35. Reape, M. (1994). Domain union and word order variation in german. In Nerbonne, J., Netter, K., & Pollard, C. (Eds.), German in Head-Driven Phrase Structure Grammar, pp. 151-197. CSLI Publications.
36. Shieber, S., Schabes, Y., & Pereira, F. (1995). Principles and implementation of deductive parsing. Journal of Logic Programming, 24, 3-36.
37. Suhre, O. (1999). Computational aspects of a grammar formalism for languages with freer word order. Diplomarbeit, Department of Computer Science, University of Tübingen. Published in 2000 as Volume 154 of Arbeitspapiere des SFB 340.
38. Teitelbaum, R. (1973). Context-free error analysis by evaluation of algebraic power series. In Conference Record of the Fifth Annual ACM Symposium on Theory of Computing, pp. 196-199.
39. van der Vlist, E. (2003). RELAX NG. O'Reilly.
40. van Noord, G. (1995). The intersection of finite state automata and definite clause grammars. In 33rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pp. 159-165, Cambridge, Massachusetts, USA.
41. Viterbi, A. (1967). Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, IT-13(2), 260-269.
42. Whitelock, P. (1992). Shake-and-Bake translation. In Proc. of the fifteenth International Conference on Computational Linguistics, Vol. 2, pp. 784-790, Nantes.