Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Finite-state methods and models in natural language processing

Published: 01 April 2011 Publication History

Abstract

For the past two decades, specialised events on finite-state methods have been successful in presenting interesting studies on natural language processing to the public through journals and collections. The FSMNLP workshops have become well-known among researchers and are now the main forum of the Association for Computational Linguistics' (ACL) Special Interest Group on Finite-State Methods (SIGFSM). The current issue on finite-state methods and models in natural language processing was planned in 2008 in this context as a response to a call for special issue proposals. In 2010, the issue received a total of sixteen submissions, some of which were extended and updated versions of workshop papers, and others which were completely new. The final selection, consisting of only seven papers that could fit into one issue, is not fully representative, but complements the prior special issues in a nice way. The selected papers showcase a few areas where finite-state methods have less than obvious and sometimes even groundbreaking relevance to natural language processing (NLP) applications.

References

[1]
Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., D. Lugiez, Tison, S., and Tommasi, M. 2007. Tree automata techniques and applications. http://www.grappa. univ-lille3.fr/tata. Accessed on December 1, 2010.
[2]
Droste, M., and Gastin, P. 2007. Weighted automata and weighted logics. Theoretical Computer Science 380: 69-86.
[3]
Hirschman, L., and Gaizauskas, R. 2001. Natural language question answering: the view from here. Natural Language Engineering 7(4): 275-300.
[4]
Hulden, M. 2009. Regular expressions and predicate logic in finite-state language processing. In J. Piskorski, B. Watson, and A. Yli-Jyrä (eds.), Finite-State Methods and Natural Language Processing. Post-Proceedings of the 7th International Workshop (FSMNLP) 2008, pp. 82-97. Amsterdam, the Netherlands: IOS Press.
[5]
Joshi, A. K., and Levy, L. S. 1982. Phrase structure trees bear more fruit than you would have thought. American Journal of Computational Linguistics 8(1): 1-11.
[6]
Karttunen, L., Koskenniemi, K., and van Noord, G. 2003. Special issue: finite-state methods in natural language processing. Natural Language Engineering 9(1): 1-3.
[7]
Kleene, S. C. 1956. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy (eds.), Automata Studies, pp. 3-42. Princeton, NJ: Princeton University Press.
[8]
Knight, K. 2007. Capturing practical natural language transformations. Machine Translation 21(2): 121-33.
[9]
Kornai, A. 1985. Natural language and the Chomsky hierarchy. In Proceedings of the EACL 1985, Association for Computational Linguistics, Stroudsburg, PA, USA, pp. 1-7.
[10]
Kornai, A. 1996. Extended finite state models of language. Natural Language Engineering 2(4): 287-90.
[11]
Koskenniemi, K. 1996. Finite-state morphology and information retrieval. Natural Language Engineering 2(4): 331-6.
[12]
Rogers, J., and Pullum, G. K. (forthcoming) Aural pattern recognition experiments and the subregular hierarchy. To appear in Journal of Logic, Language and Information. A near-final draft accessed at http://www.lel.ed.ac.uk/~gpullum/ on December 1, 2010. A shorter version presented to Mathematics of Language 10 Conference, UCLA, July 2007.
[13]
Schützenberger, M. P. 1965. On finite monoids having only trivial subgroups. Information and Control 8(2): 190-4.
[14]
Yli-Jyrä, A. 2003. Describing syntax with star-free regular expressions. In Proceedings of the EACL 2003, Association for Computational Linguistics, Stroudsburg, PA, USA, pp. 379-86.
[15]
Yli-Jyrä, A. 2005. Approximating dependency grammars through intersection of star-free regular languages. International Journal of Foundations of Computer Science 16(3): 565-80.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Natural Language Engineering
Natural Language Engineering  Volume 17, Issue 2
April 2011
145 pages

Publisher

Cambridge University Press

United States

Publication History

Published: 01 April 2011

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Feb 2025

Other Metrics

Citations

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media