Finite Automata for Compact Representation of Language Models in NLP-Reference-Cited by-同舟云学术

Finite Automata for Compact Representation of Language Models in NLP

Published:2002 Issue: Volume: Page:65-73
ISSN:0302-9743
Container-title:Implementation and Application of Automata
language:
Short-container-title:

Author:

Daciuk Jan,van Noord Gertjan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36390-4_6

Reference12 articles.

1. Gosse Bouma, Gertjan van Noord, and Robert Malouf. Wide coverage computational analysis of Dutch. 2001. Submitted to volume based on CLIN-2000. Available from http://www.let.rug. nl/~vannoord/ .

2. Michael Collins. Head-Driven Statistical Models for Natural Language Parsing. PhD thesis, University Of Pennsylvania, 1999.

3. Jan Daciuk. Experiments with automata compression. In M. Daley, M. G. Eramian, and S. Yu, editors, Conference on Implementation and Application of Automata CIAA’2000, pages 113–119, London, Ontario, Canada, July 2000. University of Western Ontario.

4. Jan Daciuk. Finite-state tools for natural language processing. In COLING 2000 Workshop on Using Tools and Architectures to Build NLP Systems, pages 34–37, Luxembourg, August 2000.

5. George Foster. A maximum entropy/minimum divergence translation model. In K. Vijay-Shanker and Chang-Ning Huang, editors, Proceedings of the 38th Meeting of the Association for Computational Linguistics, pages 37–44, Hong Kong, October 2000.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enumerated Automata Implementation of String Dictionaries;Implementation and Application of Automata;2019

2. Incremental Construction of Minimal Tree Automata;Algorithmica;2008-02-06

3. Position Models and Language Modeling;Lecture Notes in Computer Science;2008